Sciweavers

192 search results - page 19 / 39
» On priority queues with priority jumps
Sort
View
SIGMETRICS
1999
ACM
15 years 1 months ago
Optimal Stochastic Scheduling in Multiclass Parallel Queues
In this paperweconsidertheproblemof schedulingdifferentclasses of customerson multiple distributed serversto minimize an objective function basedon per-classmeanresponsetimes.This...
Jay Sethuraman, Mark S. Squillante
ALGORITHMICA
2005
135views more  ALGORITHMICA 2005»
14 years 9 months ago
Queaps
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
John Iacono, Stefan Langerman
RTAS
2010
IEEE
14 years 8 months ago
Selecting Server Parameters for Predictable Runtime Monitoring
—Application of runtime monitoring to maintain the health of an embedded real-time software system requires that anomalous behavior be detected within a bounded time while preser...
Haitao Zhu, Steve Goddard, Matthew B. Dwyer
SPAA
2004
ACM
15 years 3 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
CLUSTER
2008
IEEE
15 years 4 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