Sciweavers

511 search results - page 15 / 103
» Analysis of Multi-Organization Scheduling Algorithms
Sort
View
ICC
2007
IEEE
14 years 1 months ago
Achievable Sum-Rate Analysis of Practical Multiuser Scheduling Schemes with Limited Feedback
— We study the performance of fair physical layer schedulers that select a pair of orthogonal users for simultaneous transmission. The schemes rely on partial channel state infor...
Alexis A. Dowhuszko, Graciela Corral-Briones, Jyri...
ESORICS
2010
Springer
13 years 7 months ago
Flexible Scheduler-Independent Security
Abstract We propose an approach to certify the information flow security of multi-threaded programs independently from the scheduling algorithm. A scheduler-independent verificatio...
Heiko Mantel, Henning Sudbrock
IPPS
2006
IEEE
14 years 1 months ago
Schedulability analysis of non-preemptive recurring real-time tasks
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
Sanjoy K. Baruah, Samarjit Chakraborty
PRDC
2006
IEEE
14 years 1 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck
JSSPP
2004
Springer
14 years 23 days ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...