Evaluation of Energy-Optimizing Scheduling Algorithms for Streaming Computations on Massively Parallel Multicore Architectures

This thesis describes an environment to evaluate and compare static schedulers for real pipelined streaming applications on massively parallel architectures, such as Intel Single chip Cloud Computer (SCC), Adapteva Epiphany, and Tilera TILE-Gx series. The framework allows performance comparison of s...

Full description

Bibliographic Details
Main Author: Janzén, Johan
Format: Others
Language:English
Published: Linköpings universitet, Institutionen för datavetenskap 2014
Subjects:
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-111385
id ndltd-UPSALLA1-oai-DiVA.org-liu-111385
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-liu-1113852014-10-21T04:51:09ZEvaluation of Energy-Optimizing Scheduling Algorithms for Streaming Computations on Massively Parallel Multicore ArchitecturesengEvaluering av energioptimerande schemaläggningsalgoritmer för strömmande beräkningar på massivt parallella flerkärniga arkitekturerJanzén, JohanLinköpings universitet, Institutionen för datavetenskapLinköpings universitet, Tekniska högskolan2014Intel SCCDVFSTask based programmingStatic schedulingEnergy efficiencyMulticoreThis thesis describes an environment to evaluate and compare static schedulers for real pipelined streaming applications on massively parallel architectures, such as Intel Single chip Cloud Computer (SCC), Adapteva Epiphany, and Tilera TILE-Gx series. The framework allows performance comparison of schedulers in their execution time, or the energy usage of static schedules with energy models and measurements on real platform. This thesis focuses on the implementation of a framework evaluating the energy consumption of such streaming applications on the SCC. The framework can run streaming applications, built as task collections, with static schedules including dynamic frequency scaling. Streams are handled by the framework with FIFO buffers, connected between tasks. We evaluate the framework by considering a pipelined mergesort implementation with different static schedules. The runtime is compared with the runtime of a previously published task based optimized mergesort implementation. The results show how much overhead the framework adds on to the streaming application. As a demonstration of the energy measuring capabilities, we schedule and analyze a Fast Fourier Transform application, and discuss the results. Future work may include quantitative comparative studies of a range of different static schedulers. This has, to our knowledge, not been done previously. Student thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-111385application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Others
sources NDLTD
topic Intel SCC
DVFS
Task based programming
Static scheduling
Energy efficiency
Multicore
spellingShingle Intel SCC
DVFS
Task based programming
Static scheduling
Energy efficiency
Multicore
Janzén, Johan
Evaluation of Energy-Optimizing Scheduling Algorithms for Streaming Computations on Massively Parallel Multicore Architectures
description This thesis describes an environment to evaluate and compare static schedulers for real pipelined streaming applications on massively parallel architectures, such as Intel Single chip Cloud Computer (SCC), Adapteva Epiphany, and Tilera TILE-Gx series. The framework allows performance comparison of schedulers in their execution time, or the energy usage of static schedules with energy models and measurements on real platform. This thesis focuses on the implementation of a framework evaluating the energy consumption of such streaming applications on the SCC. The framework can run streaming applications, built as task collections, with static schedules including dynamic frequency scaling. Streams are handled by the framework with FIFO buffers, connected between tasks. We evaluate the framework by considering a pipelined mergesort implementation with different static schedules. The runtime is compared with the runtime of a previously published task based optimized mergesort implementation. The results show how much overhead the framework adds on to the streaming application. As a demonstration of the energy measuring capabilities, we schedule and analyze a Fast Fourier Transform application, and discuss the results. Future work may include quantitative comparative studies of a range of different static schedulers. This has, to our knowledge, not been done previously.
author Janzén, Johan
author_facet Janzén, Johan
author_sort Janzén, Johan
title Evaluation of Energy-Optimizing Scheduling Algorithms for Streaming Computations on Massively Parallel Multicore Architectures
title_short Evaluation of Energy-Optimizing Scheduling Algorithms for Streaming Computations on Massively Parallel Multicore Architectures
title_full Evaluation of Energy-Optimizing Scheduling Algorithms for Streaming Computations on Massively Parallel Multicore Architectures
title_fullStr Evaluation of Energy-Optimizing Scheduling Algorithms for Streaming Computations on Massively Parallel Multicore Architectures
title_full_unstemmed Evaluation of Energy-Optimizing Scheduling Algorithms for Streaming Computations on Massively Parallel Multicore Architectures
title_sort evaluation of energy-optimizing scheduling algorithms for streaming computations on massively parallel multicore architectures
publisher Linköpings universitet, Institutionen för datavetenskap
publishDate 2014
url http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-111385
work_keys_str_mv AT janzenjohan evaluationofenergyoptimizingschedulingalgorithmsforstreamingcomputationsonmassivelyparallelmulticorearchitectures
AT janzenjohan evalueringavenergioptimerandeschemalaggningsalgoritmerforstrommandeberakningarpamassivtparallellaflerkarnigaarkitekturer
_version_ 1716718816438779904