A performance study of multiprocessor task scheduling algorithms

Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between the quality of the solution and the computational complexity and scalability of the algorithm. Previous comparison studies have frequently operated with simplifying assumptions, such as independent tasks, artificially generated problems or the assumption of zero communication delay. In this paper, we propose a comparison study with realistic assumptions. Our target problems are two well known problems of linear algebra: LU decomposition and Gauss

• Type: Journal
• Year: 2008
• Where: TJS
• Authors: Shiyuan Jin, Guy A. Schiavone, Damla Turgut
• Keywords: Algorithms, Communication Delay, Multiprocessor Task Scheduling, TJS 2008