Sciweavers

1758 search results - page 134 / 352
» Schedule processes, not VCPUs
Sort
View
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
16 years 26 days ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
COORDINATION
2009
Springer
16 years 1 months ago
Fairness for Chorded Languages
Joins or chords is a concurrency construct that seems to fit well with the object oriented paradigm. Chorded languages are presented with implicit assumptions regarding the fair t...
Alexis Petrounias, Susan Eisenbach
184
Voted
RTSS
1998
IEEE
15 years 11 months ago
Improved Response-Time Analysis Calculations
Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed...
Mikael Sjödin, Hans Hansson
EXPERT
2002
129views more  EXPERT 2002»
15 years 6 months ago
Modeling and Simulating Work Practice: A Method for Work Systems Design
er than abstracting human behavior as work processes or tasks--functional idealizations of the work to be accomplished--we model people's activities comprehensively and chrono...
Maarten Sierhuis, William J. Clancey
SAC
2005
ACM
16 years 9 days ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq