Cryptosystem based on Lucas Function is known as LUC Cryptosystems. Lucas Function is a special form of second order linear recurrence relation using a large public integer as a modulus. We are sure that, an existing ...
详细信息
ISBN:
(纸本)9780889867307
Cryptosystem based on Lucas Function is known as LUC Cryptosystems. Lucas Function is a special form of second order linear recurrence relation using a large public integer as a modulus. We are sure that, an existing computation technique will suffer a huge computations time and spaces when calculating a very large size of public-key and private-key. Recently, a method for fast LUC Cryptosystems computation on single processor has been proposed. In this paper, we extend the method in parallel on distributed memory multiprocessor machine using message-passing interface. We are generating a special sequence from a given value of public-key and private-key. this special sequence will be used to direct the computation of LUC. We examine the parallelism efficiency of the algorithm by analyze the simulation time and speedup.
this paper presents a new efficient data-exchange process in parallel sorting, which improves both communication time and memory space. In this communication-space efficient strategy, we proposed two new parallel sort...
详细信息
ISBN:
(纸本)9780889867307
this paper presents a new efficient data-exchange process in parallel sorting, which improves both communication time and memory space. In this communication-space efficient strategy, we proposed two new parallel sorting algorithms: 1) CSEBS (Communication-Space Efficient Bitonic Sort) algorithm and 2) CSEOE (Communication-Space Efficient Odd-Even MergeSort) algorithm. In addition, to evaluate the performance, we have implemented the CSEBS and the CSEOE algorithms on the SGI Origin2000. Investigated experimental results have been compared to those of the best of existing algorithm (CEBS: Communication Efficient Bitonic Sort). In the experiments, the proposed CSEBS algorithm yielded the improved results over those of the best of existing algorithm (CEBS) at least 11% on the system of size P = 4 and at least 31% on the system of size P = 8. Moreover our approach can save memory space up to 50%.
GPGPU methods, which are naturally scalable and natively targeted on the parallel graphics pipeline architecture well-suit for distributed computations. In this paper, the key-points of GPU-oriented distributed proces...
详细信息
GPGPU methods, which are naturally scalable and natively targeted on the parallel graphics pipeline architecture well-suit for distributed computations. In this paper, the key-points of GPU-oriented distributed processing for the random search tasks is discussed.
Regression testing is essential in ensuring continuous improvement of the quality and confidence of every subsequent release of software-products (or long-running projects). However, the (time and man-power) cost of u...
详细信息
ISBN:
(纸本)9780889867307
Regression testing is essential in ensuring continuous improvement of the quality and confidence of every subsequent release of software-products (or long-running projects). However, the (time and man-power) cost of using the entire regression test suite for minor modifications or bug-fixes is often prohibitively high, whereas, the risk associated with releasing a regressed (new) version of the product is not acceptable, either. In this paper we present a technique to identify a small safe subset regression-test-suite for object-oriented managedcode that selects the set of all relevant tests, given the previous and the current versions of the implementation binaries. We have developed ChiARTS, a prototype implementation of our technique for the C# Language, and also overseen its smooth introduction into the test process for a large (internal) software product-line under Philips Medical systems. the design of ChiARTS caters to the needs of our industry-strength test-harness for multi-threaded tests.
Managing continuously changing requirements is adifficult and time consuming task in large projects. Change management if not done properly often leads toproject failure. Requirement Change Management (RCM) process mo...
详细信息
ISBN:
(纸本)9780889867307
Managing continuously changing requirements is adifficult and time consuming task in large projects. Change management if not done properly often leads toproject failure. Requirement Change Management (RCM) process models are surveyed and evaluated on the criteria of roles, activities, artifacts and representation which are fundamental and necessary for a good process model. this evaluation is extended to update the work already done in literature. the deficiencies present in current RCM literature are highlighted. the ontology for process model has already been proposed elsewhere. Using that ontology we propose an RCM process model in this paper. this RCM process model improves upon the deficiencies identified, and it also introduces some new concepts. the process is modeled using UML activity diagram. the purpose of the process model is to provide a more complete and detailed guideline than already present. It will help the practitioners to effectively manage requirement change in large projects.
As ad hoc networks are continuously growing in size, we are facing the prospect of emerging wireless networks with millions of nodes. Geographic routing algorithms are a better alternative to traditional ad hoc routin...
详细信息
ISBN:
(纸本)9780889867307
As ad hoc networks are continuously growing in size, we are facing the prospect of emerging wireless networks with millions of nodes. Geographic routing algorithms are a better alternative to traditional ad hoc routing algorithms in this new domain for point-to-point routing. But deployments of such algorithms are currently very uncommon because of some practical difficulties. this paper explores techniques that address two major issues in the deployment of geographic routing algorithms: (i) the costs associated withdistributed planarization and (ii) the non availability of location information of a node. We present and evaluate a new algorithm for geographic routing: Greedy distributed Tree Routing (GDTR).the previous geographic routing algorithms require the planarization of the network connectivity graph where as GDTR switches to routing on a spanning tree instead of a planar graph when packets end up at dead ends during greedy forwarding. To opt a direction on the tree that is most likely to make progress towards the destination, each GDTR node maintains a summary of the area covered by the subtree below each of its tree neighbors using convex hulls. this distributed data structure is called a hull tree. GDTR not only requires an order of magnitude less resource to maintain these hull trees than the Cross- Link Detection Protocol CLDP, the only distributed planarization algorithm that is known to work with practical radio networks, it often achieves better routing performance than previous planarization-based geographic routing algorithms.
this paper presents improvements of the parallel-FIMI method for statical load balancing of mining of all frequent itemsets on a distributed-memory (DM) parallel machine. this method probabilistically partitions the s...
详细信息
ISBN:
(纸本)9780889867048
this paper presents improvements of the parallel-FIMI method for statical load balancing of mining of all frequent itemsets on a distributed-memory (DM) parallel machine. this method probabilistically partitions the space of all frequent itemsets into partitions of approximately the same size. the improvements consist in paralelization of the approximate partitioning of the search space and of dynamic reordering of items during construction of prefix-based equivalence classes. the new versions of the method achieve nearly linear speedups up to 10 processors.
In many distributed applications, identifying the sequence of event occurrence is useful. Doing so requires local clocks to be properly synchronized with each other. this paper presents a method of pseudo-synchronizat...
详细信息
ISBN:
(纸本)9780889867048
In many distributed applications, identifying the sequence of event occurrence is useful. Doing so requires local clocks to be properly synchronized with each other. this paper presents a method of pseudo-synchronization of clocks by making use of the occurrence time of events included in direct "happened-before" relations. the basic idea is to approximate the actual clock shift between two clocks using the minimum transmission delay of messages between a pair of hosts. Evaluation results suggest that non-base clocks are closely synchronized with a base clock without violating the direct "happened-before" relations.
In this paper parallel approach to the algorithm of discrete exact state estimation is presented. the novel idea of double-layer parallel decomposition of such computational algorithm is explained and results of its f...
详细信息
ISBN:
(纸本)9780889867048
In this paper parallel approach to the algorithm of discrete exact state estimation is presented. the novel idea of double-layer parallel decomposition of such computational algorithm is explained and results of its full implementation are showed. Numerical tests of the computational algorithm with discrete exact state estimator in the context of its scalability are included. All of presented results were obtained by the use of MPI library in the Linux cluster.
the severe energy constraints of wireless sensor networks (WSNs) require energy-efficient communication protocols in order to fulfill the objectives of the application. Cross-layer design is a technique which can pote...
详细信息
ISBN:
(纸本)9780889867048
the severe energy constraints of wireless sensor networks (WSNs) require energy-efficient communication protocols in order to fulfill the objectives of the application. Cross-layer design is a technique which can potentially be used to improve the overall performance of WSNs by way of jointly optimizing and exploiting the interactions between various layers of the network protocol stack. In this paper, we propose a cross-layer framework design for the Embedded Middleware in Mobility Applications (EMMA) project. this optimization agent based framework design provides efficient data exchange between the various protocols layers via a state repository to improve the performance of WSN applications in terms of memory consumption and processing overhead.
暂无评论