A pattern selection algorithm for multi-pattern scheduling

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.

• Type: Conference
• Year: 2006
• Where: IPPS
• Authors: Yuanqing Guo, Cornelis Hoede, Gerard J. M. Smit
• Keywords: Coarse-grained Reconfigurable Architecture, Distributed And Parallel Computing, IPPS 2006, Multi-pattern Scheduling, Multi-pattern Scheduling Algorithm