Efficient Computational Scheduling of Box and Gaussian FIR Filtering for CPU Microarchitecture

Norishige Fukushima, Yoshihiro Maeda, Yuki Kawasaki, Masahiro Nakamura, Tomoaki Tsumura, Kenjiro Sugimoto, Seiichiro Kamata

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

2 Citations (Scopus)

Abstract

In this paper, we propose efficient computational scheduling of box and Gaussian filtering. These filters are fundamental tools and used for various applications. The computational order of the naïve implementations of these FIR filters are O(r^{2}), where r is the kernel radius. A separable implementation reduces the order into O(r) but requires twice times of filtering. A recursive representation dramatically sheds the order into O(1) but also needs twice or more times filtering. The efficient representation curtails the number of arithmetic operations; however, the influence of data I/O for the computational time becomes dominant. In this paper, we optimize the computational scheduling of O(1) box and Gaussian filters to competently utilize cache memory for reducing the computational time of data I/O. Experimental results show that the proposed scheduling has higher computational performance than the conventional implementation.

Original languageEnglish
Title of host publication2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages875-879
Number of pages5
ISBN (Electronic)9789881476852
DOIs
Publication statusPublished - 2019 Mar 4
Event10th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Honolulu, United States
Duration: 2018 Nov 122018 Nov 15

Publication series

Name2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings

Conference

Conference10th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018
CountryUnited States
CityHonolulu
Period18/11/1218/11/15

Fingerprint

Program processors
Scheduling
Cache memory
FIR filters

ASJC Scopus subject areas

  • Information Systems

Cite this

Fukushima, N., Maeda, Y., Kawasaki, Y., Nakamura, M., Tsumura, T., Sugimoto, K., & Kamata, S. (2019). Efficient Computational Scheduling of Box and Gaussian FIR Filtering for CPU Microarchitecture. In 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings (pp. 875-879). [8659674] (2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/APSIPA.2018.8659674

Efficient Computational Scheduling of Box and Gaussian FIR Filtering for CPU Microarchitecture. / Fukushima, Norishige; Maeda, Yoshihiro; Kawasaki, Yuki; Nakamura, Masahiro; Tsumura, Tomoaki; Sugimoto, Kenjiro; Kamata, Seiichiro.

2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 875-879 8659674 (2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings).

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

Fukushima, N, Maeda, Y, Kawasaki, Y, Nakamura, M, Tsumura, T, Sugimoto, K & Kamata, S 2019, Efficient Computational Scheduling of Box and Gaussian FIR Filtering for CPU Microarchitecture. in 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings., 8659674, 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 875-879, 10th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018, Honolulu, United States, 18/11/12. https://doi.org/10.23919/APSIPA.2018.8659674
Fukushima N, Maeda Y, Kawasaki Y, Nakamura M, Tsumura T, Sugimoto K et al. Efficient Computational Scheduling of Box and Gaussian FIR Filtering for CPU Microarchitecture. In 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 875-879. 8659674. (2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings). https://doi.org/10.23919/APSIPA.2018.8659674
Fukushima, Norishige ; Maeda, Yoshihiro ; Kawasaki, Yuki ; Nakamura, Masahiro ; Tsumura, Tomoaki ; Sugimoto, Kenjiro ; Kamata, Seiichiro. / Efficient Computational Scheduling of Box and Gaussian FIR Filtering for CPU Microarchitecture. 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 875-879 (2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings).
@inproceedings{7fc057c1d64245d286fd7c83a3365a8d,
title = "Efficient Computational Scheduling of Box and Gaussian FIR Filtering for CPU Microarchitecture",
abstract = "In this paper, we propose efficient computational scheduling of box and Gaussian filtering. These filters are fundamental tools and used for various applications. The computational order of the na{\"i}ve implementations of these FIR filters are O(r^{2}), where r is the kernel radius. A separable implementation reduces the order into O(r) but requires twice times of filtering. A recursive representation dramatically sheds the order into O(1) but also needs twice or more times filtering. The efficient representation curtails the number of arithmetic operations; however, the influence of data I/O for the computational time becomes dominant. In this paper, we optimize the computational scheduling of O(1) box and Gaussian filters to competently utilize cache memory for reducing the computational time of data I/O. Experimental results show that the proposed scheduling has higher computational performance than the conventional implementation.",
author = "Norishige Fukushima and Yoshihiro Maeda and Yuki Kawasaki and Masahiro Nakamura and Tomoaki Tsumura and Kenjiro Sugimoto and Seiichiro Kamata",
year = "2019",
month = "3",
day = "4",
doi = "10.23919/APSIPA.2018.8659674",
language = "English",
series = "2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "875--879",
booktitle = "2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings",

}

TY - GEN

T1 - Efficient Computational Scheduling of Box and Gaussian FIR Filtering for CPU Microarchitecture

AU - Fukushima, Norishige

AU - Maeda, Yoshihiro

AU - Kawasaki, Yuki

AU - Nakamura, Masahiro

AU - Tsumura, Tomoaki

AU - Sugimoto, Kenjiro

AU - Kamata, Seiichiro

PY - 2019/3/4

Y1 - 2019/3/4

N2 - In this paper, we propose efficient computational scheduling of box and Gaussian filtering. These filters are fundamental tools and used for various applications. The computational order of the naïve implementations of these FIR filters are O(r^{2}), where r is the kernel radius. A separable implementation reduces the order into O(r) but requires twice times of filtering. A recursive representation dramatically sheds the order into O(1) but also needs twice or more times filtering. The efficient representation curtails the number of arithmetic operations; however, the influence of data I/O for the computational time becomes dominant. In this paper, we optimize the computational scheduling of O(1) box and Gaussian filters to competently utilize cache memory for reducing the computational time of data I/O. Experimental results show that the proposed scheduling has higher computational performance than the conventional implementation.

AB - In this paper, we propose efficient computational scheduling of box and Gaussian filtering. These filters are fundamental tools and used for various applications. The computational order of the naïve implementations of these FIR filters are O(r^{2}), where r is the kernel radius. A separable implementation reduces the order into O(r) but requires twice times of filtering. A recursive representation dramatically sheds the order into O(1) but also needs twice or more times filtering. The efficient representation curtails the number of arithmetic operations; however, the influence of data I/O for the computational time becomes dominant. In this paper, we optimize the computational scheduling of O(1) box and Gaussian filters to competently utilize cache memory for reducing the computational time of data I/O. Experimental results show that the proposed scheduling has higher computational performance than the conventional implementation.

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

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

U2 - 10.23919/APSIPA.2018.8659674

DO - 10.23919/APSIPA.2018.8659674

M3 - Conference contribution

T3 - 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings

SP - 875

EP - 879

BT - 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -