Citation
Lower bounds for the parallel processing scheduling problem with multiprocessor tasks, release date and delivery time. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 403-411, 2015.
Paper
Abstract
In this paper, we consider the multiprocessor-task scheduling problem in a parallel processing system. The tasks are characterized by a release date (or arrival time), processing time, and delivery time. In addition, a task requires more than one processor to be processed in parallel. The objective of this research is to provide a feasible schedule that minimizes the completion time, or makespan, of the last treated task. Multiprocessor task scheduling plays a fundamental role in the performance of parallel and distributed computing systems. In this regard, we propose a family of new tight lower bounds. Finally, we present results related to the assessment of the efficiency of the proposed lower bounds after undertaking extensive computational experiments.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2015-403-411-P, author = {L. Hidri and B. Ben Youssef and A. Gazdar},
title = {Lower bounds for the parallel processing scheduling problem with multiprocessor tasks, release date and delivery time },
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {403--411},
note = {Paper},
abstract = { In this paper, we consider the multiprocessor-task scheduling problem in a parallel processing system. The tasks are characterized by a release date (or arrival time), processing time, and delivery time. In addition, a task requires more than one processor to be processed in parallel. The objective of this research is to provide a feasible schedule that minimizes the completion time, or makespan, of the last treated task. Multiprocessor task scheduling plays a fundamental role in the performance of parallel and distributed computing systems. In this regard, we propose a family of new tight lower bounds. Finally, we present results related to the assessment of the efficiency of the proposed lower bounds after undertaking extensive computational experiments. },
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-403-411-P.pdf} }