On tradeoff between the two compromise factors in assigning tasks on a cluster computing

Title
On tradeoff between the two compromise factors in assigning tasks on a cluster computing
Authors
Keywords
Cluster, Heuristic task assignment algorithms, Graph transformation, Load balancing, Minimum N-cut
Publisher
Springer Nature
Online
2013-11-27
DOI
10.1007/s10586-013-0301-8

Ask authors/readers for more resources

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started