No label defined (Q3789053)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4052997
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4052997

      Statements

      0 references
      0 references
      1988
      0 references
      functional languages
      0 references
      functional programs
      0 references
      reduction machines
      0 references
      serial combinators
      0 references
      parallel G-machine
      0 references
      [For the entire collection see Zbl 0638.00034.] One of the main disadvantages of functional languages is the slow execution of functional programs. By choosing and designing the right reduction model (lambda-calculus, combinators, rewrite systems), the right machine architecture (sequential/parallel reduction machines) and by using clever compiling techniques one tries to solve this problem. One of the fastest sequential reduction machines is the G-machine. In this paper we will show how this concept can be extended to a parallel version. The parallelism in this machine will be defined by serial combinators [\textit{P. Hudak} and \textit{B. Goldberg}, Lect. Notes Comput. Sci. 201, 382-399 (1985; Zbl 0568.68018)]. Based on these concepts a simulator is built. This simulator is used to obtain some measurements of the performance and behaviour of the parallel G-machine under various circumstances. It turns out that the amount of parallelism reached is sufficient, while the overhead produced is acceptable. However, the machine architecture simulated is not a very good one.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references