Sciweavers

223 search results - page 25 / 45
» Improving First-Come-First-Serve Job Scheduling by Gang Sche...
Sort
View
ICDCS
2000
IEEE
14 years 5 hour ago
Improving Distributed Workload Performance by Sharing both CPU and Memory Resources
We develop and examine job migration policies by considering effective usage of global memory in addition to CPU load sharing in distributed systems. When a node is identified fo...
Xiaodong Zhang, Yanxia Qu, Li Xiao
DSN
2008
IEEE
14 years 2 months ago
Scheduling for performance and availability in systems with temporal dependent workloads
Temporal locality in workloads creates conditions in which a server, in order to remain available, should quickly process bursts of requests with large service requirements. In th...
Ningfang Mi, Giuliano Casale, Evgenia Smirni
CAMAD
2006
IEEE
13 years 11 months ago
Improving quality of service for switched processing systems
Switched Processing Systems (SPS) capture the essence of a fundamental resource allocation problem in many modern communication, computer and manufacturing systems involving hetero...
Ying-Chao Hung, George Michailidis
SOSP
2009
ACM
14 years 4 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
GPC
2007
Springer
14 years 1 months ago
Towards Feasible and Effective Load Sharing in a Heterogeneous Computational Grid
A grid has to provide strong incentive for participating sites to join and stay in it. Participating sites are concerned with the performance improvement brought by the gird for th...
Kuo-Chan Huang, Po-Chi Shih, Yeh-Ching Chung