Development of a Voice Funnel System: Design Report

Rettberg, R. D.; Wyman, Chris; Hunt, Daniel; Hoffman, M. M.; Carvey, P.P.; Hyde, Blake J.; Clark, William W.; Kraley, M.

doi:10.21236/ada075093

Cited by 12 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each processor manipulates various per-processor data structures, such as topof-stack caches, also located in the processor's local memory. Shared data structures (including MCODE programs) reside in a garbage collected heap that is distributed among the memory modules of Concert (the garbage collection ' Multilisp has also been implemented on a 12%processor Butterfly machine [8,46]. It has exhibited speedups beyond those possible on the eight-processor Concert machine, but, due to various differences between Concert and the Butterfly, it needs further tuning.…”

Section: Mcodementioning

confidence: 99%

MULTILISP: a language for concurrent symbolic computation

Halstead

1985

ACM Trans. Program. Lang. Syst.

861

318

View full text Add to dashboard Cite

Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing parallelism. The potential complexity of dealing with side effects in a parallel context is mitigated by the nature of the parallelism constructs and by support for abstract data types: a recommended Multilisp programming style is presented which, if followed, should lead to highly parallel, easily understandable programs.Multilisp is being implemented on the 32-processor Concert multiprocessor; however, it is ultimately intended for use on larger multiprocessors. The current implementation, called Concert Multilisp, is complete enough to run the Multilisp compiler itself and has been run on Concert prototypes including up to eight processors. Concert Multilisp uses novel techniques for task scheduling and garbage collection. The task scheduler helps control excessive resource utilization by means of an unfair scheduling policy; the garbage collector uses a multiprocessor algorithm based on the incremental garbage collector of Baker.

show abstract

Section: Mcodementioning

confidence: 99%

MULTILISP: a language for concurrent symbolic computation

Halstead

1985

ACM Trans. Program. Lang. Syst.

861

318

View full text Add to dashboard Cite

show abstract

“…The BEIN Butterfly [32,33] multiprocessor was chosen for these experiments as it was the only machine available whose characteristics approximate those described above. The BEN Butterfly is a tightly-coupled…”

Section: Choice Of Icnmentioning

confidence: 99%

A multiprocessor implementation of relaxation-based electrical circuit simulation

Deutsch

Newton

1988

Papers on Twenty-Five Years of Electronic Design Automation

View full text Add to dashboard Cite

“…Our emphasis in this paper is on those switch fabrics which incorporate the Fast Packet Switching (FPS) concept [6], [7], [15], [16] as their underlying switching technique to support a wide range of services with different bit rates. We try to categorize and classify them according to their internal fabric structures.…”

Section: Introductionmentioning

confidence: 99%