Sciweavers

506 search results - page 10 / 102
» Distributing synchronous programs using bounded queues
Sort
View
HIPC
2007
Springer
15 years 3 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
IOR
2007
82views more  IOR 2007»
14 years 11 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
GLOBECOM
2007
IEEE
15 years 6 months ago
Synchronization-Aware Distributed Space-Time Codes in Wireless Relay Networks
— In this paper, we consider the design of synchronization-aware distributed space-time codes, which we denote as diagonal distributed space-time codes (DDSTC), for N relay nodes...
Karim G. Seddik, Ahmed K. Sadek, Ahmed S. Ibrahim,...
PPOPP
2006
ACM
15 years 5 months ago
Predicting bounds on queuing delay for batch-scheduled parallel machines
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
John Brevik, Daniel Nurmi, Richard Wolski
IFIP
1997
Springer
15 years 3 months ago
Waiting time distributions in a two-queue model with mixed exhaustive and gated-type K-limited services
We deal with a two-queue model with mixed exhaustive and gated-type K-limited services. This model can achieve various degrees of priority in each queue by varying the value of K....
Toshihisa Ozawa