234 scheduling of 3-2 and 2-1 eliminations for parallel image compositing using non-power-of-two number of processes

Jorji Nonaka, Kenji Ono, Masahiro Fujita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Binary-Swap is a parallel image compositing algorithm based on recursive vector halving and distance doubling, and works efficiently when the number of processes is exactly a power-of-two (2n). Several power-of-two converting approaches for Binary-Swap have been proposed. Among them, the Telescope method, based on the Binary Blocks algorithm, has been shown as the most promising approach. The Telescope method decomposes an entire set of processes into blocks of power-of-two size and merges the smaller blocks into larger blocks in stepwise fashion. This block merging process corresponds to the communication and computational overhead of the conversion, and since it can only merge one block per stage, it becomes inefficient as the number of binary blocks increases. In this paper, we focus on a single-stage conversion method using the 3-2 and 2-1 elimination approaches. The original scheduling method, proposed by Rabenseifner et al., is limited to an odd number of processes since it always schedules a single 3-2 elimination per conversion. Taking into consideration that the 3-2 elimination can be optimized on modern HPC systems, which can overlap the communication and computation, we propose 234 Scheduling for scheduling multiple 3-2 eliminations per conversion. The multiple 3-2 elimination scheduling enlarges the application range by enabling its use on an even number of processes. We evaluated 234 Scheduling applied to Binary-Swap on the K computer, which is a modern parallel HPC system, and confirmed its effectiveness.

Original languageEnglish
Title of host publicationProceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015
EditorsVesna Zeljkovic, Waleed W. Smari
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages421-428
Number of pages8
ISBN (Electronic)9781467378123
DOIs
Publication statusPublished - Sep 2 2015
Event13th International Conference on High Performance Computing and Simulation, HPCS 2015 - Amsterdam, Netherlands
Duration: Jul 20 2015Jul 24 2015

Publication series

NameProceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015

Other

Other13th International Conference on High Performance Computing and Simulation, HPCS 2015
CountryNetherlands
CityAmsterdam
Period7/20/157/24/15

Fingerprint

Elimination
Scheduling
Binary
Swap
Telescopes
Telescope
Block Algorithm
Even number
Odd number
Communication
Parallel Systems
Doubling
Merging
Overlap
Schedule
Entire
Decompose
Range of data

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Modelling and Simulation

Cite this

