[show abstract][hide abstract] ABSTRACT: An active object is a function that returns a pointer to its
environment when an execution thread is attached to it. This facility of
BaLinda K, a parallel Lisp dialect with an imperative appearance, is
shown to be useful for constructing I/O interfaces and execution control
mechanisms, and has potential as a tool for system program
Algorithms and Architectures for Parallel Processing, 1996. ICAPP '96. 1996 IEEE Second International Conference on; 07/1996
[show abstract][hide abstract] ABSTRACT: An apparently simple program for summing a list of numbers, with parallel tasks spawned to sum sublists, causes some problem with tail recursion and side effects. It can be solved by combining functional result return with task synchronization.
[show abstract][hide abstract] ABSTRACT: BaLinda Lisp is a parallel Lisp dialect employing a shared memory model of parallel processing together with a subset of the Linda tuple space operators. Also included in the design is speculative processing. The aim is to have shared memory multiprocessing with the tuple space acting as the main data structure through which synchronization is done. The result is a flexible programming language. In this paper, we shall describe the design philosophy of BaLinda Lisp, discuss its implementation on three multiprocessing platforms, give examples of programs written in BaLinda Lisp and discuss future work on the language.
[show abstract][hide abstract] ABSTRACT: Six versions of a parallel program for multiplication are presented, and compared in terms of their eeciencies. They illustrate the bottom up and top down methods of pro-gram structure design, and the use of tuplespace and speculative processing in parallel programming. The ideas are also applicable to general ANDOR parallel problems.
[show abstract][hide abstract] ABSTRACT: Linda, a general purpose coordination language, has been used to make a language parallel. Based on a logically shared tuplespace, Linda poses difficulties to be efficiently implemented on a distributed multiprocessor system. This paper reports our approach to solve the problem: processors are divided into groups, and each group has a group manager to provide a local view of global tuplespace, and handles the tuplespace operations incurred by processors within the group. To maintain the consistency and correctness of the Linda tuplespace operations, we propose the algorithms of a group manager. We also implement the algorithms on a network of transputers, and show the experiment results.
Parallel Processing: CONPAR 94 - VAPP VI, Third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6-8, 1994, Proceedings; 01/1994
[show abstract][hide abstract] ABSTRACT: This paper reports the effort made to implement BaLinda Lisp, a parallel Lisp dialecL on Uansputer arrays. BaLinda lisp supports the FUTURE construct to initiate parallel execution threads, speculative constructs to spawn parallel tasks for nxmlts that may be requittxl, and tuple space operations to enforce the proper communication, synchronization, mutual exclusion and shared variable access for parallel tasks. A suite of application programs has been tested on the resulting interpreter and some performance results are presented. The results demonstrate that the interpreter achieves realistic parallelism and provides a high speed symbolic processing environment on transputers.