jr. R.H. Halstead. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....synchronization. This allows declarative concurrency, which is concurrent programming with no observable nondeterminism. The concurrent logic language Strand evolved into the coordination language PCN [34] for imperative languages. In the functional programming community, the futures of Multilisp [39] and the I structures of Id [78] allow to synchronize on the result of a concurrent computation. Both realize a restricted form of logic variable. Finally, the Go#n project [19] uses a first order concurrent constraint language as a coordination language for Haskell processes. The multiparadigm ....

Robert H. Halstead. MultiLisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.

....by the final marking phase. In Section 4.2, we describe techniques to shorten the final marking. 4.1 Support for Multiprocessors Our collector is a concurrent parallel collector like Oheng et al. s[9] it supports multiple collector threads to efficiently exploit multiprocessors. As Halstead [18] has described, tasks of tracing collectors involve parallelism. Our collector exploits the parallelism as follows. threads initial protecting marking termination sweeping check ti me user : GC Figure 1: Overview of a collection cycle in our collector. Collection tasks are done ....

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. ACM Transaction on Programming Languages and Systems, 7(4):501 538, 1985.

....Futures introduced by ByNeed are special in that the associated logic variable is not visible. This encapsulation avoids semantic complications and provides for optimizations. 2 The main applications of by need synchronization are dynamic linking and lazy functions. Halstead s Multilisp [1] provides by need synchronization in the same way we propose it above. Multilisp does not have logic variables and tell operations. 4 Simple and Complex Variables When a variable is created it is always a simple variable. A simple variable becomes complex if it becomes kinded, or if it is ....

H. Halstaedt, Robert. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 1985.

....environment. We further hypothesize that in the future, multicomputer applications will communicate more than current multicomputer applications. This hypothesis is based on two factors: First, if fine grained parallel programming languages such as Id [1] Concurrent Aggregates [6] and Multilisp [20] gain more acceptance, there will be an increased reliance on communication. And second, as massively parallel computers become commonplace, each mode has at least the potential for increased communication (i.e. there are more nodes with which to communicate) But, as Figures 4.2 4.9 indicate, an ....

Robert H. Halstead Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.

