Job scheduling in a multi-layer vision system

M. Fikret Ercan; Ceyda Oǧuz; Yu Fai Fung

Job scheduling in a multi-layer vision system

M. Fikret Ercan, Ceyda Oǧuz, Yu Fai Fung

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

Abstract

We consider job scheduling in a multi-layer vision system. We model this problem as scheduling a number of jobs, which are made of multiprocessor tasks, with arbitrary processing times and arbitrary processor requirements in a two-layer system. Our objective is to minimize the makespan. We have developed several heuristic algorithms that include simple sequencing and scheduling rules. The computational experiments show that three of these heuristic algorithms are efficient.

Original language	English
Title of host publication	Euro-Par 1999 - Parallel Processing
Subtitle of host publication	5th International Conference, Proceedings
Pages	317-321
Number of pages	5
Publication status	Published - Sept 1999
Event	5th International Conference on Parallel Processing, Euro-Par 1999 - Toulouse, France Duration: 31 Aug 1999 → 3 Sept 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1685 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International Conference on Parallel Processing, Euro-Par 1999
Country/Territory	France
City	Toulouse
Period	31/08/99 → 3/09/99

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Cite this

@inproceedings{c3c51cbe71ea4ae99823a003a328bc83,

title = "Job scheduling in a multi-layer vision system",

abstract = "We consider job scheduling in a multi-layer vision system. We model this problem as scheduling a number of jobs, which are made of multiprocessor tasks, with arbitrary processing times and arbitrary processor requirements in a two-layer system. Our objective is to minimize the makespan. We have developed several heuristic algorithms that include simple sequencing and scheduling rules. The computational experiments show that three of these heuristic algorithms are efficient.",

author = "Ercan, {M. Fikret} and Ceyda Oǧuz and Fung, {Yu Fai}",

year = "1999",

month = sep,

language = "English",

isbn = "3540664432",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "317--321",

booktitle = "Euro-Par 1999 - Parallel Processing",

note = "5th International Conference on Parallel Processing, Euro-Par 1999 ; Conference date: 31-08-1999 Through 03-09-1999",

}

Ercan, MF, Oǧuz, C & Fung, YF 1999, Job scheduling in a multi-layer vision system. in Euro-Par 1999 - Parallel Processing: 5th International Conference, Proceedings., 97327, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1685 LNCS, pp. 317-321, 5th International Conference on Parallel Processing, Euro-Par 1999, Toulouse, France, 31/08/99.

Job scheduling in a multi-layer vision system. / Ercan, M. Fikret; Oǧuz, Ceyda; Fung, Yu Fai.
Euro-Par 1999 - Parallel Processing: 5th International Conference, Proceedings. 1999. p. 317-321 97327 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1685 LNCS).

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Job scheduling in a multi-layer vision system

AU - Ercan, M. Fikret

AU - Oǧuz, Ceyda

AU - Fung, Yu Fai

PY - 1999/9

Y1 - 1999/9

N2 - We consider job scheduling in a multi-layer vision system. We model this problem as scheduling a number of jobs, which are made of multiprocessor tasks, with arbitrary processing times and arbitrary processor requirements in a two-layer system. Our objective is to minimize the makespan. We have developed several heuristic algorithms that include simple sequencing and scheduling rules. The computational experiments show that three of these heuristic algorithms are efficient.

AB - We consider job scheduling in a multi-layer vision system. We model this problem as scheduling a number of jobs, which are made of multiprocessor tasks, with arbitrary processing times and arbitrary processor requirements in a two-layer system. Our objective is to minimize the makespan. We have developed several heuristic algorithms that include simple sequencing and scheduling rules. The computational experiments show that three of these heuristic algorithms are efficient.

UR - http://www.scopus.com/inward/record.url?scp=84878653468&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

AN - SCOPUS:84878653468

SN - 3540664432

SN - 9783540664437

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 317

EP - 321

BT - Euro-Par 1999 - Parallel Processing

T2 - 5th International Conference on Parallel Processing, Euro-Par 1999

Y2 - 31 August 1999 through 3 September 1999

ER -

Job scheduling in a multi-layer vision system

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this