Sciweavers

1316 search results - page 36 / 264
» A New Scheduling Algorithm for Servers
Sort
View
70
Voted
FTCS
1998
83views more  FTCS 1998»
14 years 11 months ago
The SunSCALR Framework for Internet Servers
Internet servers need to be highly-available, inexpensive, and scalable. These goals are often con icting and most designs meet, with limited success, only few of them. In this pa...
Ashish Singhai, Swee Boon Lim, Sanjay R. Radia
ICPP
2005
IEEE
15 years 3 months ago
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
Sang Cheol Kim, Sunggu Lee
AAAI
2007
15 years 12 hour ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
JCST
2000
89views more  JCST 2000»
14 years 9 months ago
LinuxDirector: A Connection Director for Scalable Internet Services
LinuxDirector is a connection director that supports load balancing among multiple Internet servers, which can be used to build scalable Internet services based on clusters of ser...
Zhang Wensong, Shiyao Jin, Quanyuan Wu
TON
2002
109views more  TON 2002»
14 years 9 months ago
Coordinated multihop scheduling: a framework for end-to-end services
In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly, when packets inc...
Chengzhi Li, Edward W. Knightly