MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Non-Clairvoyant Scheduling." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

28 documents found, showing 1 through 10. Next 10 →

ATOM

Non-Clairvoyant Scheduling
by Rajeev Motwani , Steven Phillips, Eric Torng — 1993
…Non-Clairvoyant Scheduling Rajeev Motwani y Steven Phillips y Eric Torng yz Department…
Cited by 66 (8 self) – Add To MetaCart

Non-Clairvoyant Scheduling for Mean Slowdown
by N. Bansal, K. Dhamdhere, J. Könemann, A. Sinha — 2001
…Non-Clairvoyant Scheduling for Mean Slowdown N. Bansal a K. Dhamdhere b J. Konemann c A. Sinha…
Cited by 2 (0 self) – Add To MetaCart

Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics
by Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng — 1997 — Journal of Scheduling
…Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics Jeff…
Cited by 18 (3 self) – Add To MetaCart

Non-clairvoyant batch set scheduling: Fairness is fair enough
by Julien Robert, Nicolas Schabanel — 2007 — In Proc. of 15th European Symposium on Algorithms (ESA), volume LNCS 4698
…Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough Julien Robert 1 and Nicolas…
Cited by 1 (0 self) – Add To MetaCart

TCP is Competitive against a Limited Adversary
by Jeff Edmonds, Suprakash Datta, Patrick Dymond — 2003 — SPAA, ACM Symp. of Parallelism in Algorithms and Achitectures
… scheduling algorithms imply that no online, distributed, non-clairvoyant algorithm can be competitive…
Cited by 8 (3 self) – Add To MetaCart

A Lower Bound for Dynamic Scheduling of Data Parallel Programs
by Fabricio Alves Barbosa da Silva, Fabricio Alves, Barbosa Silva, Luis Miguel Campos, Isaac D. Scherson — 1998
… dynamically changing workload conditions is a good non-clairvoyant scheduling technique when the parallel…
Cited by 6 (6 self) – Add To MetaCart

Scheduling in the Dark
by Jeff Edmonds — 1999
… considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing…
Cited by 43 (10 self) – Add To MetaCart

Speed Scaling Functions for Flow Time Scheduling based on Active Job Count
by Tak-wah Lam, Lap-kei Lee, Isaac K. K. To, Prudence W. H. Wong
… in the clairvoyant model and provides the first competitive results on non-clairvoyant scheduling of batched jobs…
Cited by 2 (1 self) – Add To MetaCart

A Lower Bound for Dynamic Scheduling of Data Parallel Programs
by Fabricio Alves Barbosa, Barbosa Silva, Luis Miguel Campos, Isaac D. Scherson
… in [5]. IBTS is a non-clairvoyant scheduling algorithm designed to optimize the competitive ratio (CR…
Add To MetaCart

Simulation-Based Average Case Analysis for Parallel Job Scheduling
by Fabricio Alves Barbosa da Silva, Isaac D. Scherson, Fabricio Alves, Barbosa Silva
… to assign time intervals to jobs in a set of processors. Non-Clairvoyant Scheduling Algorithms assign time…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB