| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10330569 | Future Generation Computer Systems | 2013 | 9 Pages |
Abstract
⺠Self-adjusting resource sharing policies save time and communication bandwidth. ⺠Our policies map jobs proportional to the performance of the resources. ⺠Our algorithms perform a mapping of jobs adjusted to resources real saturation. ⺠We don't need to negotiate with the rest of the participating infrastructures. ⺠Our strategies can reach a good makespan within different saturation level scenarios.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Katia Leal,