Local Microcode Compaction Techniques
David Landskov, Scott Davidson, Bruce D. Shriver et al. · ACM Computing Surveys · 1980
article Free Access Share on Local Microcode Compaction Techniques Authors: David Landskov University of Southwestern Louisiana, Computer Science Department, P.O. Box 44330 U.S.L., Lafayette, Louisiana University of Southwestern Louisiana, Computer Science Department, P.O. Box 44330 U.S.L., Lafayette, LouisianaView Profile , Scott Davidson University of Southwestern Louisiana, Computer Science Department, P.O. Box 44330 U.S.L., Lafayette, Louisiana University of Southwestern Louisiana, Computer Science Department, P.O. Box 44330 U.S.L., Lafayette, LouisianaView Profile , Bruce Shriver University of Southwestern Louisiana, Computer Science Department, P.O. Box 44330 U.S.L., Lafayette, Louisiana University of Southwestern Louisiana, Computer Science Department, P.O. Box 44330 U.S.L., Lafayette, LouisianaView Profile , Patrick W. Mallett Computer Sciences Corporation, 6565 Arlington Boulevard, Falls Church, Virginia Computer Sciences Corporation, 6565 Arlington Boulevard, Falls Church, VirginiaView Profile Authors Info & Claims ACM Computing SurveysVolume 12Issue 3Sept. 1980 pp 261–294https://doi.org/10.1145/356819.356822Published:01 September 1980Publication History 246citation843DownloadsMetricsTotal Citations246Total Downloads843Last 12 Months43Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cited by 254 works. doi:10.1145/356819.356822
Authors
References
- Computer and job-shop scheduling theory
- A comparison of list schedules for parallel processing systems
- Polynomial complete scheduling problems
- Deterministic Processor Scheduling
- An introduction to the general theory of algorithms
- The Organization of Microprogram Stores
- Methods of compacting microprograms
- A High-Level Language for Horizontal Microprogramming
- Optimization Strategies for Microprograms
- The Identification of Maximal Parallelism in Straight-Line Microprograms