Sciweavers

734 search results - page 87 / 147
» Multiprocess Time Queue
Sort
View
SIGECOM
2005
ACM
109views ECommerce» more  SIGECOM 2005»
14 years 4 months ago
Cost sharing in a job scheduling problem using the Shapley value
A set of jobs need to be served by a single server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The j...
Debasis Mishra, Bharath Rangarajan
HPCA
2004
IEEE
14 years 11 months ago
Out-of-Order Commit Processors
Modern out-of-order processors tolerate long latency memory operations by supporting a large number of inflight instructions. This is particularly useful in numerical applications...
Adrián Cristal, Daniel Ortega, Josep Llosa,...
MICRO
2003
IEEE
161views Hardware» more  MICRO 2003»
14 years 4 months ago
Design and Implementation of High-Performance Memory Systems for Future Packet Buffers
In this paper we address the design of a future high-speed router that supports line rates as high as OC-3072 (160 Gb/s), around one hundred ports and several service classes. Bui...
Jorge García-Vidal, Jesús Corbal, Ll...
CONCUR
2000
Springer
14 years 2 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
ETT
2002
89views Education» more  ETT 2002»
13 years 11 months ago
Delay analysis of a probabilistic priority discipline
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko