Algorithms for handling skew in parallel task scheduling

[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI:10.1109/RIDE.1992.227423

A. Swami, H. Young, Ashish Gupta

引用次数: 5

Abstract

Presents two new algorithms, the LPT-MinHeight (LPTMH) algorithm and the Split-LPT (SLPT) algorithm, for handling skew in parallel task scheduling. Both algorithms are based on the LPT (Largest Processing Time first) algorithm. The worst case imbalance for the LPTMH algorithm never exceeds 1/(e-1)>

查看原文本刊更多论文

并行任务调度中处理倾斜的算法

针对并行任务调度中的倾斜问题，提出了LPT-MinHeight (LPTMH)算法和Split-LPT (SLPT)算法。这两种算法都基于LPT(最大处理时间优先)算法。LPTMH算法的最坏情况不平衡不超过1/(e-1)>

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing

自引率

0.00%

发文量