Parallel implementation of an efficient microcode compaction algorithm

Authors:
S. Upendra Rao;G. P. Shattacharjee;A. K. Majumdar
Affiliations:
-;-;-
Venue:
ACM SIGMICRO Newsletter
Year:
1986

Citing 4
Cited 0

Parallel graph algorithms

ACM Computing Surveys (CSUR)
An algorithm for local compaction of horizontal microprograms

Information Processing Letters - The British Computer Society workshop series
Efficient parallel algorithms for some graph problems

Communications of the ACM
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A derivation of parallel implementation of an efficient microcode compaction algorithm has been described. The serial algorithm is decomposed into four schedules of computations. Parallelism within a schedule and between the schedules is examined. The time complexity of the parallel implementation is of O(n2) when O(n3 processors are available. This initial attempt may motivate further investigations in designing efficient parallel algorithms for microcode compaction.