18 search results - page 2 / 4 » Scheduling Hadoop Jobs to Meet Deadlines |
ECRTS
2007
IEEE
14 years 1 months ago
2007
IEEE
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In...
RTAS
2006
IEEE
14 years 1 months ago
2006
IEEE
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
BOINC, a middleware system for volunteer computing, involves projects, which distribute jobs, and hosts, which execute jobs. The local (host-level) scheduler addresses two issues:...
SCHEDULING
2008
13 years 6 months ago
2008
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
TPDS
2008
13 years 7 months ago
2008
Security is increasingly becoming an important issue in the design of real-time parallel applications, which are widely used in the industry and academic organizations. However, ex...