Reference Hub1
Analysis of Inner-Loop Mapping onto Coarse-Grained Reconfigurable Architectures Using Hybrid Particle Swarm Optimization

Analysis of Inner-Loop Mapping onto Coarse-Grained Reconfigurable Architectures Using Hybrid Particle Swarm Optimization

Rani Gnanaolivu, Theodore S. Norvell, Ramachandran Venkatesan
Copyright: © 2011 |Volume: 2 |Issue: 2 |Pages: 19
ISSN: 1947-9344|EISSN: 1947-9352|EISBN13: 9781613508800|DOI: 10.4018/joci.2011040102
Cite Article Cite Article

MLA

Gnanaolivu, Rani, et al. "Analysis of Inner-Loop Mapping onto Coarse-Grained Reconfigurable Architectures Using Hybrid Particle Swarm Optimization." IJOCI vol.2, no.2 2011: pp.17-35. http://doi.org/10.4018/joci.2011040102

APA

Gnanaolivu, R., Norvell, T. S., & Venkatesan, R. (2011). Analysis of Inner-Loop Mapping onto Coarse-Grained Reconfigurable Architectures Using Hybrid Particle Swarm Optimization. International Journal of Organizational and Collective Intelligence (IJOCI), 2(2), 17-35. http://doi.org/10.4018/joci.2011040102

Chicago

Gnanaolivu, Rani, Theodore S. Norvell, and Ramachandran Venkatesan. "Analysis of Inner-Loop Mapping onto Coarse-Grained Reconfigurable Architectures Using Hybrid Particle Swarm Optimization," International Journal of Organizational and Collective Intelligence (IJOCI) 2, no.2: 17-35. http://doi.org/10.4018/joci.2011040102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Coarse-Grained Reconfigurable Architectures (CGRAs) have gained currency in recent years due to their abundant parallelism and flexibility. To utilize the parallelism found in CGRAs, this paper proposes a fast and efficient Modulo-Constrained Hybrid Particle Swarm Optimization (MCHPSO) scheduling algorithm to exploit loop-level parallelism in applications. This paper shows that Particle Swarm Optimization (PSO) is capable of software pipelining loops by overlapping placement, scheduling and routing of successive loop iterations and executing them in parallel. The proposed algorithm has been experimentally validated on various DSP benchmarks under two different architecture configurations. These experiments indicate that the proposed MCHPSO algorithm can find schedules with small initiation intervals within a reasonable amount of time. The MCHPSO scheduling algorithm was analyzed with different topologies and Functional Unit (FU) configurations. The authors have tested the parallelizability of the algorithm and found that it exhibits a nearly linear speedup on a multi-core CPU.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.