Abstract
The sequential generator for the Hierarchical Structure Code (HSC) developed by G. Hartmann can be parallelized on a processor farm with an improved run time of a few seconds. To achieve a further improvement we suggest exploitation of its inherently asynchronous, parallel (i.e. concurrent) structure resulting in a concurrent OCCAM-HSC-generator.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Literature
Brookes, S. D., Hoare, C. A. R., Roscoe, A. W.: A Theory of Communicating Sequential Processes. Journal of the ACM, Vol. 31, No. 3, July 1984, pp. 560–599
Hartmann, G.: Recognition of Hierarchically Encoded Images by Technical and Biological Systems. Biological Cybernetics 57, Springer, 1987, pp. 73–84
Milner, R.: Calculi for Synchrony and Asynchrony. Theoretical Computer Science No. 25, pp. 267–310, 1983
Packer, J.: Exploiting Concurrency; A Ray Tracing Example. INMOS Technical Note 7, Bristol 1987
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Priese, L., Rehrmann, V., Schwolle, U. (1989). A Fast Generator for the Hierarchical Structure Code With Concurrent Implementation Techniques. In: Burkhardt, H., Höhne, K.H., Neumann, B. (eds) Mustererkennung 1989. Informatik-Fachberichte, vol 219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75102-8_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-75102-8_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51748-1
Online ISBN: 978-3-642-75102-8
eBook Packages: Springer Book Archive