Segmented Min-Min: A Static Mapping Algorithm for Meta-Tasks on Heterogeneous Computing Systems

Authors:
Min-You Wu;Wei Shu;Hong Zhang
Affiliations:
-;-;-
Venue:
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Year:
2000

Citing 0
Cited 32

Heterogeneous Computing: Goals, Methods, and Open Problems

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Static Mapping Heuristics for Tasks with Dependencies, Priorities, Deadlines, and Multiple Versions in Heterogeneous Environments

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Utilization-Based Heuristics for Statically Mapping Real-Time Applications onto the HiPer-D Heterogeneous Computing System

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Owner/user role in computational grid extension by non-dedicated resources

GROUP '03 Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work
Genetic Algorithm Based Scheduling of Meta-Tasks with Stochastic Execution Times in Heterogeneous Computing Systemst1

Cluster Computing
Dynamic Mapping in Energy Constrained Heterogeneous Computing Systems

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Mapping subtasks with multiple versions on an ad hoc grid

Parallel Computing - Heterogeneous computing
A Scheduling Algorithm Aimed at Time and Cost for Meta-tasks in Grid Computing Using Fuzzy Applicability

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Static allocation of resources to communicating subtasks in a heterogeneous ad hoc grid environment

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Scheduling of a meta-task with QoS requirements in heterogeneous computing systems

Journal of Parallel and Distributed Computing
Dynamic Resource Management Heuristics for Minimizing Makespan while Maintaining an Acceptable Level of Robustness in an Uncertain Environment

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
CasSim: a top-level-simulator for grid scheduling and applications

CASCON '06 Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment

Journal of Parallel and Distributed Computing
Robust static allocation of resources for independent tasks under makespan and dollar cost constraints

Journal of Parallel and Distributed Computing
Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness

The Journal of Supercomputing
An innovative workflow mapping mechanism for Grids in the frame of Quality of Service

Future Generation Computer Systems
Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions

Journal of Parallel and Distributed Computing
Robust resource allocation in a massive multiplayer online gaming environment

Proceedings of the 4th International Conference on Foundations of Digital Games
Robust resource allocation in a cluster based imaging system

Parallel Computing
The impact of runtime estimation inaccuracy on scheduler performance

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
An improved particle swarm optimization for data streams scheduling on heterogeneous cluster

ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Selecting the most fitting resource for task execution

Future Generation Computer Systems
A novel approach for QoS guided metascheduler for P2P grid system

ICICA'10 Proceedings of the First international conference on Information computing and applications
A novel discrete particle swarm optimization algorithm for meta-task assignment in heterogeneous computing systems

Microprocessors & Microsystems
A case for on-machine load balancing

Journal of Parallel and Distributed Computing
Statistical measures for quantifying task and machine heterogeneities

The Journal of Supercomputing
A survey on grid task scheduling

International Journal of Computer Applications in Technology
A novel approach for QoS guided metascheduler for hypercubic P2P grid system

International Journal of Innovative Computing and Applications
SPA-based task scheduling for hypercubic P2P grid systems

International Journal of Communication Networks and Distributed Systems
Characterization of the iterative application of makespan heuristics on non-makespan machines in a heterogeneous parallel and distributed environment

The Journal of Supercomputing
An efficient implementation of the Min-Min heuristic

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Min-min algorithm is a simple algorithm. It runs fast and delivers good performance. However, the Min-min algorithm schedules small tasks first, resulting in some load imbalance. In this paper, we present an algorithm, which improves the Min-min algorithm by scheduling large tasks first. The new algorithm, Segmented min-min, balances the load well and demonstrates even better performance in both makespan and running time.