Sciweavers

904 search results - page 32 / 181
» Scheduling task graphs optimally with A
Sort
View
RTSS
2005
IEEE
14 years 2 months ago
The Partitioned Multiprocessor Scheduling of Sporadic Task Systems
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning probl...
Sanjoy K. Baruah, Nathan Fisher
RTSS
1992
IEEE
14 years 22 days ago
Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
Kevin Jeffay
GRID
2004
Springer
14 years 2 months ago
Memory Conscious Task Partition and Scheduling in Grid Environments
While resource management and task scheduling are identified challenges of Grid computing, current Grid scheduling systems mainly focus on CPU and network availability. Recent per...
Ming Wu, Xian-He Sun
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 10 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
JVA
2006
IEEE
14 years 2 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova