Sciweavers

437 search results - page 75 / 88
» Quincy: fair scheduling for distributed computing clusters
Sort
View
CLUSTER
2006
IEEE
15 years 6 months ago
Positioning Dynamic Storage Caches for Transient Data
Simulations, experiments and observatories are generating a deluge of scientific data. Even more staggering is the ever growing application demand to process and assimilate these...
Sudharshan S. Vazhkudai, Douglas Thain, Xiaosong M...
ICDCS
2010
IEEE
15 years 1 months ago
CacheCast: Eliminating Redundant Link Traffic for Single Source Multiple Destination Transfers
Due to the lack of multicast services in the Internet, applications based on single source multiple destinations transfers such as video conferencing, IP radio, IPTV must use unica...
Piotr Srebrny, Thomas Plagemann, Vera Goebel, Andr...
CCGRID
2003
IEEE
15 years 5 months ago
Multi-class Applications for Parallel Usage of a Guaranteed Rate and a Scavenger Service
— Grid computing requires network services beyond what is currently provided by the Best-Effort Internet. Among the different approaches towards network Quality of Service, aggre...
Markus Fidler, Volker Sander
HPCS
2007
IEEE
15 years 6 months ago
Improved Grid Metascheduler Design using the Plackett-Burman Methodology
In the context of computational grids, a metascheduler is the service responsible for scheduling jobs across many geographically distributed processor clusters. Typically, these s...
Daniel C. Vanderster, Nikitas J. Dimopoulos, Randa...
SPAA
2009
ACM
16 years 11 days ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch