In this paper, we present the first theoretical study of the parallelism inherent in the Rijndael Advanced Encryption Standard (AES). We derive the asymptotic sequential runtime for the algorithm and describe two para...
详细信息
ISBN:
(纸本)088986392X
In this paper, we present the first theoretical study of the parallelism inherent in the Rijndael Advanced Encryption Standard (AES). We derive the asymptotic sequential runtime for the algorithm and describe two parallel implementations: one that is optimal in terms of time, and another that is optimal in terms of cost (the asymptotic product of time and number of processors required). The cost-optimal implementation sacrifices acceleration to reduce the number of processors required for encryption.
In this paper three different Service Discovery approaches based on centralized and distributed registries within so called Virtual Organizations are assessed. The first approach is a centralized model, the second a c...
详细信息
ISBN:
(纸本)088986392X
In this paper three different Service Discovery approaches based on centralized and distributed registries within so called Virtual Organizations are assessed. The first approach is a centralized model, the second a completely decentralized and the third is a hybrid of both models. The Grid environment is typically comprised of heterogeneous resources over wide-area networks, It addresses all distributedcomputing issues, especially the problem of service discovery. The benefits and drawbacks of all three models are discussed and a comparison regarding issues such as administration, management, scalability and security is followed. Furthermore, measurements are executed in order to investigate the performance of all three models, and a reliability analysis is conducted.
In this paper, we propose a distributed prioritized h-out of-k mutual exclusion algorithm for a mobile ad hoc network (MANET) with real-time or prioritized applications. The h-out of-k mutual exclusion problem is a ge...
详细信息
ISBN:
(纸本)088986392X
In this paper, we propose a distributed prioritized h-out of-k mutual exclusion algorithm for a mobile ad hoc network (MANET) with real-time or prioritized applications. The h-out of-k mutual exclusion problem is a generalization of the k-mutual exclusion problem and the mutual exclusion problem. The proposed algorithm is sensitive to link forming and link breaking and thus is suitable for a MANET. It is worthwhile to mention that the proposed algorithm can also be applied to distributedsystems consisting of stationary nodes that communicate with each other by exchanging messages over wired links.
This paper presents a new parallel algorithm in Molecular Dynamics simulation - HA (Hierarchical Algorithm). HA algorithm has two levels. Spatial decomposition strategy is used in the outer level to reduce the communi...
详细信息
ISBN:
(纸本)088986392X
This paper presents a new parallel algorithm in Molecular Dynamics simulation - HA (Hierarchical Algorithm). HA algorithm has two levels. Spatial decomposition strategy is used in the outer level to reduce the communication cost and improve the scalability;force decomposition strategy is used in the inner level to give a better load balance performance. When used to simulate a large nucleation system with non-uniform density, HA performs better than pure SD and FD algorithms.
RHiNET is a network for high speed parallel processing environment by connecting PCs distributed on one or more floors or a building. In such a network, the computing power and the load of PCs front-end job is differe...
详细信息
ISBN:
(纸本)088986392X
RHiNET is a network for high speed parallel processing environment by connecting PCs distributed on one or more floors or a building. In such a network, the computing power and the load of PCs front-end job is different each other, thus, it is a heterogeneous environment, in which parallel execution time is dominant by the PC with the least performance. In order to keep performance, dynamic load balancing algorithms are proposed and implemented in a prototype RHiNET-2 with 64 nodes. As preliminary evaluations, several load balancing algorithms are implemented for a simple parallel application and evaluated on the prototype. From results of the evaluation, a parallel process with dynamic load balancing achieves 20% performance improvement compared to that without load balancing, when the front end job is set on certain nodes.
Firewalls, and packet classification in general, are becoming more and more significant as data rates soar and hackers become increasingly sophisticated - and more forceful. In this paper, we present a new packet-clas...
详细信息
ISBN:
(纸本)088986392X
Firewalls, and packet classification in general, are becoming more and more significant as data rates soar and hackers become increasingly sophisticated - and more forceful. In this paper, we present a new packet-classification approach that uses set theory to classify packets. This approach has significant theoretical advantages over current approaches. We demonstrate its practicality by implementing a firewall subsystem in Linux which approaches the performance of today's naive packet-filtering implementations.
The aim of this paper is to present the first results and learnings at the time of testing the SPIN prototype. SPIN is an interactive and integrated toolkit for scientific computation. The main goal of SPIN is to allo...
详细信息
ISBN:
(纸本)088986392X
The aim of this paper is to present the first results and learnings at the time of testing the SPIN prototype. SPIN is an interactive and integrated toolkit for scientific computation. The main goal of SPIN is to allow the access to remote computational and storage resources in an easy to use and transparent way from the user's point of view. This toolkit, based on a multi-tier architecture, has been developed following a state of the art software engineering process, incorporating the CORBA standard (Common Object Request Broker Architecture), the PAC-Amodeus model (a multi-agent based model for interactive systems architecture) and the Unified Process (UP) to guide the whole life-cycle of the project.
Efficient communication in distributedsystems is essential for optimal system performance. As parallel computation develops, many different kinds of messages need to be sent between machines. These messages may have ...
详细信息
ISBN:
(纸本)088986392X
Efficient communication in distributedsystems is essential for optimal system performance. As parallel computation develops, many different kinds of messages need to be sent between machines. These messages may have different requirements for network latency and bandwidth. In this paper, we revisit combining two physical interfaces into one virtual network (channel bonding). In contrast with most existing implementations, we communicate via heterogenous interfaces, and explore a number of more sophisticated scheduling algorithms than the round-robin technique used in the standard Beowulf channel-bonding driver. We explore the relative tradeoffs of interface scheduling overhead versus the additional bandwidth possible with multiple interfaces. Using both Gigabit Ethernet and Fast Ethernet Networks, we evaluate system performance using netPerf. We show significant performance gains for small messages, with incremental improvements for larger packets.
Starting from a cognitive point of view, a modular neural network has been previously designed for modelling a multimodal associative memory simulating multisensory integration. This article presents a distributed imp...
详细信息
ISBN:
(纸本)088986392X
Starting from a cognitive point of view, a modular neural network has been previously designed for modelling a multimodal associative memory simulating multisensory integration. This article presents a distributed implementation of the model, running on a network of computers. The purpose of the parallel implementation is to exploit the asynchrony of message passing to simulate temporal aspects in the model. Experiments in a virtual robotic environment highlight the interest of the model for a brain-like integration of multimodal informations, even in confusing context.
A workflow system is a set of computer-supported activities organized as a single system under various flow patterns. The time management of a workflow system concerns the modelling of schedules of individual activiti...
详细信息
ISBN:
(纸本)088986392X
A workflow system is a set of computer-supported activities organized as a single system under various flow patterns. The time management of a workflow system concerns the modelling of schedules of individual activities and the testing of compatibility among the schedules of different activities in centralized or distributed environment. In this work, based on Windows-Explorer-like workflow process model, we propose a more flexible schedule format named schedule frame, and develop a new concept of time-compatibility which compromises the two extreme aspects of prevailing ones and is defined in terms of feasible conditions. In the execution level, the algorithm for maintaining time-compatibility is presented.
暂无评论