Miltos D. Grammatikakis, Stefan Liesche  Home/Search
Context
Related
| parsys.informatik.uniol...pq_new.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: parsys.informatik.uni...ParAlg_E (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We examine the design, implementation, and experimental analysis of parallel priority queues for device and network simulation. We consider: a) distributed splay trees using MPI, b) concurrent heaps using shared memory atomic locks, and c) a new, more general concurrent data structure based on distributed sorted lists, which is designed to provide dynamically balanced work allocation (with automatic or manual control) and efficient use of shared memory resources. We evaluate performance... (Update)
Similar documents based on text: More All
2.4: Parallel Priority Queues on Cray-T3E - Grammatikakis, Liesche (Correct)
0.4: Synchronization on Cray-T3E Virtual Shared Memory - Grammatikakis, Dollani, Liesche (1998) (Correct)
0.2: Concurrent Heaps on the BSP Model - Gerbessiotis, Siniolakis (1996) (Correct)
BibTeX entry: (Update)
@article{ grammatikakis00priority,
author = "Miltos D. Grammatikakis and Stefan Liesche",
title = "Priority Queues and Sorting Methods for Parallel Simulation",
journal = "Software Engineering",
volume = "26",
number = "5",
pages = "401-422",
year = "2000",
url = "citeseer.ist.psu.edu/grammatikakis00priority.html" }
Citations (may not include all citations):192 Self-adjusting binary search trees (context) - Sleator, Tarjan - 1986
157 The Art of Computer Programming: Sorting and Searching (context) - Knuth - 1973
140 Eraser: A dynamic data race detector for multi-threaded prog.. - Savage, Burrows et al. - 1997
74 Transactional memory: Architectural support for lockfree dat.. - Herlihy, Moss - 1993
50 line algorithms for path selection in a nonblocking network - Arora, Leighton et al. - 1996
48 Concurrent access of priority queues - Rao, Kumar - 1988
48 Algorithms for scalable synchronization on shared memory mul.. (context) - Mellor-Crummey, Scott - 1991
43 Counting networks - Aspnes, Herlihy et al. - 1994
42 Algorithm 232: Heapsort (context) - Williams - 1964
38 Concurrent operations on priority queues (context) - Jones - 1989
32 MPI Forum (context) - Extensions, message-passing - 1997
26 Parallel algorithms for personalized communication and sorti.. - Helman, Bader et al. - 1996
21 Architectural choices in large scale ATM switches - Turner, Yamanaka - 1998
18 A parallel priority queue with constant time operations - Brodal, Traff et al. - 1998
17 Distributed data structures: a complexity-oriented view (context) - Peleg - 1991
[Article contains additional citations not shown here]
Documents on the same site (http://parsys.informatik.uni-oldenburg.de/~mdgramma/ParAlg_E.html): More
Network Simulation on the CM-5 by Sorting Integer.. - Grammatikakis.. (1997) (Correct)
Network Simulation on Cray-T3E using MPI - Grammatikakis, Fideropoulos.. (1997) (Correct)
Synchronization on Cray-T3E Virtual Shared Memory - Miltos Grammatikakis (1998) (Correct)
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