Abstract
Structures based on tuples may be used to represent the common bulk data types found in symbolic applications. Few languages support primitive operations that handle such structures explicitly, and fewer support them as persistent objects. Even when relevant data types are accommodated at the language level, implementations are very inefficient because of the lack of underlying systems architecture support. The result is over-complex software and missed opportunities to exploit the inherent data-parallelism present in these structures. In this paper we propose a representational framework, a repertoire of primitive operations, and a systems architecture for handling the bulk data types relevant to (deductive) databases and knowledge-based applications. We indicate the opportunities for exploiting inherent parallelism, and briefly report on prototype novel parallel hardware which supports the structure primitives.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. A. Wall and P. Trinder, ‘Towards a Theory of Bulk Types'. ESPRIT FIDE (BRA 3070) Technical Report 91/26, University of Glasgow, 1991.
W.D. Hillis, ‘The Connection Machine'. The MIT Press, 1987.
S.J. Stalfo and D.P. Miranker, ‘DADO: A Parallel Processor for Expert Systems'. Proc. IEEE Conf. on Parallel Processing, 1984, pages 92–100.
G. Marino, G. Succi, ‘Data Structures for Parallel Execution of Functional Languages'. Proc. of PARLE '89, Eindhoven, LNCS 366, pp. 346–356
R.B.K. Dewar, E. Schonberg, J.T. Schwartz, ‘High-Level Programming — An Introduction to the Programming Language SETL’ Courant Institute of Math. Sciences, New York, 1983.
P. Watson and P Townsend, ‘The EDS Parallel Relational Database System'. Published in Parallel Database Systems, the proceedings of the 1990 PRISMA Workshop. Springer-Verlag, 1991, LNCS 503, pages 149–166.
B. Goldberg, ‘Multiprocessor Execution of Functional Programs', International Journal of Parallel Computing, Vol. 17, No. 5, pages 425–473, 1988.
Arvind, R.S. Nikhil, K.K. Pingali, ‘I-Structures: Data Structures for Parallel Computing'. MIT LCS (CSG Memo 269), Cambridge, Mass. Feb 1987.
Persistent Programming Research Group ‘PS_algol Reference Manual', Fourth Edition, Persistent Programming Research Report No. 12. Department of Computing Science, University of Glasgow and Department of Computational Science, University of St. Andrews 1987.
S H Lavington, M Standring, Y J Jiang, C J Wang and M E Waite, “Hardware Memory Management for Large Knowledge Bases”. Proceedings of PARLE, the Conference on Parallel Architectures and Languages Europe, Eindhoven, June 1987, pages 226–241. (Published by Springer-Verlag as Lecture Notes in Computer Science, Nos. 258 & 259).
J. Page, ‘High Performance Database for Client/server Systems'. UNICOM Seminar on Commercial Parallel Processing, London, June 1990, pages 21–42.
I. Robinson, ‘A Prolog Processor Based on a Pattern Matching Memory Device'. Proceedings Third Int. Conf. on Logic Programming, London, 1986, pages 172–179. (Springer-Verlag, LNCS 225).
C J Wang and S H Lavington, 'sIMD Parallelism for Symbol Mapping'. Proceedings of the International Workshop on VLSI for Artificial Intelligence and Neural Networks, Oxford, September 1990, pages C38–C51.
J Robinson and S H Lavington, “A Transitive Closure and Magic Functions Machine”. Proceedings of the Second International Symposium on Databases in Parallel and Distributed Systems Dublin, July 1990, pages 44–54 (IEEE Computer Society Press).
S H Lavington, “Technical Overview of the Intelligent File Store”. KnowledgeBased Systems, Vol.1, No.3, June 1988, pages 166–172.
S H Lavington, J M Emby, A J Marsh, E E James and M J Lear, “A Modularly Extensible Scheme for Exploiting Data Parallelism”. Presented at the Third International Conference on Transputer Applications, Glasgow, 1991. Published in Applications of Transputers 3, IOS Press, 1991, pages 620–625.
H. Walther ‘Performance Measurement of the Associative Memory IFS at the Artifical Intelligence Applications Institute at Edinburgh, 13th November 1989-24th November 1989'. UBILAB Report 2/89, February 1989, Union Bank of Switzerland, Zurich.
M. Atkinson, C. Lecluse, P. Philbrow and P. Richard, “Maps as Bulk Types for Database Programming Languages”. Proceedings of the Annual ESPRIT Conference, Brussels, November 1991. CEC Publication EUR 13853 EN, pages 731–758.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lavington, S.H., Waite, M.E., Robinson, J., Dewhurst, N.E.J. (1992). Exploiting parallelism in primitive operations on bulk data types. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_131
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_131
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive