Dynamic-level scheduling for heterogeneous processor networks

Authors:
Sih; Lee
Affiliations:
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA;Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
Venue:
SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
Year:
1990

Citing 0
Cited 1

WSCOM: Online Task Scheduling with Data Transfers

CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic-level scheduling is an effective compile-time scheduling technique which accounts for interprocessor communication overhead when mapping precedence-constrained, communicating tasks onto arbitrarily interconnected processor networks. Scheduling and routing are performed simultaneously to account for limited interconnections between processors, and communications are scheduled along with computations to eliminate shared-resource contention. The paper extends the dynamic-level scheduling methodology to encompass heterogeneous processing environments, and presents two techniques designed to enhance scheduling performance: forward/backward scheduling, and precedence constraint appendage.