Sciweavers

7065 search results - page 346 / 1413
» Iterative Scheduling Algorithms
Sort
View
SWAT
2004
Springer
125views Algorithms» more  SWAT 2004»
16 years 3 days ago
The Optimal Online Algorithms for Minimizing Maximum Lateness
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
Patchrawat Uthaisombut
IPPS
2007
IEEE
16 years 1 months ago
Knowledge and Cache Conscious Algorithm Design and Systems Support for Data Mining Algorithms
The knowledge discovery process is interactive in nature and therefore minimizing query response time is imperative. The compute and memory intensive nature of data mining algorit...
Amol Ghoting, Gregory Buehrer, Matthew Goyder, Shi...
ICDE
2009
IEEE
122views Database» more  ICDE 2009»
16 years 8 months ago
Best-Effort Top-k Query Processing Under Budgetary Constraints
Abstract-- We consider a novel problem of top-k query processing under budget constraints. We provide both a framework and a set of algorithms to address this problem. Existing alg...
Michal Shmueli-Scheuer, Chen Li, Yosi Mass, Haggai...
ICDE
2008
IEEE
116views Database» more  ICDE 2008»
16 years 8 months ago
Network-Aware Join Processing in Global-Scale Database Federations
Abstract-- We introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation....
Xiaodan Wang, Randal C. Burns, Andreas Terzis, Amo...
ECRTS
2003
IEEE
16 years 2 days ago
Using Supertasks to Improve Processor Utilization in Multiprocessor Real-Time Systems
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...
Philip Holman, James H. Anderson