Sciweavers

2438 search results - page 386 / 488
» Scheduling problems for parallel and distributed systems
Sort
View
SPAA
2005
ACM
15 years 10 months ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev
142
Voted
IPPS
2003
IEEE
15 years 9 months ago
Importance of SIMD Computation Reconsidered
In this paper, SIMD and MIMD solutions for the realtime database management problem of air traffic control are compared. A real-time database system is highly constrained in a mul...
Will C. Meilander, Johnnie W. Baker, Mingxian Jin
SPAA
2003
ACM
15 years 9 months ago
Relaxing the problem-size bound for out-of-core columnsort
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Corm...
ECOOPW
2006
Springer
15 years 8 months ago
Program Analysis for Security and Privacy
Abstract. Software security has become more important than ever. Unfortunately, still now, the security of a software system is almost always retrofitted to an afterthought. When s...
Marco Pistoia, Francesco Logozzo
INFOCOM
1991
IEEE
15 years 8 months ago
Queueing Performance with Impatient Customers
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
Zheng-Xue Zhao, Shivendra S. Panwar, Donald F. Tow...