Sciweavers

101 search results - page 15 / 21
» Performing work with asynchronous processors: message-delay-...
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 7 months ago
One shot schemes for decentralized quickest change detection
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
Olympia Hadjiliadis, Hongzhong Zhang, H. Vincent P...
TON
1998
71views more  TON 1998»
13 years 7 months ago
Real-time block transfer under a link-sharing hierarchy
— Most application data units are too large to be carried in a single packet (or cell) and must be segmented for network delivery. To an application, the end-to-end delays and lo...
Geoffrey G. Xie, Simon S. Lam
ECCC
2000
140views more  ECCC 2000»
13 years 7 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
ICALP
2010
Springer
13 years 9 months ago
Resource Oblivious Sorting on Multicores
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...
Richard Cole, Vijaya Ramachandran
USENIX
2001
13 years 8 months ago
Improving the FreeBSD SMP Implementation
UNIX-derived operating systems have traditionally have a simplistic approach to process synchronization which is unsuited to multiprocessor application. Initial FreeBSD SMP suppor...
Greg Lehey