liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Flexible scheduling and thread allocation for synchronous parallel tasks
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology. (PELAB)ORCID iD: 0000-0001-5241-0026
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology. (PELAB)
2012 (English)In: ARCS-2012 Workshops / [ed] G. Mühl, J. Richling, A. Herkersdorf, Gesellschaft für Informatik , 2012, 517-528 p.Conference paper, Published paper (Refereed)
Abstract [en]

We describe a task model and dynamic scheduling and resource allocation mechanism for synchronous parallel tasks to be executed on SPMD-programmed synchronous shared memory MIMD parallel architectures with uniform, unit-time memory access and strict memory consistency, also known inthe literature as PRAMs (Parallel Random Access Machines). Our task model provides a two-tier programming model for PRAMs that flexibly combines SPMD and fork-join parallelism within the same application. It offers flexibility by dynamic scheduling and late resource binding while preserving the PRAM execution properties within each task, the only limitation being that the maximum number of threads that can be assigned to a task is limited to what the underlying architecture provides. In particular, our approach opens for automatic performance tuning at run-time by controlling the thread allocation for tasks based on run-time predictions.By a prototype implementation of a synchronous parallel task API in the SPMD-based PRAM language Fork and experimental evaluation with example programs on the SBPRAM simulator, we show that a realization of the task model on a SPMD-programmable PRAM machine is feasible with moderate runtimeoverhead per task.

Place, publisher, year, edition, pages
Gesellschaft für Informatik , 2012. 517-528 p.
Series
Lecture Notes in Informatics, ISSN 1617-5468 ; 29
Keyword [en]
Malleable tasks, mapping, PRAM, parallel computing, scheduling, thread allocation, run-time system, parallel task queue
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-91572ISBN: 978-1-4577-2145-8 (print)OAI: oai:DiVA.org:liu-91572DiVA: diva2:618372
Conference
10th Workshop on Parallel Systems and Algorithms (PASA 2012), Munich, Germany, February 29, 2012
Projects
REPLICA
Available from: 2013-04-26 Created: 2013-04-26 Last updated: 2014-10-08

Open Access in DiVA

No full text

Other links

IEEE Xplore

Authority records BETA

Kessler, ChristophHansson, Erik

Search in DiVA

By author/editor
Kessler, ChristophHansson, Erik
By organisation
Software and SystemsThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 48 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf