Abstract
Of the parallel systems currently available, far and away the most common are loosely coupled collections of conventional processors, and this is likely to remain true for some time. By loosely coupled I mean that the processors do not share memory, so that some form of stream or message-passing protocol is required for processor-processor communication. It follows that in most cases the programmer must make explicit appeal to communication primitives in the construction of software which exploits the available parallelism. Even in shared-memory systems, the absence of parallel constructs from available programming languages may mean that appeal to a similar communication model may be necessary, at least in the short term.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Thompson, H. S. (1983). MCHART: A flexible, modular, chart parsing system. Proceedings of the National Conference on Artificial Intelligence (pp. 408–410). Washington, D.C.: AAAI Press.
Thompson, H. S., Crowe, A., & Roberts, G. (in press). Termination and synchronisation in distributed event systems.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Thompson, H.S. (1991). Chart Parsing for Loosely Coupled Parallel Systems. In: Tomita, M. (eds) Current Issues in Parsing Technology. The Springer International Series in Engineering and Computer Science, vol 126. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3986-5_15
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3986-5_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6781-9
Online ISBN: 978-1-4615-3986-5
eBook Packages: Springer Book Archive