Sciweavers

51 search results - page 3 / 11
» Parallel Algorithms for Priority Queue Operations
Sort
View
HPDC
1995
IEEE
13 years 9 months ago
A Versatile Packet Multiplexer for Quality-of-Service Networks
A novel packet multiplexing technique, called Rotating-Priority-Queues (RPQ), is presented which exploits the tradeoff between high eficiency, i.e., the ability to support many co...
Jörg Liebeherr, Dallas E. Wrege
SIGMETRICS
2002
ACM
130views Hardware» more  SIGMETRICS 2002»
13 years 5 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
IPPS
1997
IEEE
13 years 9 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...
IRI
2008
IEEE
13 years 12 months ago
AMSQM: Adaptive multiple super-page queue management
Super-Pages have been wandering around for more than a decade. There are some particular operating systems that support Super-Paging and there are some recent research papers that...
Moshe Itshak, Yair Wiseman
ICPP
2009
IEEE
13 years 3 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...