A pattern selection algorithm for multi-pattern scheduling

Authors:
Yuanqing Guo;Cornelis Hoede;Gerard J. M. Smit
Affiliations:
Faculty of EEMCS, University of Twente, Enschede, The Netherlands;Faculty of EEMCS, University of Twente, Enschede, The Netherlands;Faculty of EEMCS, University of Twente, Enschede, The Netherlands
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 4
Cited 1

On the Complexity of Scheduling Problems for Parallel/Pipelined Machines

IEEE Transactions on Computers
Algorithms for High-Level Synthesis

IEEE Design & Test
Introduction to the Scheduling Problem

IEEE Design & Test
A Flexible and Energy-Efficient Coarse-Grained Reconfigurable Architecture for Mobile Systems

The Journal of Supercomputing

EPIMap: using epimorphism to map applications on CGRAs

Proceedings of the 49th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns. This paper presents a method to select a near-optimal set of patterns. By using these patterns, the multi-pattern scheduling will result in a better schedule in the sense that the schedule will have fewer clock cycles.