94 search results - page 7 / 19 » Improved Bounds on Relaxations of a Parallel Machine Schedul... |
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
ISPASS
2009
IEEE
2009
IEEE
Machine learning based online performance prediction for runtime parallelization and task scheduling
14 years 2 months ago
—With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as w...
AIPS
2009
13 years 8 months ago
2009
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
SWAT
2004
Springer
14 years 26 days ago
2004
Springer
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...