VHDL is a programming language used for describing the behaviour and structure of large hardware systems. Due to the prohibitive cost of silicon fabrication, any code written in VHDL needs to be extensively simulated ...
详细信息
VHDL is a programming language used for describing the behaviour and structure of large hardware systems. Due to the prohibitive cost of silicon fabrication, any code written in VHDL needs to be extensively simulated before synthesis. However, the simulation time can be extremely long because of the complexity of these designs. parallel simulation can be used to speed up simulation run time (Meister, 1996)., and is particularly effective when simulations are demanding in terms of processing time. A new Time Warp distributed VHDL simulator has been developed using Jini, a Java and RMI-based API created for the development of distributed applications.
A parallel version of the evolutionary graph generation (EGG) system, called the distributed EGG (DEGG) system, was developed on a cluster of PCs using a message-passing interface (MPI). To demonstrate the capability ...
详细信息
A parallel version of the evolutionary graph generation (EGG) system, called the distributed EGG (DEGG) system, was developed on a cluster of PCs using a message-passing interface (MPI). To demonstrate the capability of DEGG, it is applied to seeking the optimal design of various multipliers. Experimental results substantially show that DEGG consistently performs better than the EGG and known conventional designs.
In some scenarios involving on-line transaction processing within a distributed database, it is desirable to synchronize transactions in a manner that guarantees conflict equivalence with a serial schedule ordered by ...
详细信息
ISBN:
(纸本)076950728X
In some scenarios involving on-line transaction processing within a distributed database, it is desirable to synchronize transactions in a manner that guarantees conflict equivalence with a serial schedule ordered by original transaction start times while providing each transaction with an anomaly serializable isolation. Few theoretical concurrency control algorithms guarantee such a conflict equivalence, and we are unaware of any protocol that accomplishes this while supporting real-world issues such as out-of-order transaction messages, out-of-order operation executions, and out-of-order transaction committals without the burden of explicit readset and writeset declarations We describe an algorithm that provides this guarantee mid supports these issues while requiring only table-level writeset declarations.
A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. the sequential and parallel simulated annealing algorithms to solve the delivery problem are discussed. the objective is to...
详细信息
the paper describes a randomized distributed enumeration algorithm which (in contrast to deterministic solutions) works for all network topologies and with fully asynchronous communication. the algorithm correctness a...
详细信息
Testing distributed applications over the Internet is fraught with problems: due to the inability to control a wide area network consistent, reproduceable performance experiments are not possible. Here a system is des...
详细信息
ISBN:
(纸本)076950728X
Testing distributed applications over the Internet is fraught with problems: due to the inability to control a wide area network consistent, reproduceable performance experiments are not possible. Here a system is described that uses a parallel discrete evens simulator that can act as a real-time network emulator Real Internet Protocol (IP) traffic generated by application programs running on user workstations carl interact with modelled traffic in the emulator thus providing a controlled test environment for distributed applications, parallel execution enables the emulator to simulate lar ge virtual networks and to model traffic interactions that could nor be done in real-time sequentially: this paper gives an overview of the emulator and explores the various external data routing methods that the emulator supports. these routing methods allow the emulator to be operated in shared environments with certain constraints, as well as in dedicated test environments. Preliminary performance results are included.
In this work we propose a fault-tolerant mechanism for parallel programs based on task replication. We use a sequential discrete-event simulator of a distributed system subject to failures to compare a semi-active app...
详细信息
ISBN:
(纸本)076950728X
In this work we propose a fault-tolerant mechanism for parallel programs based on task replication. We use a sequential discrete-event simulator of a distributed system subject to failures to compare a semi-active approach and a passive approach of the protocol. In our model, each time a task of a given parallel program is allocated, a copy of it is stored in a second processor, called the buddy processor. If the original processor fails, the copies of the tasks at the buddy processor will be processed, providing fault tolerance. Some performance measures, such as program execution times and processor utilization factors, are given for the different versions of the mechanism. the performance has been studied as a function of processor degradation, and program and system sizes.
this paper presents an efficient distributed dynamic channel allocation algorithm for mobile communications systems. the algorithm is based upon the mutual exclusion model, where the channels are grouped by the number...
详细信息
ISBN:
(纸本)076950728X
this paper presents an efficient distributed dynamic channel allocation algorithm for mobile communications systems. the algorithm is based upon the mutual exclusion model, where the channels are grouped by the number of cells in a cluster and each group of channels can not be shared concurrently within the cluster. We discuss the algorithm and prove its correctness. We also show that the algorithm requires at most (worst case) O(N-g * N(n)logN(n)) messages, where N-g is the number of groups and N-n is the number of neighbors. this is compared to Choy's algorithm which requires O(N-g(2) * N-n), where N-g is the number of groups. Our simulations experiments indicate that DDRA algorithm outperforms previous schemes. A 5% reduction in the denial rate, and a 10-30% reduction in the acquisition time channel were obtained using our algorithm when compared to previous algorithm.
In this paper, bye present a new powerful method for parallel program representation called Data Driven Graph (DDG). DDG takes all advantages of classical Directed Acyclic graph (DAC) and adds much more. Simple defini...
详细信息
In this paper we study one kind of irregular computation on distributed arrays, the irregular prefix operation, that is currently not well taken into account by the standard data-parallel language HPF2. We show a para...
详细信息
暂无评论