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

Authors:
Hiroyuki Goto;Atsushi Kawaminami
Affiliations:
-;-
Venue:
ISDA '09 Proceedings of the 2009 Ninth International Conference on Intelligent Systems Design and Applications
Year:
2009

Citing 0
Cited 1

High-speed computation of the Kleene star in max-plus algebra using a cell broadband engine

ACE'10 Proceedings of the 9th WSEAS international conference on Applications of computer engineering

Quantified Score

Hi-index	0.00

Visualization

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.