Skip to main content
Conference ProceedingsOPEN ACCESS

Non-approximability of the bulk synchronous task scheduling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2400 225-233
DOI: 10.1007/3-540-45706-2_29
0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The mainstream architecture of a parallel machine with more than tens of processors is a distributed-memory machine. The bulk synchronous task scheduling problem (BSSP, for short) is an task scheduling problem for distributed-memory machines. This paper shows that there does not exist a ρ-approximation algorithm to solve the optimization counterpart of BSSP for any (formula presented) unless P = NP.

Cite

CITATION STYLE

APA

Fujimoto, N., & Hagihara, K. (2002). Non-approximability of the bulk synchronous task scheduling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2400, pp. 225–233). Springer Verlag. https://doi.org/10.1007/3-540-45706-2_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free