Sciweavers

1758 search results - page 76 / 352
» Schedule processes, not VCPUs
Sort
View
COORDINATION
2009
Springer
16 years 7 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes
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...
GECCO
2005
Springer
384views Optimization» more  GECCO 2005»
16 years 5 days ago
A case study of process facility optimization using discrete event simulation and genetic algorithm
Optimization problems such as resource allocation, job-shop scheduling, equipment utilization and process scheduling occur in a broad range of processing industries. This paper pr...
Keshav P. Dahal, Stuart Galloway, Graeme M. Burt, ...
EMSOFT
2004
Springer
16 years 1 days ago
Multiple process execution in cache related preemption delay analysis
Cache prediction for preemptive scheduling is an open issue despite its practical importance. First analysis approaches use simplified models for cache behavior or they assume si...
Jan Staschulat, Rolf Ernst
SOSP
2007
ACM
16 years 3 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...