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.
- H. T. Kung: The structure of parallel algoritams. Advances in Computers, Vol-19, Academic Press, PR. 65--112.Google Scholar
- M. J. Quinn and N. Deo: Parallel graph algorithms, Computing Surveys, Vol-16, r, Sep. 1984, pp. 319--348. Google Scholar
Digital Library
- S. Upendra Rao and A. K. Mazumdar: an algorithm for local compaction of horizontal microprograms. Information processing letters, Vol. 22, 1, Jan. 1985, pp. 29--33. Google Scholar
Digital Library
- {References contained text which could not be captured.}Google Scholar
- F. Y. Chin, J. Lam and I-M. Chen: Efficient parallel algorithms for some graph problem, Comm. of ACM, Vol-25, 9, Sep. 1982, pp. 659--685. Google Scholar
Digital Library
- {References contained text which could not be captured.}Google Scholar
- {References contained text which could not be captured.}Google Scholar
- {References contained text which could not be captured.}Google Scholar
- {References contained text which could not be captured.}Google Scholar
- Gosh R. K. and Bhattacharjae G. P.: A parallel search algorithm for directed acyclic graphs, Vol-24, BIT, 1984, pp. 134--150.Google Scholar
- M. Deo: Graphs theory with applications to engineering and computer science, Prentice-hall Inc., 1974 pp. 300. Google Scholar
Digital Library
- {References contained text which could not be captured.}Google Scholar
- {References contained text which could not be captured.}Google Scholar
Index Terms
(auto-classified)Parallel implementation of an efficient microcode compaction algorithm
Recommendations
An efficient parallel heap compaction algorithm
OOPSLA '04We propose a heap compaction algorithm appropriate for modern computing environments. Our algorithm is targeted at SMP platforms. It demonstrates high scalability when running in parallel but is also extremely efficient when running single-threaded on a ...
An efficient parallel heap compaction algorithm
OOPSLA '04: Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsWe propose a heap compaction algorithm appropriate for modern computing environments. Our algorithm is targeted at SMP platforms. It demonstrates high scalability when running in parallel but is also extremely efficient when running single-threaded on a ...
An efficient watershed segmentation algorithm suitable for parallel implementation
ICIP '95: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2An important aspect of designing a parallel algorithm is exploitation of the data locality for minimization of the communication overhead. We propose a reformulation of a global image operation called the watershed transformation. The method is one of ...






Comments