Nonaka, J., Ono, K., & Fujita, M. (2015). 234 scheduling of 3-2 and 2-1 eliminations for parallel image compositing using non-power-of-two number of processes. In V. Zeljkovic, & W. W. Smari (Eds.), Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015 (pp. 421-428). [7237071] (Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HPCSim.2015.7237071

234 scheduling of 3-2 and 2-1 eliminations for parallel image compositing using non-power-of-two number of processes. / Nonaka, Jorji; Ono, Kenji; Fujita, Masahiro.

Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015. ed. / Vesna Zeljkovic; Waleed W. Smari. Institute of Electrical and Electronics Engineers Inc., 2015. p. 421-428 7237071 (Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nonaka, J, Ono, K & Fujita, M 2015, 234 scheduling of 3-2 and 2-1 eliminations for parallel image compositing using non-power-of-two number of processes. in V Zeljkovic & WW Smari (eds), Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015., 7237071, Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015, Institute of Electrical and Electronics Engineers Inc., pp. 421-428, 13th International Conference on High Performance Computing and Simulation, HPCS 2015, Amsterdam, Netherlands, 7/20/15. https://doi.org/10.1109/HPCSim.2015.7237071
Nonaka J, Ono K, Fujita M. 234 scheduling of 3-2 and 2-1 eliminations for parallel image compositing using non-power-of-two number of processes. In Zeljkovic V, Smari WW, editors, Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 421-428. 7237071. (Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015). https://doi.org/10.1109/HPCSim.2015.7237071
Nonaka, Jorji ; Ono, Kenji ; Fujita, Masahiro. / 234 scheduling of 3-2 and 2-1 eliminations for parallel image compositing using non-power-of-two number of processes. Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015. editor / Vesna Zeljkovic ; Waleed W. Smari. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 421-428 (Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015).
@inproceedings{943892ae4ca24da2a84482dcd80ddf74,
title = "234 scheduling of 3-2 and 2-1 eliminations for parallel image compositing using non-power-of-two number of processes",
abstract = "Binary-Swap is a parallel image compositing algorithm based on recursive vector halving and distance doubling, and works efficiently when the number of processes is exactly a power-of-two (2n). Several power-of-two converting approaches for Binary-Swap have been proposed. Among them, the Telescope method, based on the Binary Blocks algorithm, has been shown as the most promising approach. The Telescope method decomposes an entire set of processes into blocks of power-of-two size and merges the smaller blocks into larger blocks in stepwise fashion. This block merging process corresponds to the communication and computational overhead of the conversion, and since it can only merge one block per stage, it becomes inefficient as the number of binary blocks increases. In this paper, we focus on a single-stage conversion method using the 3-2 and 2-1 elimination approaches. The original scheduling method, proposed by Rabenseifner et al., is limited to an odd number of processes since it always schedules a single 3-2 elimination per conversion. Taking into consideration that the 3-2 elimination can be optimized on modern HPC systems, which can overlap the communication and computation, we propose 234 Scheduling for scheduling multiple 3-2 eliminations per conversion. The multiple 3-2 elimination scheduling enlarges the application range by enabling its use on an even number of processes. We evaluated 234 Scheduling applied to Binary-Swap on the K computer, which is a modern parallel HPC system, and confirmed its effectiveness.",
author = "Jorji Nonaka and Kenji Ono and Masahiro Fujita",
year = "2015",
month = "9",
day = "2",
doi = "10.1109/HPCSim.2015.7237071",
language = "English",
series = "Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "421--428",
editor = "Vesna Zeljkovic and Smari, {Waleed W.}",
booktitle = "Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015",
address = "United States",

}

TY - GEN

T1 - 234 scheduling of 3-2 and 2-1 eliminations for parallel image compositing using non-power-of-two number of processes

AU - Nonaka, Jorji

AU - Ono, Kenji

AU - Fujita, Masahiro

PY - 2015/9/2

Y1 - 2015/9/2

N2 - Binary-Swap is a parallel image compositing algorithm based on recursive vector halving and distance doubling, and works efficiently when the number of processes is exactly a power-of-two (2n). Several power-of-two converting approaches for Binary-Swap have been proposed. Among them, the Telescope method, based on the Binary Blocks algorithm, has been shown as the most promising approach. The Telescope method decomposes an entire set of processes into blocks of power-of-two size and merges the smaller blocks into larger blocks in stepwise fashion. This block merging process corresponds to the communication and computational overhead of the conversion, and since it can only merge one block per stage, it becomes inefficient as the number of binary blocks increases. In this paper, we focus on a single-stage conversion method using the 3-2 and 2-1 elimination approaches. The original scheduling method, proposed by Rabenseifner et al., is limited to an odd number of processes since it always schedules a single 3-2 elimination per conversion. Taking into consideration that the 3-2 elimination can be optimized on modern HPC systems, which can overlap the communication and computation, we propose 234 Scheduling for scheduling multiple 3-2 eliminations per conversion. The multiple 3-2 elimination scheduling enlarges the application range by enabling its use on an even number of processes. We evaluated 234 Scheduling applied to Binary-Swap on the K computer, which is a modern parallel HPC system, and confirmed its effectiveness.

AB - Binary-Swap is a parallel image compositing algorithm based on recursive vector halving and distance doubling, and works efficiently when the number of processes is exactly a power-of-two (2n). Several power-of-two converting approaches for Binary-Swap have been proposed. Among them, the Telescope method, based on the Binary Blocks algorithm, has been shown as the most promising approach. The Telescope method decomposes an entire set of processes into blocks of power-of-two size and merges the smaller blocks into larger blocks in stepwise fashion. This block merging process corresponds to the communication and computational overhead of the conversion, and since it can only merge one block per stage, it becomes inefficient as the number of binary blocks increases. In this paper, we focus on a single-stage conversion method using the 3-2 and 2-1 elimination approaches. The original scheduling method, proposed by Rabenseifner et al., is limited to an odd number of processes since it always schedules a single 3-2 elimination per conversion. Taking into consideration that the 3-2 elimination can be optimized on modern HPC systems, which can overlap the communication and computation, we propose 234 Scheduling for scheduling multiple 3-2 eliminations per conversion. The multiple 3-2 elimination scheduling enlarges the application range by enabling its use on an even number of processes. We evaluated 234 Scheduling applied to Binary-Swap on the K computer, which is a modern parallel HPC system, and confirmed its effectiveness.

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

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

U2 - 10.1109/HPCSim.2015.7237071

DO - 10.1109/HPCSim.2015.7237071

M3 - Conference contribution

AN - SCOPUS:84948407928

T3 - Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015

SP - 421

EP - 428

BT - Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015

A2 - Zeljkovic, Vesna

A2 - Smari, Waleed W.

PB - Institute of Electrical and Electronics Engineers Inc.

ER -