Sciweavers

641 search results - page 26 / 129
» On robust online scheduling algorithms
Sort
View
SIGMOD
2003
ACM
119views Database» more  SIGMOD 2003»
14 years 8 months ago
Robust and Efficient Fuzzy Match for Online Data Cleaning
To ensure high data quality, data warehouses must validate and cleanse incoming data tuples from external sources. In many situations, clean tuples must match acceptable tuples in...
Surajit Chaudhuri, Kris Ganjam, Venkatesh Ganti, R...
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 8 months ago
Online Scheduling to Minimize the Maximum Delay Factor
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
Chandra Chekuri, Benjamin Moseley
ICDCS
1996
IEEE
14 years 1 days ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
Babak Hamidzadeh, David J. Lilja
FOCS
2003
IEEE
14 years 1 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
ICPP
2003
IEEE
14 years 1 months ago
Scheduling Algorithms with Bus Bandwidth Considerations for SMPs
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focu...
Christos D. Antonopoulos, Dimitrios S. Nikolopoulo...