We present here a tool to generate given the CCS automatically for the distributed multithreaded system coded in JAVA. Actually in the current scenario distributed systems are get emphasized and hard fact is to verify these systems. CCS (Concurrent communication system) is one of the ways to write formal specifications for concurrent systems but it is quite difficult to write CCS for given distributed system more over dynamic environment, where threads and processes created at runtime. is quit impossible analyze, audit and codify simultaneous. So as per requirement for verification of distributed system, we developed a tool named as Refjav that takes input a java coded file of system that is to be verified and produced output as its equivalent CCS under the set of reasonable restrictions. In present we worked with synchronization, dynamic thread creation and their communication using RMI in distributed, multithreaded Java program. Paper covers the various constructs of Refjav tool and its methodology. Our work is useful for getting CCS of a given Java distributed multithreaded program, which can be verified easily by model checkers to verify properties, expressed in model μ-calculus. As a result we should be in position to comment on the properties of system such as Deadlock, fairness etc, without actually going through the actual details and constructs of CCS.
Hierarchy generation is the very familiar and evolving concept in Relational database management system. There are so many methods currently available to generate as well manage hierarchies. But, carry along sort algorithm is the new method which is used to generate hierarchies dynamically and it is the subset of materialized path. In this paper, we are going to perform the complexity study against "Carry-along Sort" Algorithm in terms of time and space so that the efficiency of this algorithm can be compared with other existing methods. Complexity is about performance measures, NOT about the intricacy of programs. The choice of which operations are time critical and what constitutes a space cell varies according to application, as we shall see. Complexity study plays a vital role at the time of choosing an algorithm to solve a given problem.
In all application domains of multimedia, communication and network processing where huge amount of data processing at desired performance and power consumption are a mandatory prerequisite for successful functioning; the system architects have to find a design that fulfills the user requirements of the optimization parameters, while minimizing the cost as much as possible. In this paper a novel FPGA based comparative analysis to compare the cost-performance ratio (CPR) of an Application Specific Processor (ASP) with Microblaze soft core RISC processor is proposed. The paper also proposes an exclusive performance assessment between the FPGA based ASP and Microblaze soft core RISC processor embedded in FPGA. The paper also highlights the design processes of a performance optimized power stringent ASP by converting a computation intensive application into an actual Register Transfer Level (RTL) hardware design as well as the Microblaze soft core RISC processor for a same given application. The experimental results of the FPGA based speedup analysis indicated that for 'N' sets of processed data, the application specific processor performs faster than RISC. Further, it was concluded that speedup of ASP increases proportionally with increase in number of processed data. Moreover, the results of CPR comparison indicated that as the number of units of production increases, the value of CPR for the ASP becomes larger compared to CPR of RISC processor.
The last decade has witnessed a tremendous increase in the popularity of mobile ad hoc networks (MANETs). The major computing challenges of distributed environment become more insidious when we try to address them in mobile ad hoc scenario. The distributed mutual exclusion (DMX) is one of the heavily researched topics of distributed computing. Although, a flurry of DMX protocols exists for static as well as cellular mobile distributed systems, the DMX in MANETs is comparatively less explored area of research. In 2004, Benchaiba et al. [7] presented a survey of the topic. Since then a considerable number of protocols have been published. The article presents an overview of the major contributions related to distributed mutual exclusion in MANETs, precisely after publication of the paper [7] in 2004.
Researchers investigated Artificial Intelligence (AI) based classifiers for intrusion detection to cope the weaknesses of knowledge based systems. AI based classifiers can be utilized in supervised and unsupervised mode. Here, we perform a blind set of experiments to compare & evaluate performance of the supervised classifiers by their categories using variety of metrics. The performance of the classifiers is analyzed using subset of benchmarked KDD cup 1999 dataset as training & Test dataset. This work has significant aspect of using variety of performance metrics to evaluate the supervised classifiers because some classifiers are designed to optimize some specific metric. This empirical analysis is not only a comparison of various classifiers to identify best classifier on the whole and best classifiers for individual attack classes, but also reveals guidelines for researchers to apply AI based classifiers to field of intrusion detection and directions for further research in this field.
