Mans, B. Portable distributed priority queues with MPI. Concurrency: Practice and Experience, 1997, to appear. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Research Proposal Extension - Intens Interconnection Network (Correct)
....different times. The conflictfunction scheme has also been extended to accommodate multicasting. An alternative to sorting for network simulation is the use of priority queues, supporting parallel priority insert and deletemin operations [12] We have implemented distributed splay trees using MPI [18], and concurrent priority heaps using shared memory (ShMem) locks per data [20, 11] In addition, we have designed and implemented a new concurrent data structure called virtual shared memory priority queue (BCPQ) The first implementation uses MPI to implement a distributed priority queue data ....
Mans, B. Portable distributed priority queues with MPI. Concurrency: Practice and Experience, 1997, to appear.
Priority Queues and Sorting Methods for Parallel Simulation - Grammatikakis, Liesche (2000) (Correct)
....except the last, are completely filled. Several parallel priority queues, such as calendar queues, have been proposed and their parallel (PRAM) complexity has been theoretically examined [4, 5, 16, 27, 28] The experimental evaluation of parallel priority queues consists of both distributed [20], and also concurrent implementations [15, 26] All previous implementations have focused on different parallel systems, and thus information on the relative performance of parallel priority queues is very limited. In this study, we aim at resolving this issue, by developing and evaluating three ....
.... ffl simulating large communication networks, e.g. multibutterflies [1, 18, 19] The first implementation uses MPI to develop a distributed priority queue structure (DPQ) This data structure was introduced by Mans in 1996, and targeted point to point multicomputers that do not share memory [20]. A distributed data structure is allocated to different processing elements (PEs) and may be accessed by many processes simultaneously [25] A special root PE provides the global view of a heap, with each node consisting of a splay tree of items. Insertions and deletions invoke always the root ....
[Article contains additional citation context not shown here]
B. Mans. Portable distributed priority queues with MPI. Concurrency: Practice and Experience, 10 (3), pp. 175-198, 1998.
Implementing Parallel Algorithms based on Prototype.. - Hasselbring.. (1997) (1 citation) (Correct)
....problems [32] 7 Master Worker DPQ Server DPQ node DPQ node Figure 6: The coarse structure of the distributed priority queue in the low level C Linda and MPI implementations. Our parallel algorithm uses an n ary global heap consisting of local priority queues residing on each processor [26] The global heap property is kept across all local priority queues, i.e. in a minimumheap each node locally maintains a priority queue containing only elements that are smaller than the elements kept at the children nodes. Due to the use of an n ary heap and a simple load balancing scheme this ....
B. Mans. Portable distributed priority queues with MPI. In Proc. International Conference on High Performance Computing, pages 16--21. New Delhi, India, December 1995.
Network Simulation on Cray-T3E using MPI - Grammatikakis, Fideropoulos.. (1997) (2 citations) (Correct)
....only when a triggering event is executed. An event driven approach is not only faster than a time driven strategy, since less information needs to be communicated [9] but also easier to parallelize, since efficient portable code for concurrent priority queues starts becoming readily available [7]. Furthermore, in some cases, the performance can be increased using optimistic simulation [3] event priorities are relaxed and rollback mechanisms are introduced to undo the effects of causality errors. Serial computer simulation of large ATM switches and networks is considerably slow and ....
B. Mans, Portable distributed priority queues with MPI. Concurrency: Practice and Experience, 1997, to appear.
Parallel Priority Queues on Cray-T3E - Grammatikakis, Liesche (Correct)
....except the last, are completely filled. Several parallel priority queues, such as calendar queues, have been proposed and their parallel (PRAM) complexity has been theoretically examined [4, 5, 14, 23, 24] The experimental evaluation of parallel priority queues consists of both distributed [18], and also concurrent implementations [13, 22] All previous implementations have focused on different parallel systems, and thus information on the relative performance of parallel priority queues is very limited. In this study, we aim at resolving this issue, by developing and evaluating three ....
....priorities. ffl simulating large communication networks, e.g. multibutterflies. The first implementation uses MPI to develop a distributed priority queue structure (DPQ) This data structure was introduced by Mans in 1996, and targeted point to point multicomputers that do not share memory [18]. A distributed data structure is allocated to different processing elements (PEs) and may be accessed by many processes simultaneously [21] A special root PE provides the global view of a heap, with each node consisting of a splay tree of items. Insertions and deletions invoke always the root ....
[Article contains additional citation context not shown here]
Mans, B. Portable distributed priority queues with MPI. Concurrency: Practice and Experience, 1998, to appear.
Portable Distributed Priority Queues with MPI - Mans (1995) (6 citations) Self-citation (Mans) (Correct)
....Information Department of Computer Science James Cook University Townsville, Qld 4811 Australia Fax: 61 77 814029 bernard cs.jcu.edu.au http: www.cs.jcu.edu.au bernard Date December 1995 Copyright c fl 1996 Bernard Mans. All rights reserved. Abstract Part of this work has been presented in [17]. This paper analyzes the performances of portable distributed priority queues by examining the theoretical features required and by comparing various implementations. In spite of intrinsic bottlenecks and induced hot spots, we argue that tree topologies are attractive to manage the natural ....
B. Mans. Portable distributed priority queues with mpi. In S. Sahni, V. Prasanna, and V. Bhatkar, editors, Proc. of the IEEE International Conference on High Performance Computing, pages 16--21, New Delhi, India, 27-30 December 1995. Tata-Mcgraw Hill.
Clock Level Simulations Of An Atm Switch - Grammatikakis, Johl (1996) (Correct)
No context found.
Mans, B. 1995. "Portable Distributed Priority Queues with MPI". Proc. IEEE Intern. Conf. High Perf. Comput., pp. 16--21.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC