Access Restriction

Author Berry, N. ♦ Pangrle, B.M.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1990
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations
Subject Keyword Scheduling algorithm ♦ Control system synthesis ♦ Multiplexing ♦ Processor scheduling ♦ Cost function ♦ Registers ♦ Hardware ♦ Large scale integration ♦ Logic ♦ High level languages
Abstract A new approach is presented for simultaneous scheduling and connectivity binding in a behavioral synthesis system. A branch-and-bound algorithm is applied for scheduling, with connectivity binding performed at each intermediate step. Costs from the connectivity binder are used to direct the search for optimal solutions. This approach allows the program to optimize user defined objectives without any implicit biases, such as trying to achieve the fastest schedule. Some heuristics are presented to estimate the cost of a partially scheduled and bound graph. This helps to prune the search space. The algorithm performance is presented using examples from the literature.<<ETX>>
Description Author affiliation: LSI Logic Corp., Milpitas, CA, USA (Berry, N.)
ISBN 0818620242
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1990-03-12
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 418.61 kB
Page Count 5
Starting Page 78
Ending Page 82

Source: IEEE Xplore Digital Library