Sökning: WFRF:(Brorsson Mats 1962 ) >
Locality-aware task...
Locality-aware task scheduling for homogeneous parallel computing systems
-
- Bhatti, Muhammad Khurram (författare)
- Information Technology University (ITU), Pakistan,Informat Technol Univ, Embedded Comp Lab, 346-B Ferozpur Rd, Lahore, Pakistan.
-
- Oz, Isil (författare)
- Izmir Institute of Technology, Turkey,Izmir Inst Technol, Comp Engn Dept, Izmir, Turkey.
-
- Amin, Sarah (författare)
- Information Technology University (ITU), Pakistan,Informat Technol Univ, Embedded Comp Lab, 346-B Ferozpur Rd, Lahore, Pakistan.
-
visa fler...
-
- Mushtaq, Maria (författare)
- Information Technology University (ITU), Pakistan,Informat Technol Univ, Embedded Comp Lab, 346-B Ferozpur Rd, Lahore, Pakistan.
-
- Farooq, Umer (författare)
- Dhofar University, Oman,Dhofar Univ, Dept Elect & Comp Engn, Salalah 211, Oman.
-
- Popov, Konstantin (författare)
- RISE,SICS,SICS, Isafjordsgatan 22, S-16429 Kista, Sweden.
-
- Brorsson, Mats, 1962- (författare)
- KTH,Programvaruteknik och datorsystem, SCS,KTH Royal Institute of Technology, Sweden
-
visa färre...
-
Information Technology University (ITU), Pakistan Informat Technol Univ, Embedded Comp Lab, 346-B Ferozpur Rd, Lahore, Pakistan (creator_code:org_t)
- 2017-11-01
- 2018
- Engelska.
-
Ingår i: Computing. - : Springer Science and Business Media LLC. - 0010-485X .- 1436-5057. ; 100:6, s. 557-595
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- In systems with complex many-core cache hierarchy, exploiting data locality can significantly reduce execution time and energy consumption of parallel applications. Locality can be exploited at various hardware and software layers. For instance, by implementing private and shared caches in a multi-level fashion, recent hardware designs are already optimised for locality. However, this would all be useless if the software scheduling does not cast the execution in a manner that promotes locality available in the programs themselves. Since programs for parallel systems consist of tasks executed simultaneously, task scheduling becomes crucial for the performance in multi-level cache architectures. This paper presents a heuristic algorithm for homogeneous multi-core systems called locality-aware task scheduling (LeTS). The LeTS heuristic is a work-conserving algorithm that takes into account both locality and load balancing in order to reduce the execution time of target applications. The working principle of LeTS is based on two distinctive phases, namely; working task group formation phase (WTG-FP) and working task group ordering phase (WTG-OP). The WTG-FP forms groups of tasks in order to capture data reuse across tasks while the WTG-OP determines an optimal order of execution for task groups that minimizes the reuse distance of shared data between tasks. We have performed experiments using randomly generated task graphs by varying three major performance parameters, namely: (1) communication to computation ratio (CCR) between 0.1 and 1.0, (2) application size, i.e., task graphs comprising of 50-, 100-, and 300-tasks per graph, and (3) number of cores with 2-, 4-, 8-, and 16-cores execution scenarios. We have also performed experiments using selected real-world applications. The LeTS heuristic reduces overall execution time of applications by exploiting inter-task data locality. Results show that LeTS outperforms state-of-the-art algorithms in amortizing inter-task communication cost.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
- NATURVETENSKAP -- Fysik -- Annan fysik (hsv//swe)
- NATURAL SCIENCES -- Physical Sciences -- Other Physics Topics (hsv//eng)
Nyckelord
- Directed acyclic graph (DAG)
- Embedded systems
- Homogeneous systems
- Multicore scheduling
- Parallel computing
- Runtime resource management
- Directed graphs
- Distributed computer systems
- Energy utilization
- Hardware
- Heuristic algorithms
- Multitasking
- Optimization
- Parallel processing systems
- Scheduling algorithms
- Homogeneous system
- Multi core
- Multi-level cache architecture
- Parallel computing system
- Performance parameters
- Resource management
- State-of-the-art algorithms
- Scheduling
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas