Article

Free access

Simultaneous scheduling and allocation for cost constrained optimal architectural synthesis

Authors:

Catherine H. Gebotys,

Mohamed I. ElmasryAuthors Info & Claims

DAC '91: Proceedings of the 28th ACM/IEEE Design Automation Conference

Pages 2 - 7

https://doi.org/10.1145/127601.127609

Published: 01 June 1991 Publication History

PDF eReader

Abstract

An integer programming (IP) model, which simultaneously schedules and allocates functional units, registers, and busses, is presented for synthesizing cost-constrained globally optimal architectures. This research is important for industry by providing optimal schedules which minimize interconnect costs and interface to analog and asynchronous processes, since these are seen as key to synthesizing high performance architectures. A partially structured tight IP formulation of the architectural synthesis problem provides globally optimal schedules for peicewise linear cost functions, using branch and bound, in execution times faster than previous research. This research breaks new ground by 1. simultaneously scheduling and allocating hardware resources including interconnect, 2. support for asynchronous and analog interfaces, and 3. guaranteeing globally optimal solutions in practical execution times.

References

[1]

P. G. Paulin, "Force Directed Scheduling," IEEE Transactions on CAD, pp. 661-679 (1989).

Google Scholar

[2]

J. Lee, Y. Hsu, and Y. Lift, "A New Integer Linear Programming Formulation for the Scheduling Problem in Data Path Synthesis," ICCAD, (1989).

Google Scholar

[3]

L. Haler and A. Parker, "A Formal Method for the Specification, Analysis, and Design of Register- Transfer Level Digital Logic," IEEE Transactions on CAD, (1983).

Google Scholar

[4]

S. Devadas and A. R. Newton, "Algorithms for Hardware Allocation in Data Path Synthesis," IEEE Transactions on CAD, (1989).

Google Scholar

[5]

Nemhauser and Wolsey, "," in Integer and Combinatorial Optimization, Wiley Interscience (1989).

Digital Library

Google Scholar

[6]

C. H. Gebotys and M. I. Elmasry, "A Global Optimization Approach for Architectural Synthesis~" ICCAD, (Nov 1990).

Google Scholar

[7]

C. H. Gebotys and M. I. Elmasry, "Optimal Synthesis of High Performance Architectures," CICC, (M~y 1991).

Google Scholar

[8]

K. R. Baker, "Introduction to Sequencing and Scheduling," John Wiley g_i Sons, (1974).

Google Scholar

[9]

C. H. Gebotys and M. I. Elmasry, "A Global Optimization Approach for Architectural Synthesis," UW//ICR TechRept, (1991).

Google Scholar

[10]

E.D. Lagnese, "Architectural Partitioning for Systems Level Design of Integrated Circuits," CMUCAD-89-f27, PhD Thesis, (Mar 1989).

Google Scholar

[11]

A. Brooke, D. Kendricke, and A. Meeraus, GAMS Users Manual, Scientific Press (1988).

Google Scholar

Cited By

View all

Lozano RSchulte C(2019)Survey on Combinatorial Register Allocation and Instruction SchedulingACM Computing Surveys10.1145/320092052:3(1-50)Online publication date: 18-Jun-2019
https://dl.acm.org/doi/10.1145/3200920
Lozano RCarlsson MDrejhammar FSchulte C(2012)Constraint-Based Register Allocation and Instruction SchedulingProceedings of the 18th International Conference on Principles and Practice of Constraint Programming - Volume 751410.5555/2969951.2970011(750-766)Online publication date: 8-Oct-2012
https://dl.acm.org/doi/10.5555/2969951.2970011
Lozano RCarlsson MDrejhammar FSchulte C(2012)Constraint-Based Register Allocation and Instruction SchedulingPrinciples and Practice of Constraint Programming10.1007/978-3-642-33558-7_54(750-766)Online publication date: 2012
https://doi.org/10.1007/978-3-642-33558-7_54
Show More Cited By

Index Terms

Simultaneous scheduling and allocation for cost constrained optimal architectural synthesis

Recommendations

Design and implementation of optimal scheduling and heuristic allocation algorithms in high-level synthesis
Optimal Due Date Assignment Without Restriction and Convex Resource Allocation in Group Technology Scheduling
Combinatorial Optimization and Applications
Abstract
We consider a single machine group scheduling problem with convex resource allocation in which the scheduler decides optimal due dates for different jobs under a group technology environment. The jobs are classified into groups in advance due to ... $_{}$ $_{}$
Synthesis and stochastic assessment of cost-optimal schedules

We treat the problem of generating cost-optimal schedules for orders with individual due dates and cost functions based on earliness/tardiness. Orders can run in parallel in a resource-constrained manufacturing environment, where resources are subject ...

Comments

Information & Contributors

Information

Published In

DAC '91: Proceedings of the 28th ACM/IEEE Design Automation Conference

June 1991

783 pages

ISBN:0897913957

DOI:10.1145/127601

Chairman:
A. Richard Newton
Univ. of California, Berkeley

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC91

Sponsor:

SIGDA
IEEE-CS

DAC91: The 28th ACM/IEEE Design Automation Conference

June 17 - 22, 1991

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

58
Total Citations
View Citations
388
Total Downloads

Downloads (Last 12 months)43
Downloads (Last 6 weeks)3

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lozano RSchulte C(2019)Survey on Combinatorial Register Allocation and Instruction SchedulingACM Computing Surveys10.1145/320092052:3(1-50)Online publication date: 18-Jun-2019
https://dl.acm.org/doi/10.1145/3200920
Lozano RCarlsson MDrejhammar FSchulte C(2012)Constraint-Based Register Allocation and Instruction SchedulingProceedings of the 18th International Conference on Principles and Practice of Constraint Programming - Volume 751410.5555/2969951.2970011(750-766)Online publication date: 8-Oct-2012
https://dl.acm.org/doi/10.5555/2969951.2970011
Lozano RCarlsson MDrejhammar FSchulte C(2012)Constraint-Based Register Allocation and Instruction SchedulingPrinciples and Practice of Constraint Programming10.1007/978-3-642-33558-7_54(750-766)Online publication date: 2012
https://doi.org/10.1007/978-3-642-33558-7_54
Kjeldsberg PCatthoor FVerdoolaege SPalkovic MVandecappelle AHu QAas E(2008)Guidance of Loop Ordering for Reduced Memory Usage in Signal Processing ApplicationsJournal of Signal Processing Systems10.1007/s11265-008-0178-653:3(301-321)Online publication date: 1-Dec-2008
https://dl.acm.org/doi/10.1007/s11265-008-0178-6
Hu QVandecappelle AKjeldsberg PCatthoor FPalkovic MLauwereins RMadsen J(2007)Fast memory footprint estimation based on maximal dependency vector calculationProceedings of the conference on Design, automation and test in Europe10.5555/1266366.1266447(379-384)Online publication date: 16-Apr-2007
https://dl.acm.org/doi/10.5555/1266366.1266447
Hu QVandecappelle AKjeldsberg PCatthoor FPalkovic M(2007)Fast Memory Footprint Estimation based on Maximal Dependency Vector Calculation2007 Design, Automation & Test in Europe Conference & Exhibition10.1109/DATE.2007.364621(1-6)Online publication date: Apr-2007
https://doi.org/10.1109/DATE.2007.364621
Cherroun HDarte AFeautrier P(2007) Reservation table scheduling: branch-and-bound based optimization vs . integer linear programming techniques RAIRO - Operations Research10.1051/ro:200703641:4(427-454)Online publication date: 11-Oct-2007
https://doi.org/10.1051/ro:2007036
Cherroun HDarte AFeautrier PGielen G(2006)Scheduling under resource constraints using dis-equationsProceedings of the conference on Design, automation and test in Europe: Proceedings10.5555/1131481.1131777(1067-1072)Online publication date: 6-Mar-2006
https://dl.acm.org/doi/10.5555/1131481.1131777
Mukherjee RMemik S(2006)An integrated approach to thermal management in high-level synthesisIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2006.88640814:11(1165-1174)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/TVLSI.2006.886408
Ramanujam JHong JKandemir MNarayan AAgarwal A(2006)Estimating and reducing the memory requirements of signal processing codes for embedded systemsIEEE Transactions on Signal Processing10.1109/TSP.2005.85508654:1(286-294)Online publication date: 1-Oct-2006
https://dl.acm.org/doi/10.1109/TSP.2005.855086
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Design and implementation of optimal scheduling and heuristic allocation algorithms in high-level synthesis

Optimal Due Date Assignment Without Restriction and Convex Resource Allocation in Group Technology Scheduling

Synthesis and stochastic assessment of cost-optimal schedules

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Design and implementation of optimal scheduling and heuristic allocation algorithms in high-level synthesis

Optimal Due Date Assignment Without Restriction and Convex Resource Allocation in Group Technology Scheduling

Synthesis and stochastic assessment of cost-optimal schedules

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations