Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration

Masato Edahiro

doi:10.1109/ASPDAC.2009.4796485

Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration

Masato Edahiro^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

17 Citations (Scopus)

Abstract

Fundamental algorithms should be parallelized to accelerate EDA software on multi-core architecture. In this paper, we introduce scalable algorithms that have scalability on multi-cores. As an example, a sorting algorithm, called Map Sort, is presented. This algorithm uses a map from subsets of input data to intervals on data range. Experimental results show that, in comparison with quick sort on a single CPU, processing time of Map Sort is comparable on a CPU and three times faster on four CPUs.

Original language	English
Title of host publication	Proceedings of the ASP-DAC 2009
Subtitle of host publication	Asia and South Pacific Design Automation Conference 2009
Pages	230-233
Number of pages	4
DOIs	https://doi.org/10.1109/ASPDAC.2009.4796485
Publication status	Published - 2009
Externally published	Yes
Event	Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009 - Yokohama, Japan Duration: 2009 Jan 19 → 2009 Jan 22

Publication series

Name	Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Conference

Conference	Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009
Country/Territory	Japan
City	Yokohama
Period	09/1/19 → 09/1/22

ASJC Scopus subject areas

Computer Science Applications
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering

Access to Document

10.1109/ASPDAC.2009.4796485

Cite this

Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration. / Edahiro, Masato.

Proceedings of the ASP-DAC 2009: Asia and South Pacific Design Automation Conference 2009. 2009. p. 230-233 4796485 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Edahiro, M 2009, Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration. in Proceedings of the ASP-DAC 2009: Asia and South Pacific Design Automation Conference 2009., 4796485, Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, pp. 230-233, Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009, Yokohama, Japan, 09/1/19. https://doi.org/10.1109/ASPDAC.2009.4796485

@inproceedings{99948725a3994bd980e074ad1b1301e7,

title = "Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration",

abstract = "Fundamental algorithms should be parallelized to accelerate EDA software on multi-core architecture. In this paper, we introduce scalable algorithms that have scalability on multi-cores. As an example, a sorting algorithm, called Map Sort, is presented. This algorithm uses a map from subsets of input data to intervals on data range. Experimental results show that, in comparison with quick sort on a single CPU, processing time of Map Sort is comparable on a CPU and three times faster on four CPUs.",

author = "Masato Edahiro",

year = "2009",

doi = "10.1109/ASPDAC.2009.4796485",

language = "English",

isbn = "9781424427482",

series = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",

pages = "230--233",

booktitle = "Proceedings of the ASP-DAC 2009",

note = "Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009 ; Conference date: 19-01-2009 Through 22-01-2009",

}

TY - GEN

T1 - Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration

AU - Edahiro, Masato

PY - 2009

Y1 - 2009

N2 - Fundamental algorithms should be parallelized to accelerate EDA software on multi-core architecture. In this paper, we introduce scalable algorithms that have scalability on multi-cores. As an example, a sorting algorithm, called Map Sort, is presented. This algorithm uses a map from subsets of input data to intervals on data range. Experimental results show that, in comparison with quick sort on a single CPU, processing time of Map Sort is comparable on a CPU and three times faster on four CPUs.

AB - Fundamental algorithms should be parallelized to accelerate EDA software on multi-core architecture. In this paper, we introduce scalable algorithms that have scalability on multi-cores. As an example, a sorting algorithm, called Map Sort, is presented. This algorithm uses a map from subsets of input data to intervals on data range. Experimental results show that, in comparison with quick sort on a single CPU, processing time of Map Sort is comparable on a CPU and three times faster on four CPUs.

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

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

U2 - 10.1109/ASPDAC.2009.4796485

DO - 10.1109/ASPDAC.2009.4796485

M3 - Conference contribution

AN - SCOPUS:64549087560

SN - 9781424427482

T3 - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

SP - 230

EP - 233

BT - Proceedings of the ASP-DAC 2009

T2 - Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009

Y2 - 19 January 2009 through 22 January 2009

ER -

Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this