Sciweavers

457 search results - page 66 / 92
» Decay-Usage Scheduling in Multiprocessors
Sort
View
RTAS
2010
IEEE
15 years 2 months ago
A Bandwidth Reservation Strategy for Multiprocessor Real-Time Scheduling
—The problem of scheduling a set of tasks on a multiprocessor architecture is addressed. Tasks are assumed to be sporadic with arbitrary deadlines and may migrate between process...
Ernesto Massa, George Lima
PPL
2006
81views more  PPL 2006»
15 years 4 months ago
Microthreading a Model for Distributed Instruction-level Concurrency
This paper analyses the micro-threaded model of concurrency making comparisons with both data and instruction-level concurrency. The model is fine grain and provides synchronisati...
Chris R. Jesshope
STOC
1999
ACM
106views Algorithms» more  STOC 1999»
15 years 8 months ago
Scheduling in the Dark
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
Jeff Edmonds
EMSOFT
2011
Springer
14 years 4 months ago
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
Mohamed Bamakhrama, Todor Stefanov
RTS
2010
134views more  RTS 2010»
15 years 2 months ago
Improved multiprocessor global schedulability analysis
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) ...
Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto March...