Sciweavers

740 search results - page 101 / 148
» Analysis of Scheduling Algorithms with Reservations
Sort
View
72
Voted
SPAA
2003
ACM
15 years 3 months ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...
MST
2000
57views more  MST 2000»
14 years 9 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
IPPS
2007
IEEE
15 years 4 months ago
RASC: Dynamic Rate Allocation for Distributed Stream Processing Applications
In today’s world, stream processing systems have become important, as applications like media broadcasting, sensor network monitoring and on-line data analysis increasingly rely...
Yannis Drougas, Vana Kalogeraki
JSSPP
2007
Springer
15 years 4 months ago
Prospects of Collaboration between Compute Providers by Means of Job Interchange
Abstract. This paper empirically explores the advantages of the collaboration between different parallel compute sites in a decentralized grid scenario. To this end, we assume ind...
Christian Grimme, Joachim Lepping, Alexander Papas...
RTAS
2005
IEEE
15 years 3 months ago
Hybrid Supervisory Utilization Control of Real-Time Systems
Feedback control real-time scheduling (FCS) aims at satisfying performance specifications of real-time systems based on adaptive resource management. Existing FCS algorithms often...
Xenofon D. Koutsoukos, Radhika Tekumalla, Balachan...