Parallel symbolic processing-can it be done?

Author

Sodan, Angela

Author_Institution

GMD Inst. for Comput. Archit. & Software Technol., Berlin, Germany

fYear

1993

fDate

20-23 Sep 1993

Firstpage

24

Lastpage

25

Abstract

My principle answer is: yes, but it depends. Parallelization of symbolic applications is possible, but only for certain classes of applications. Distributed memory may prevent parallelization in some cases where the relation of computation and communication overhead becomes too high, but also may be an advantage when applications require much garbage collection, which can then be done in a distributed way. There are also some applications which have a higher degree of parallelism than can be supported by shared memory, and so are candidates for profiting by massively parallel architectures

Keywords

parallel processing; symbol manipulation; applications; communication overhead; computation overhead; distributed memory; garbage collection; massively parallel architectures; parallel symbolic processing; parallelism; parallelization; shared memory; Application software; Computer architecture; Costs; Data structures; Electronic mail; Load management; Memory architecture; Parallel processing; Service oriented architecture; Virtual prototyping;

fLanguage

English

Publisher

ieee

Conference_Titel

Programming Models for Massively Parallel Computers, 1993. Proceedings

Conference_Location

Berlin

Print_ISBN

0-8186-4900-3

Type

conf

DOI

10.1109/PMMP.1993.315558

Filename

315558