Cited By
View all- Liu JWang QZhang SHu LDa Silva D(2023)SoraProceedings of the 24th International Middleware Conference10.1145/3590140.3592851(43-56)Online publication date: 27-Nov-2023
It is now possible to allow VMs hosting HPC applications to seamlessly bridge distributed cloud resources and tightly-coupled supercomputing and cluster resources. However, to achieve the application performance that the tightly-coupled resources are ...
This paper studies the Pareto optimization scheduling problem of family jobs on an unbounded parallel-batching machine to minimize makespan and maximum lateness. In the problem, the jobs are partitioned into families and scheduled in batches, where each ...
The YDS algorithm computes a schedule on a DVS-enabled resource to meet deadlines of all jobs and optimally minimize the total energy consumption. The algorithm requires that an exact execution time of each job be known. For settings where execution ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in