Sciweavers

50 search results - page 3 / 10
» Two M M 1 Queues with Transfers of Customers
Sort
View
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
13 years 4 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt
SPAA
2004
ACM
13 years 11 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
INFOCOM
1997
IEEE
13 years 10 months ago
Analysis of Queueing Displacement Using Switch Port Speedup
Current high-speed packet switching systems, ATM in particular, have large port bu ering requirements. The use of highly integrated ASIC technology for implementing high-degree an...
Israel Cidon, Asad Khamisy, Moshe Sidi
HICSS
2003
IEEE
131views Biometrics» more  HICSS 2003»
13 years 11 months ago
Requirements Elicitation and Elicitation Technique Selection: A Model for Two Knowledge-Intensive Software Development Processes
By its very nature, software development consists of many knowledge-intensive processes. One of the most difficult to model, however, is requirements elicitation. This paper prese...
Ann M. Hickey, Alan M. Davis
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 6 months ago
Heavy-Tailed Limits for Medium Size Jobs and Comparison Scheduling
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan