Sciweavers

130 search results - page 4 / 26
» A Parallel Priority Queue with Constant Time Operations
Sort
View
SIGMETRICS
2002
ACM
130views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Multiple-queue backfilling scheduling with priorities and reservations for parallel systems
We describe a new, non-FCFS policy to schedule parallel jobs on systems that may be part of a computational grid. Our algorithm continuously monitors the system (i.e., the intensi...
Barry G. Lawson, Evgenia Smirni
ISORC
2000
IEEE
13 years 11 months ago
A Distributed Real-Time Java System Based on CSP
CSP is a fundamental concept for developing software for distributed real-time systems. The CSP paradigm constitutes a natural addition to Object Orientation and offers higherorde...
Gerald H. Hilderink, Andry W. P. Bakkers, Jan F. B...
SPDP
1991
IEEE
13 years 11 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari
IPPS
1997
IEEE
13 years 11 months ago
A Parallel Priority Data Structure with Applications
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
Gerth Stølting Brodal, Jesper Larsson Tr&au...
CLUSTER
2008
IEEE
14 years 1 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman