Sciweavers

3098 search results - page 306 / 620
» On distributed smooth scheduling
Sort
View
QUESTA
2010
107views more  QUESTA 2010»
15 years 5 months ago
On the inapproximability of M/G/K: why two moments of job size distribution are not enough
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
Varun Gupta, Mor Harchol-Balter, J. G. Dai, Bert Z...
CCGRID
2011
IEEE
14 years 10 months ago
Towards Real-Time, Volunteer Distributed Computing
Many large-scale distributed computing applications demand real-time responses by soft deadlines. To enable such real-time task distribution and execution on the volunteer resourc...
Sangho Yi, Emmanuel Jeannot, Derrick Kondo, David ...
QEST
2009
IEEE
16 years 1 months ago
On the Impact of Modelling Choices for Distributed Information Spread
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Rena Bakhshi, Ansgar Fehnker
SRDS
2006
IEEE
16 years 22 days ago
Consistent Replication of Multithreaded Distributed Objects
Determinism is mandatory for replicating distributed objects with strict consistency guarantees. Multithreaded execution of method invocations is a source of nondeterminism, but h...
Hans P. Reiser, Jörg Domaschka, Franz J. Hauc...
184
Voted
ASPLOS
2004
ACM
16 years 5 days ago
D-SPTF: decentralized request distribution in brick-based storage systems
Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers. D-SPTF exploits high-speed interconnects to d...
Christopher R. Lumb, Richard A. Golding