LODS: Locality-oriented dynamic scheduling for on-chip multiprocessors

Research output: Contribution to journalConference article

5 Citations (Scopus)

Abstract

Current multiprocessor SoC applications like network protocol codes, multimedia processing and base-band telecom circuits have tight time-to-market and performance constraints, which require an efficient design cycle. Consequently, automated techniques such as those oriented towards exploiting data locality are critical. In this paper, we demonstrate that, existing loop scheduling techniques provide performance improvements even on on-chip multiprocessors, but they fall short of generating the best results since they do not take data locality into account as an explicit optimization parameter. Based on this observation, we propose a data locality-oriented loop-scheduling algorithm. The idea is to assign loop iterations to processors in such a fashion that each processor makes maximum reuse of the data it accesses.

Original languageEnglish (US)
Pages (from-to)125-128
Number of pages4
JournalProceedings - Design Automation Conference
StatePublished - Sep 20 2004
EventProceedings of the 41st Design Automation Conference - San Diego, CA, United States
Duration: Jun 7 2004Jun 11 2004

Fingerprint

Scheduling algorithms
Scheduling
Network protocols
Networks (circuits)
Processing
System-on-chip

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

@article{87770b68bafa4aff97472f81f9f46488,
title = "LODS: Locality-oriented dynamic scheduling for on-chip multiprocessors",
abstract = "Current multiprocessor SoC applications like network protocol codes, multimedia processing and base-band telecom circuits have tight time-to-market and performance constraints, which require an efficient design cycle. Consequently, automated techniques such as those oriented towards exploiting data locality are critical. In this paper, we demonstrate that, existing loop scheduling techniques provide performance improvements even on on-chip multiprocessors, but they fall short of generating the best results since they do not take data locality into account as an explicit optimization parameter. Based on this observation, we propose a data locality-oriented loop-scheduling algorithm. The idea is to assign loop iterations to processors in such a fashion that each processor makes maximum reuse of the data it accesses.",
author = "Mahmut Kandemir",
year = "2004",
month = "9",
day = "20",
language = "English (US)",
pages = "125--128",
journal = "Proceedings - Design Automation Conference",
issn = "0738-100X",

}

LODS : Locality-oriented dynamic scheduling for on-chip multiprocessors. / Kandemir, Mahmut.

In: Proceedings - Design Automation Conference, 20.09.2004, p. 125-128.

Research output: Contribution to journalConference article

TY - JOUR

T1 - LODS

T2 - Locality-oriented dynamic scheduling for on-chip multiprocessors

AU - Kandemir, Mahmut

PY - 2004/9/20

Y1 - 2004/9/20

N2 - Current multiprocessor SoC applications like network protocol codes, multimedia processing and base-band telecom circuits have tight time-to-market and performance constraints, which require an efficient design cycle. Consequently, automated techniques such as those oriented towards exploiting data locality are critical. In this paper, we demonstrate that, existing loop scheduling techniques provide performance improvements even on on-chip multiprocessors, but they fall short of generating the best results since they do not take data locality into account as an explicit optimization parameter. Based on this observation, we propose a data locality-oriented loop-scheduling algorithm. The idea is to assign loop iterations to processors in such a fashion that each processor makes maximum reuse of the data it accesses.

AB - Current multiprocessor SoC applications like network protocol codes, multimedia processing and base-band telecom circuits have tight time-to-market and performance constraints, which require an efficient design cycle. Consequently, automated techniques such as those oriented towards exploiting data locality are critical. In this paper, we demonstrate that, existing loop scheduling techniques provide performance improvements even on on-chip multiprocessors, but they fall short of generating the best results since they do not take data locality into account as an explicit optimization parameter. Based on this observation, we propose a data locality-oriented loop-scheduling algorithm. The idea is to assign loop iterations to processors in such a fashion that each processor makes maximum reuse of the data it accesses.

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

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

M3 - Conference article

AN - SCOPUS:4444324000

SP - 125

EP - 128

JO - Proceedings - Design Automation Conference

JF - Proceedings - Design Automation Conference

SN - 0738-100X

ER -