34 search results - page 4 / 7 » Approximation Algorithms for Scheduling Multiple Feasible In... |
APPROX
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
ICTCS
2003
Springer
13 years 11 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
RTCSA
2006
IEEE
13 years 11 months ago
2006
IEEE
The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time...
DATE
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
EURONGI
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...