....values in a reader method are the ones when the method is invoked; even if some instance variables are modified by the other thread during the execution of a reader method, the modification will not be observed within the reader method. The future invocation is originally proposed in Multilisp[33]. In the context of object oriented languages, ABCL f is the first language that has the future mechanism. writer method. The fourth form ( define method . defines a writer method, which uses the same syntax to the reader methods. A writer method can modify the values of instance variables ....

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. Transactions on Programming Languages and Systems, Vol. 7, No. 4, pp. 501--538, April 1985. 125

....and Physical Processors implemented several different algorithms corresponding to different paradigms of parallelism including: result parallelism, master slave parallelism, and speculative parallelism. We have also implemented several different parallel programming models including: futures [3], first class tuple spaces [6] and engines[4] and compared them using various parallel algorithms that have been implemented in Sting. A report analyzing the relative performance and merits of the various programming models using several different algorithmic paradigms will be forthcoming. The ....

Robert Halstead. Multilisp: A Language for Concurrent Symbolic Computation. Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.

....expressive high level language ideas to the succinct but robust low level interface that ConCert provides. 2 Programming Model We seek to give the developer of grid applications access to the parallelism from within his application in a convenient and simple way. Drawing on Multilisp futures [Hal85] and a similar construct in Cilk NOW [BL97] our primitive notion The ConCert Project is supported by the National Science Foundation under grant ITR SY SI 0121633: Language Technology for Trustless Software Dissemination . on the grid is a task, a piece of code that runs to produce a result. ....

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501-538, October 1985.

....algorithmic work has focused on particularly simple types of computations, such as the backtrack search already discussed. The workstealing idea dates back at least as far as Burton and Sleep s research [20] on parallel exe cution of functional programs and Halstead s implementation of Multilisp [51, 52]. These researchers observed that heuristically, by having each processor work as if it is the only one (i.e. in serial, depth first order) and having idle processors steal threads from others, space requirements and communication requirements should be curbed. Since then, many researchers have ....

....somewhat onerous for the programmer, the decision to break procedures into separate nonsuspending threads with heapallocated closures simplifies the Cilk runtime system. Each Cilk thread runs to completion without suspending and leaves the C runtime stack empty when it dies. A common alternative [22, 47, 52, 63, 77, 81] is to directly support spawn return threads (or procedures) in the runtime system, possibly with stack allocated activation frames. In such a system, threads can suspend waiting for synchronization and leave temporary values on the calling stack. Consequently, this alternative strategy requires ....

[Article contains additional citation context not shown here]

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. ACMTransactions on ProgrammingLanguages and Systems, 7(4):501--538, October 1985.

....expressive high level language ideas to the succinct but robust low level interface that ConCert provides. 2 Programming Model We seek to give the developer of grid applications access to the parallelism from within his application in a convenient and simple way. Drawing on Multilisp futures [Hal85] and a similar construct in Cilk NOW [BL97] our primitive notion The ConCert Project is supported by the National Science Foundation under grant ITR SY SI 0121633: Language Technology for Trustless Software Dissemination . on the grid is a task, a piece of code that runs to produce a result. ....

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.

....There was no problem with muta ble structures; they were handled correctly by the FX effect system and the effects completed indicator. In this section, by using GITA s deferred read mechanism to handle immutable structures, we allow the built in FX allocation procedures to return futures [Hal85], i.e. uninitialized locations that will eventually be filled in. The goal is to expose parallelism in the handling of pointers. Consider a situ ation where procedure A allocates and initializes a structure and then returns it to procedure B. Suppose that procedure B then performs many operations ....

Robert H. Halstead, Multilisp: A Language for Concurrent Symbolic Computation, ACM TOPLAS, pp. 501-538, October 1985.

....the workflow domain expects a return value since the user domain processing takes place asynchronously. The worklist solves this problem by returning a Future object. Future objects provide placeholders for objects whose identity is determined after the future object representing them is created [50]. Other domains that deal with asynchronous components (e.g. distributed computation) have successfully used this technique [1] The workflow framework passes around Future instances like regular application domain objects. However, as soon as the human worker finishes processing the ....

Robert Halstead, Jr. MultiLISP: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7:501--538, October 1985.

....the program threads simultaneously. Instead, each thread cooperates with the collector at its own pace through a mechanism called (soft) handshakes. We remark that another alternative for an adequate garbage collection on a multiprocessor is to perform the collection in parallel (see for example [24, 11, 29, 25, 20, 27]. We do not explore this avenue further in this work. 1.2 Reference counting on a multiprocessor Reference counting is a most intuitive method for automatic storage management. As such, systems using reference count ing were implemented starting from the sixties (c.f. 10] The main idea is ....

Robert H. Halstead. Multilisp: A language for concurrent symbolic computation. ACM TOPLAS, 7(4):501-538, October 1985.

No context found.

jr. R.H. Halstead. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.

No context found.

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.

No context found.

Jr. Robert H. Halstead. Multilisp: a language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems (TOPLAS), 7(4):501--538, 1985.

No context found.

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. In ACM Transactions on Programming Languages and Systems, pages 7(4):501--538, October 1985.

No context found.

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. In ACM Transactions on Programming Languages and Systems, pages 7(4):501--538, October 1985.

No context found.

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. In ACM Transactions on Programming Languages and Systems, pages 7(4):501--538, October 1985.

No context found.

Robert Halstead. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages, October 1985.

No context found.

Robert H. Halstead Jr. Multilisp - a language for concurrent symbolic computation. TOPLAS, 7(4):501--538, 1985.

No context found.

Jr. Robert H. Halstead. Multilisp: a language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems (TOPLAS), 7(4):501--538, 1985.

No context found.

Robert Halstead. Multilisp: A Language for Concurrent Symbolic Computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.

No context found.

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. acm Transactions on Programming Languages and Systems,

No context found.

Robert H. Halstead. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.

No context found.

Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501-538, October 1985.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC