Sciweavers

16128 search results - page 302 / 3226
» Distributed network scheduling
Sort
View
IPPS
2003
IEEE
15 years 9 months ago
The Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
Anand Srinivasan, Philip Holman, James H. Anderson...
FGCS
2006
76views more  FGCS 2006»
15 years 4 months ago
G-lambda: Coordination of a Grid scheduler and lambda path service over GMPLS
At iGrid2005, we conducted a live demonstration where our Grid scheduling system co-allocated computing and network resources with advance reservation through Web services interfa...
Atsuko Takefusa, Michiaki Hayashi, Naohide Nagatsu...
160
Voted
ALGORITHMICA
2005
102views more  ALGORITHMICA 2005»
15 years 4 months ago
Effective Routing and Scheduling in Adversarial Queueing Networks
In an adversarial queueing network, the incoming traffic is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementar...
Jay Sethuraman, Chung-Piaw Teo
CLUSTER
2009
IEEE
15 years 10 months ago
Reducing network contention with mixed workloads on modern multicore, clusters
Abstract—Multi-core systems are now extremely common in modern clusters. In the past commodity systems may have had up to two or four CPUs per compute node. In modern clusters, t...
Matthew J. Koop, Miao Luo, Dhabaleswar K. Panda
BROADNETS
2005
IEEE
15 years 9 months ago
A Lightweight framework for source-to-sink data transfer in wireless sensor networks
— Lightweight protocols that are both bandwidth and power thrifty are desirable for sensor networks. In addition, for many sensor network applications, timeliness of data deliver...
James Jobin, Zhenqiang Ye, Honomount Rawat, Srikan...