21 search results - page 2 / 5 » A Tighter Analysis of Work Stealing |
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— While the practical coding scheme [1] has been shown to be able to improve throughput of wireless networks, there still lacks fundamental understanding on how the coding scheme...
CODES
2007
IEEE
14 years 1 months ago
2007
IEEE
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
RTAS
1998
IEEE
13 years 11 months ago
1998
IEEE
Static timing analyzers need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. ...