NDLI: On the Application Task Granularity and the Interplay with the Scheduling Overhead in Many-Core Shared Memory Systems

Content Provider	IEEE Xplore Digital Library
Author	Akhmetova, D. Kestor, G. Gioiosa, R. Markidis, S. Laure, E.
Copyright Year	2015
Description	Author affiliation: High Performance Comput. & Visualization Dept., KTH R. Inst. of Technol., Stockholm, Sweden (Markidis, S.; Laure, E.) \|\| High Performance Comput., Pacific Northwest Nat. Lab., Richland, WA, USA (Akhmetova, D.; Kestor, G.; Gioiosa, R.)
Abstract	Task-based programming models are considered one of the most promising programming model approaches for exascale supercomputers because of their ability to dynamically react to changing conditions and reassign work to processing elements. One question, however, remains unsolved: what should the task granularity of task-based applications be? Fine-grained tasks offer more opportunities to balance the system and generally result in higher system utilization. However, they also induce in large scheduling overhead. The impact of scheduling overhead on coarse-grained tasks is lower, but large systems may result imbalanced and underutilized. In this work we propose a methodology to analyze the interplay between application task granularity and scheduling overhead. Our methodology is based on three main points: 1) a novel task algorithm that analyzes an application directed acyclic graph (DAG) and aggregates tasks, 2) a fast and precise emulator to analyze the application behavior on systems with up to 1,024 cores, 3) a comprehensive sensitivity analysis of application performance and scheduling overhead breakdown. Our results show that there is an optimal task granularity between $1.2×10^{4}$ and $10×10^{4}$ cycles for the representative schedulers. Moreover, our analysis indicates that a suitable scheduler for exascale task-based applications should employ a best-effort local scheduler and a sophisticated remote scheduler to move tasks across worker threads.
Starting Page	428
Ending Page	437
File Size	321392
Page Count	10
File Format	PDF
ISBN	9781467365987
DOI	10.1109/CLUSTER.2015.65
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-09-08
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Runtime Programming Synchronization Processor scheduling Scalability Aggregates Scheduling task-based schedulers task granularity scheduling overhead task-based programming models
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Scheduling directives for shared-memory many-core processor systems

Adaptive scheduling framework for multi-core systems based on task-parallel programming model

A realistic model for runtime incremental task scheduling in distributed memory multiprocessor systems

Performance Evaluation of Task Pools Based on Hardware Synchronization

Evaluation of hardware synchronization support of the scc many-core processor.

Online Scalability Characterization of Data-Parallel Programs on Many Cores

A HLS-Based Toolflow to Design Next-Generation Heterogeneous Many-Core Platforms with Shared Memory

Task synchronization and allocation for many-core real-time systems

Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors (1994)

On the Application Task Granularity and the Interplay with the Scheduling Overhead in Many-Core Shared Memory Systems

Similar Documents

Scheduling directives for shared-memory many-core processor systems

Adaptive scheduling framework for multi-core systems based on task-parallel programming model

A realistic model for runtime incremental task scheduling in distributed memory multiprocessor systems

Performance Evaluation of Task Pools Based on Hardware Synchronization

Evaluation of hardware synchronization support of the scc many-core processor.

Online Scalability Characterization of Data-Parallel Programs on Many Cores

A HLS-Based Toolflow to Design Next-Generation Heterogeneous Many-Core Platforms with Shared Memory

Task synchronization and allocation for many-core real-time systems

Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors (1994)

On the Application Task Granularity and the Interplay with the Scheduling Overhead in Many-Core Shared Memory Systems