An Efficient Solver for Scheduling Problems on a Class of Discrete Event Systems Using CELL/B.E. Processor

Hiroyuki Goto,Atsushi Kawaminami

doi:10.1109/isda.2009.16

An Efficient Solver for Scheduling Problems on a Class of Discrete Event Systems Using CELL/B.E. Processor

Hiroyuki Goto, Atsushi Kawaminami

https://doi.org/10.1109/isda.2009.16

Copy DOI

Publication Date: Jan 1, 2009

Citations: 6

Affiliation: Nagaoka University of Technology

#Class Of Discrete Event Systems #CELL Broadband Engine + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

This research implements an efficient solver for scheduling problems in a class of repetitive discrete event systems using a CELL/B.E. (CELL Broadband Engine). The essence of this involves efficiently computing the transition matrix of a system whose precedence constraints regarding the execution sequence of jobs can be described by a weighted DAG (Directed Acyclic Graph). This means solving the longest path problem efficiently for all pairs of source and destination nodes. For the first step towards a high-speed computation, we utilize SIMD (Single Instruction Multiple Data) functions.

Full Text