A Customized Communication Subsystem for FT-ÂLinda
Distributed fault-tolerant systems usually impose much stronger requirements on the underlying communication protocols than do applications developed without fault-tolerance in mind. That is true, for example, of applications composed of processes replicated on multiple hosts, where all replicas must keep the same view of the state of the communication. This paper describes how the communication substrate for a specific application with strong communication requirements was developed.
Adaptive Load Sharing in Homogeneous Distributed Systems
| Authors |
Derek L. Eager, Edward D. Lazowska, John Zahorjan |
| Type |
Journal Article |
| Publication |
IEEE Transactions on Software Engineering |
| Volume |
SEÂ12 |
| Issue |
5 |
| Pages |
662ÂÂ-675 |
| Date |
1986 |
| ISSN |
0098-5589 |
Adaptiveness in LindaÂ-based Coordination Models
Adaptive Parallelism and Piranha
Desktop computers are idle much of the time. Ongoing trends make aggregate LAN “waste”–idle compute cycles–an increasingly attractive target for recycling. Piranha, a software implementation of adaptive parallelism, allows these waste cycles to be recaptured by putting them to work running parallel applications. Most parallel processing is static: Programs execute on a fixed set of processors throughout a computation. Adaptive parallelism allows for dynamic processor sets, which means that the number of processors working on a computation may vary, depending on availability. With adaptive parallelism, instead of parceling out jobs to idle workstations, a single job is distributed over many workstations. Adaptive parallelism is potentially valuable on dedicated multiprocessors as well, particularly on massively parallel processors. One key Piranha advantage is that task descriptors, not processes, are the basic movable, remappable computation unit. The task descriptor approach supports strong heterogeneity. A process image representing a task in midcomputation can’t be moved to a machine of a different type, but a task descriptor can be. Thus, a task begun on a Sun computer can be completed by an IBM machine. The authors show that adaptive parallelism has the potential to integrate heterogeneous platforms seamlessly into a unified computing resource and to permit more efficient sharing of traditional parallel processors than is possible with current systems.
| Authors |
Nicholas Carriero, Eric Freeman, David Gelernter, David Kaminsky |
| Type |
Journal Article |
| Publication |
Computer |
| Volume |
28 |
| Issue |
1 |
| Pages |
40-49 |
| Date |
1995 |
| DOI |
10.1109/2.362631 |
| ISSN |
0018-9162 |
| Repository |
ACM |
Addendum to “Optimising the Linda in primitive: Understanding tuple-space run-times” presented at SAC’2000
Adding FaultÂ-tolerant Transaction Processing to LINDA
A Distributed and Recoverable Linda Implementation with Prolog&Co
A distributed LindaÂlike kernel for PVM
A Distributed Typeserver and Protocol for a Linda Tuple Space
| Author |
James Pinakis |
| Type |
Report |
| Report Type |
Technical Report |
| Place |
Nedlands, 6009, Western Australia |
| Date |
19?? |
A Fault-ÂTolerant {GEQRNS} Processing Element for Linear Systolic Array {DSP} Applications
A Fault-Tolerant Network Kernel For Linda
An adaptive communications protocol for network computers (extended abstract)
A network computer is a collection of computers designed to function as one machine. On a network computer, as opposed to a multiprocessor, constituent subcomputers are memory-disjoint and communicate only by some form of message exchange. Ensemble architectures like multiprocessors and network computers are of growing interest because of their capacity to support parallel programs, where a parallel program is one that is made up of many simultaneously-active, communicating processes. Parallel programs should, on an appropriate architecture, run faster than sequential programs, and, indeed, good speed-ups have been reported in parallel programming experiments in several domains, amongst which are AI, numerical problems, and system simulation. Our interest lies in network computers, particularly ones that range in size from several hundred nodes to several thousand. Network computers may be organized in either of two basic ways: their nodes may communicate over a shared bus (or series of buses), as in S/Net; or over point-to-point links, as in Cosmic Cube and the Transputer Network. The work to be presented deals with the point-to-point class, the elements of which we shall refer to as “linked networksâ€. Linked networks face a fundamental communication problem. Unless they are completely connected (which is rarely possible), two communicating nodes will not necessarily be connected by a single link. Messages between nodes must therefore, in general, travel over several links and be processed by several intermediate nodes. Communication delays increase with the length of the traveled path. Network computer designers therefore provide networks the diameters of which are small relative to their size, and network operating systems will attempt to place communicating processes as close to each other as possible. We present a communication protocol for linked networks that was designed specifically for network computers. Staged Circuit Switching is a communication protocol that combines aspects of store-and-forwarding with aspects of circuit switching, where circuit switching refers to the class of protocols in which a communicating source and destination first construct a dedicated path or circuit between them, then communicate directly over this path. The path may be a physical connection, as in spaced-switched circuit-switching, or a series of dedicated slots in time-division multiplexing switches, as in time-switching protocols. The stage-circuit-switching design is strongly related to spaced-switched circuit-switching and encompasses both the protocol itself and a communication architecture to support it. In staged circuit switching, each message constructs for itself the longest physical circuit that it can without waiting for links. When a message is to be sent, a header that records the message’s source and destination is sent propagating through the network towards the destination node; the header seizes each free link along its path and incorporates it into a growing circuit. When it meets a busy link, or arrives at its destination, circuit building stops, the message’s data portion is transmitted and acknowledged over the existing circuit, and the circuit is released. A message that has not arrived at its destination then gathers itself together and plunges onward in the same fashion. In an empty network then, staged circuit switching is the same as circuit switching: each message is transmitted over a direct circuit from source to destination. In a heavily loaded network, it is the same as store-and-forwarding: each next-link is busy, each circuit is therefore only one link long, and the message proceeds hop by hop. The protocol combines the speed benefits of circuit switching at light traffic loads, with the high bandwidth advantages of store-and-forwarding at heavy loads. We have carried out extensive simulation studies to evaluate the dynamics of staged circuit switching from the point of view of message delays, throughput, circuit lengths, efficiency, implementation, and so on. The studies were implemented in the context of a toroidal topology of diameter 32, yielding a 1024-node network. Uniform source-to-destination distributions were used. Both the topology and the source-to-destination distributions are analyzed. An analysis of network saturation based on mean values is also given. Staged circuit switching unambiguously emerges as a strong protocol with superior performance characteristics than either classical store-and-forwarding or circuit switching, particularly with regards to adaptability to varying network loads and in providing a consistently high effective network bandwidth. On the basis of our results the protocol is proposed as a suitable candidate for linked networks. Its attractiveness is further enhanced by its potential ability to continually reconfigure the network dynamically at runtime to optimize for observed traffic patterns. Heavily-used circuits may be left in place over longer periods than a single message transmission. In this way, the system constantly rearranges the network topology in order to bring heavily-communicating distant nodes closer together, thereby acting as a “communication cacheâ€. A “cache hit†would correspond to finding the desired destination node one hop away from a given source. Effective exploitation of this capability is the subject of ongoing research.
An Approach to Fault-ÂTolerant Parallel Processing on Intermittently Idle, Heterogeneous Workstations
| Authors |
Karpjoo Jeong, Dennis Shasha, Surendranath Talla, Peter Wyckof |
| Type |
Conference Paper |
| Date |
1997 |
| Proceedings Title |
Symposium on ℉aultÂTolerant Computing |
| Pages |
11Â20 |
| URL |
http://citeseer.ist.psu.edu/jeong97approach.html |
| Repository |
CiteSeer |
An Efficient Distributed Tuple Space Implementation for Networks of Workstations
| Authors |
A. Rowstron, A. Wood |
| Editors |
L. Bouge, P. Fraigniaud, A. Mignotte, Y. Robert |
| Type |
Conference Paper |
| Date |
1996 |
| Proceedings Title |
EuroPar 96 |
| Publisher |
SpringerÂVerlag, Berlin |
| Volume |
1123 |
| Pages |
511ÂÂ513 |
| URL |
http://citeseer.ist.psu.edu/rowstron96efficient.html |
| Repository |
CiteSeer |
A New Approach to Scalable LindaÂsystems Based on Swarms
An implementation of Linda for a NUMA machine
An Informal Operational Semantics of CÂLinda V2.3.5
| Author |
James E. Narem |
| Type |
Report |
| Report Number |
YALEU/DCS/TRÂ839 |
| Report Type |
Technical Report |
| Place |
New Haven |
| Date |
1989 |
A performance analysis of distributed algorithms in JavaSpaces, CORBA services and WEB services
| Author |
Suresh Sunku |
| Type |
Thesis |
| University |
University of North Florida |
| Date |
2003 |
Applications experience with Linda
We describe three experiments using C-Linda to write parallel codes. The first involves assessing the similarity of DNA sequences. The results demonstrate Linda’s flexibility—Linda solutions are presented that work well at two quite different levels of granularity. The second uses a prime finder to illustrate a class of algorithms that do not (easily) submit to automatic parallelizers, but can be parallelized in straight-forward fashion using C-Linda. The final experiment describes the process lattice model, an “inherently†parallel application that is naturally conceived as multiple interacting processes. Taken together, the experience described here bolsters our claim that Linda can bridge the gap between the growing collection of parallel hardware and users eager to exploit parallelism. This work is supported by the NSF under grants DCR-8601920 and DCR-8657615 and by the ONR under grant N00014-86-K-0310. We are grateful to Argonne National Labs for providing access to a Sequent Symmetry.
| Authors |
Nicholas Carriero, David Gelernter |
| Type |
Conference Paper |
| Date |
1988 |
| Proceedings Title |
Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems |
| Place |
New Haven, Connecticut, United States |
| Publisher |
ACM |
| Pages |
173-187 |
| DOI |
10.1145/62115.62132 |
| ISBN |
0-89791-276-4 |
| URL |
http://doi.acm.org/10.1145/62115.62132 |
| Repository |
ACM |
A process algebraic view of Linda coordination primitives
| Authors |
Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro |
| Type |
Journal Article |
| Publication |
Theoretical Computer Science |
| Volume |
192 |
| Issue |
2 |
| Pages |
167-ÂÂ199 |
| Date |
1998 |
| URL |
http://citeseer.ist.psu.edu/busi98process.html |
| Repository |
CiteSeer |
A Program Building Tool for Parallel Applications
| Authors |
S. Ahmed, N. Carriero, D. Gelernter |
| Editors |
G. Blelloch, others |
| Type |
Conference Paper |
| Date |
1994 |
| Proceedings Title |
Speciï¬cation of Parallel Algorithms (DIMACS Workshop) |
| Volume |
18 |
| Pages |
161ÂÂ178 |
| URL |
http://citeseer.ist.psu.edu/ahmed94program.html |
| Repository |
CiteSeer |
A rendezvous with Linda
A Simulation Tool for the Performance Evaluation of Parallel Branch and Bound Algorithms
| Authors |
Arie de Bruin, Alexander H. G. Rinnooy Kan |
| Type |
Journal Article |
| Publication |
Mathematical Programming |
| Volume |
42 |
| Pages |
245ÂÂ271 |
| Date |
1988 |
A Truly Concurrent view of Linda Interprocess Communication
| Authors |
N. Busi, R. Gorrieri, G. Zavattaro |
| Type |
Report |
| Report Number |
UBLCS-97-02 |
| Report Type |
Technical Report |
| Institution |
University of Bologna |
| Date |
February 1997 |
| URL |
http://citeseer.ist.psu.edu/busi97truly.html |
| Repository |
CiteSeer |
Author’s Response
| Authors |
Nicholas Carriero, David Gelernter |
| Type |
Journal Article |
| Publication |
Communications of the ACM |
| Volume |
32 |
| Issue |
10 |
| Pages |
1255ÂÂ1258 |
| Date |
1989 |
Beyond Parallelism to Coordination
| Author |
David Gelernter |
| Type |
Conference Paper |
| Date |
1990 |
| Proceedings Title |
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing |
| Conference Name |
Fourth SIAM Conference on Parallel Processing for Scientific Computing |
| Publisher |
Society for Industrial and Applied Mathematics |
| Pages |
413-418 |
| ISBN |
0-89871-262-9 |
| Repository |
ACM |
Building a Global Time on Parallel Machines
| Author |
JeanÂMarc Jezequel |
| Type |
Journal Article |
| Publication |
????? |
| Volume |
?? |
| Issue |
? |
| Pages |
136ÂÂ147 |
| Date |
?? 19?? |
Bulk Primitives in Linda RunÂtime Systems
Case studies in asynchronous data parallelism
| Authors |
Nicholas Carriero, David Gelernter |
| Type |
Journal Article |
| Publication |
Int. J. Parallel Program |
| Volume |
22 |
| Issue |
2 |
| Pages |
129-149 |
| Date |
1994 |
| DOI |
10.1007/BF02577872 |
| Repository |
ACM |
Characterising the design space for linda semantics
Closure for Case Base Retrieval in LINDA: an instance of the Iterative Transformation skeleton
Comparing three semantics for LindaÂ-like languages
| Authors |
Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro |
| Type |
Journal Article |
| Publication |
Theoretical Computer Science |
| Volume |
240 |
| Issue |
1 |
| Pages |
49-ÂÂ90 |
| Date |
2000 |
| URL |
http://citeseer.ist.psu.edu/197338.html |
| Repository |
CiteSeer |
Comparison of JavaSpaces and CORBA technologies
| Author |
Anjani Jha |
| Type |
Thesis |
| University |
University of North Florida |
| Date |
2003 |
Competitive Snoopy Caching
| Authors |
Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel D. Sleator |
| Type |
Journal Article |
| Publication |
Algorithmica |
| Volume |
3 |
| Issue |
? |
| Pages |
79ÂÂ119 |
| Date |
1988 |
Constraint matching retrieval in linda: extending retrieval functionality and distributing query processing
Contract-ÂLinda: A Paradigm for Programming Heterogeneous Parallel Systems
Coordinating RuleÂBased Software Processes with ESP
| Author |
Paolo Ciancarini |
| Type |
Report |
| Report Number |
UBLCSÂ93Â8 |
| Report Type |
Technical Report |
| Place |
Piazza di Porta S. Donato,5, 40127 Bologna, Italy |
| Date |
1993 |
Coordination languages and their significance
Copy-Collect: A new primitive for the linda model
Designing ATM Networks Using LINDA
Desktop Supercomputing
| Author |
Jane Morrill Tazelaar |
| Type |
Journal Article |
| Publication |
Byte |
| Volume |
?? |
| Issue |
5 |
| Pages |
204 |
| Date |
1990 |
Development of an architecture and implementation of distributed replicated services and resources uning Java
| Authors |
Cenk Altığ, Doğu Akdeniz Üniversitesi. |
| Type |
Thesis |
| University |
Eastern Mediterranean University |
| Date |
2000 |
Distributed communication via global buffer
Design and implementation of an inter-address-space communication mechanism for the SBN network computer are described. SBN’s basic communication primitives appear in context of a new distributed systems programming language strongly supported by the network communication kernel. A model in which all communication takes place via a distributed global buffer results in simplicity, generality and power in the communication primitives. Implementation issues raised by the requirements of the global buffer model are discussed in context of the SBN impementation effort.
| Authors |
David Gelernter, Arthur J. Bernstein |
| Type |
Conference Paper |
| Date |
1982 |
| Proceedings Title |
Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing |
| Place |
Ottawa, Canada |
| Publisher |
ACM |
| Pages |
10-18 |
| DOI |
10.1145/800220.806676 |
| ISBN |
0-89791-081-8 |
| URL |
http://doi.acm.org/10.1145/800220.806676 |
| Repository |
ACM |
Distributed data structures in Linda
A distributed data structure is a data structure that can be manipulated by many parallel processes simultaneously. Distributed data structures are the natural complement to parallel program structures, where a parallel program (for our purposes) is one that is made up of many simultaneously active, communicating processes. Distributed data structures are impossible in most parallel programming languages, but they are supported in the parallel language Linda and they are central to Linda programming style. We outline Linda, then discuss some distributed data structures that have arisen in Linda programming experiments to date. Our intent is neither to discuss the design of the Linda system nor the performance of Linda programs, though we do comment on both topics; we are concerned instead with a few of the simpler and more basic techniques made possible by a language model that, we argue, is subtly but fundamentally different in its implications from most others.This material is based upon work supported by the National Science Foundation under Grant No. MCS-8303905. Jerry Leichter is supported by a Digital Equipment Corporation Graduate Engineering Education Program fellowship.
| Authors |
Nicholas Carriero, David Gelernter, Jerrold Leichter |
| Type |
Conference Paper |
| Date |
1986 |
| Proceedings Title |
Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages |
| Conference Name |
Annual Symposium on Principles of Programming Languages |
| Place |
St. Petersburg Beach, Florida |
| Publisher |
ACM |
| Pages |
236-242 |
| DOI |
10.1145/512644.512666 |
| URL |
http://doi.acm.org/10.1145/512644.512666 |
| Repository |
ACM |
Distributed Implementation of a Linda Kernel
Distributed ObjectÂBased Programming Systems
| Authors |
Roger S. Chin, Samuel T. Chanson |
| Type |
Journal Article |
| Publication |
ACM Computing Surveys |
| Volume |
23 |
| Issue |
1 |
| Pages |
91ÂÂ124 |
| Date |
1991 |
Distributed Programming with Logic Tuple Spaces
| Author |
Paolo Ciancarini |
| Type |
Report |
| Report Number |
UBLCSÂ93Â7 |
| Report Type |
Technical Report |
| Place |
Piazza di Porta S. Donato,5, 40127 Bologna, Italy |
| Date |
1993 |
Dynamic Optimizations in Linda Systems
Efficient Parallel Programming with Linda
Evaluating Linda Optimizations in the CRAYÂT3D
Evolution of Object Behavior Using Context Relations
Experiences with BeLinda: A Synthetic Linda Benchmark for Parallel Computing Platforms
| Authors |
S. Kambhatla, J. Inouye, J. Walpole |
| Type |
Conference Paper |
| Date |
1990 |
| Proceedings Title |
Proceedings of the International Conference on Parallel Processing |
| Pages |
155-ÂÂ162 |
| Short Title |
Experiences with BeLinda |
| URL |
http://citeseer.ist.psu.edu/kambhatla90experiences.html |
| Repository |
CiteSeer |
Experience with memory management in open Linda systems
Exploitation of APL Data Parallelism on a SharedÂMemory MIMD Machine
| Authors |
DzÂChing Ju, WaiÂMee Ching |
| Type |
Journal Article |
| Publication |
ACM ????? |
| Volume |
?? |
| Issue |
? |
| Pages |
61ÂÂ72 |
| Date |
?? 1991 |
Exploiting coarse-grained task, data, and pipeline parallelism in stream programs
As multicore architectures enter the mainstream, there is a pressing demand for high-level programming models that can effectively map to them. Stream programming offers an attractive way to expose coarse-grained parallelism, as streaming applications (image, video, DSP, etc.) are naturally represented by independent filters that communicate over explicit data channels.In this paper, we demonstrate an end-to-end stream compiler that attains robust multicore performance in the face of varying application characteristics. As benchmarks exhibit different amounts of task, data, and pipeline parallelism, we exploit all types of parallelism in a unified manner in order to achieve this generality. Our compiler, which maps from the StreamIt language to the 16-core Raw architecture, attains a 11.2x mean speedup over a single-core baseline, and a 1.84x speedup over our previous work.
| Authors |
Michael I. Gordon, William Thies, Saman Amarasinghe |
| Type |
Conference Paper |
| Proceedings Title |
Proceedings of the 12th international conference on Architectural support for programming languages and operating systems |
| Conference Name |
12th international conference on Architectural support for programming languages and operating systems |
| Place |
San Jose, California, USA |
| Publisher |
ACM New York, NY, USA |
| Pages |
151 – 162 |
| DOI |
10.1145/1168857.1168877 |
| ISBN |
1-59593-451-0 |
| URL |
http://portal.acm.org/citation.cfm?
id=1168857.1168877 |
Extending the Parallel Logic Programming Paradigm with Linda-Âlike Operations
Extention of Strand with LindaÂ-like operations ÂÂÂ Implementation and performance study
FaultÂ-tolerant Parallel Processing Combining Linda, Checkpointing, and Transactions
Flexible framework for collaborative visualization applications using JAVAspaces
| Author |
Sean Butler |
| Type |
Thesis |
| University |
Air Force Institute of Technology |
| Date |
2001 |
Garbage Collection in Linda using Tuple Monitoring and Process Registration
| Authors |
Ronaldo Menezes, Alan Wood |
| Type |
Conference Paper |
| Date |
1998 |
| Proceedings Title |
Proc. of the 10th International Conference on Parallel and Distributed Computing and Systems |
| Place |
Las Vegas, Nevada, USA |
| Publisher |
Acta Press |
| Pages |
490-ÂÂ495 |
| URL |
http://citeseer.ist.psu.edu/menezes98garbage.html |
| Repository |
CiteSeer |
Generative Communication in Linda
Generative communication is the basis of a new distributed programming langauge that is intended for systems programming in distributed settings generally and on integrated network computers in particular. It differs from previous interprocess communication models in specifying that messages be added in tuple-structured form to the computation environment, where they exist as named, independent entities until some process chooses to receive them. Generative communication results in a number of distinguishing properties in the new language, Linda, that is built around it. Linda is fully distributed in space and distributed in time; it allows distributed sharing, continuation passing, and structured naming. We discuss these properties and their implications, then give a series of examples. Linda presents novel implementation problems that we discuss in Part II. We are particularly concerned with implementation of the dynamic global name space that the generative communication model requires.
Global synchronisation in Linda
How Concurrent Logic Programming Could Beneï¬t from Using LindaÂlike Operations
| Authors |
Grzegorz Czajkowski, Krzysztof Zielenski |
| Type |
Conference Paper |
| Date |
1993 |
| Proceedings Title |
ICLPÂWorkshops on Implementation of Logic Programming Systems |
| Pages |
43-Â64 |
| URL |
http://citeseer.ist.psu.edu/czajkowski93how.html |
| Repository |
CiteSeer |
How to Share Memory in a Distributed System
| Authors |
Eli Upfal, Avi Wigderson |
| Type |
Journal Article |
| Publication |
Journal of the Association for Computing Machinery |
| Volume |
34 |
| Issue |
1 |
| Pages |
116ÂÂ127 |
| Date |
1987 |
How to Write Parallel Programs: A First Course
| Authors |
Nicholas Carriero, David Gelernter |
| Type |
Book |
| Place |
Cambridge |
| Publisher |
The MIT Press |
| Date |
1990 |
How to Write Parallel Programs: A Guide to the Perplexed
| Authors |
Nicholas Carriero, David Gelernter |
| Type |
Journal Article |
| Publication |
ACM Computing Surveys |
| Volume |
21 |
| Issue |
3 |
| Pages |
323ÂÂ357 |
| Date |
1989 |
How to Write Parallel Programs on the T3E Using Linda
Identifying tuple usage patterns in an optimizing linda compiler
Implementing Algorithmic Skeletons for Generative Communication with Linda
Implementing an optimizing linda compiler using suif
Implementing Distributed Linda in Standard ML
Implementing mathematical morphology in ISETLLinda
Incorporating Input/Output Operations in Linda
Integrated Planning of ATM Networks Using the Tool LINDA
Investigating parallel interpretationÂtree model matching algorithms with ProSetÂLinda
ISETL-ÂLINDA: Parallel Programming with Bags
This paper describes the parallel language ISETL-LINDA. The language is an extension of ISETL, an imperative language whose main data structure is the set. We extend ISETL by adding a new type of distributed bags, and operations to act on bags which correspond to the LINDA primitives. However, we use a variant of LINDA created at the University of York which replaces the problematic inp and rdp primitives by a single primitive, collect
Issues and Experiences in Implementing a Distributed Tuplespace
Java Spaces example by example
| Author |
Steven Halter |
| Type |
Book |
| Place |
Upper Saddle River N.J. |
| Publisher |
Prentice Hall PTR |
| Date |
2002 |
| ISBN |
9780130619167 |
JavaSpaces in practice
| Author |
Philip Bishop |
| Type |
Book |
| Place |
London ;;New York |
| Publisher |
Addison-Wesley |
| Date |
2003 |
| Language |
English |
| ISBN |
9780321112316 |
JavaSpace Speciï¬cation
The JavaSpacesTM service specification provides a distributed persistence and object exchange mechanism for code written in the JavaTM programming language. Objects are written in entries that provide a typed grouping of relevant fields. Clients can perform simple operations on a JavaSpaces service to write new entries, lookup existing entries, and remove entries from the
space. Using these tools, you can write systems to store state, and also write systems that use flow of data to implement distributed algorithms and let the JavaSpaces service implement distributed persistence for you.
JavaSpaces Principles, Patterns, and Practice
| Authors |
Eric Freeman, Susanne Hupfer, Ken Arnold |
| Type |
Book |
| Publisher |
Reading, MA : Addison-Wesley |
| Date |
1999 |
| Language |
English |
| ISBN |
0201309556 |
Jini and JavaSpaces application development
| Author |
Robert Flenner |
| Type |
Book |
| Place |
Indianapolis Ind. |
| Publisher |
SAMS |
| Date |
2002 |
| ISBN |
9780672322587 |
Join the EISA Evolution
| Authors |
MinÂHur Whang, Joe Kua |
| Type |
Journal Article |
| Publication |
Byte |
| Volume |
?? |
| Issue |
5 |
| Pages |
241ÂÂ247 |
| Date |
1990 |
Kooperatives Arbeiten und Rechnen in einer gemischtsprachigen heterogenen Rechnerumgebung ÂÂ Standards und Anwendungen
| Author |
Thomas Kolarik |
| Type |
Report |
| Report Type |
Dissertation |
| Place |
Augasse 2ÂÂ6, AÂ1090 Wien |
| Date |
1993 |
Lastverteilung in einem heterogenen verteilten objektorientierten System
| Author |
Josef Matulka |
| Type |
Report |
| Report Type |
Dissertation |
| Place |
Augasse 2ÂÂ6, AÂ1090 Wien |
| Date |
1991 |
Law-ÂGoverned Linda Communication Model
Ligia: A Java based LindaÂlike RunÂtime System with Garbage Collection of Tuple Spaces
Limbo: A tuple space based platform for adaptive mobile applications
| Authors |
N. Davies, S. Wade, A. Friday, G. Blair |
| Type |
Journal Article |
| Publication |
Proceedings of the International Conference on Open Distributed Processing/Distributed Platforms (ICODP/ICDP’97) |
| Pages |
291–302 |
| Date |
1997 |
| Short Title |
Limbo |
| Repository |
Google Scholar |
LIME: Linda Meets Mobility
| Authors |
Gian Pietro Picco, Amy L. Murphy, GruiaÂCatalin Roman |
| Type |
Conference Paper |
| Date |
1999 |
| Proceedings Title |
International Conference on Software Engineering |
| Pages |
368-Â377 |
| Short Title |
LIME |
| URL |
http://citeseer.ist.psu.edu/picco99lime.html |
| Repository |
CiteSeer |
LINDA and Its Offspring
LindaÂ-based applicative and imperative process algebras
| Authors |
Rocco De Nicola, Rosario Pugliese |
| Type |
Journal Article |
| Publication |
Theoretical Computer Science |
| Volume |
238 |
| Issue |
1ÂÂ2 |
| Pages |
389-ÂÂ437 |
| Date |
2000 |
| URL |
http://citeseer.ist.psu.edu/457297.html |
| Repository |
CiteSeer |
Linda-Âbased applicative and imperative process algebras
Linda Implementation Revisited
| Authors |
Andrew Douglas, Antony Rowstron, Alan Wood |
| Editor |
P. Nixon |
| Type |
Conference Paper |
| Date |
1995 |
| Proceedings Title |
Proceedings of the 18th World occam and transputer user group meeting |
| Publisher |
IOS Press |
| URL |
http://citeseer.ist.psu.edu/douglas95linda.html |
| Repository |
CiteSeer |
Linda implementations in Java for concurrent systems
This paper surveys a number of the implementations of Linda that are available in Java. It provides some discussion of their strengths and weaknesses, and presents the results from benchmarking experiments using a network of commodity workstations. Some extensions to the original Linda programming model are also presented and discussed, together with examples of their application to parallel processing problems. Copyright © 2004 John Wiley & Sons, Ltd.
| Authors |
G. C. Wells, A. G. Chalmers, P. G. Clayton |
| Type |
Journal Article |
| Publication |
Concurrency: Practice and Experience |
| Volume |
16 |
| Issue |
10 |
| Pages |
1005-1022 |
| Date |
2004 |
| DOI |
10.1002/cpe.v16:10 |
| Short Title |
Linda implementations in Java for concurrent systems |
| Repository |
ACM |
Linda in adolescence
| Authors |
Robert Bjornson, Nicholas Carriero, David Gelernter, Jerry Leichter |
| Type |
Conference Paper |
| Date |
1986 |
| Proceedings Title |
Proceedings of the 2nd workshop on Making distributed systems work |
| Place |
Amsterdam, Netherlands |
| Publisher |
ACM |
| Pages |
1-4 |
| DOI |
10.1145/503956.503977 |
| ISBN |
1-23456-789-0 |
| URL |
http://doi.acm.org/10.1145/503956.503977 |
| Repository |
ACM |
Linda in Context
Linda: Konzepte und Implementierungen
| Author |
M. Graff |
| Type |
Journal Article |
| Publication |
Interface |
| Issue |
25 |
| Pages |
34ÂÂ41 |
| Date |
1985 |
LindaÂLike Systems and Their Implementation
| Author |
Greg Wilson |
| Type |
Report |
| Report Number |
91Â13 |
| Report Type |
Technical Report |
| Place |
Edinburgh |
| Date |
1991 |
Linda Meets Unix
| Author |
William Leler |
| Type |
Journal Article |
| Publication |
IEEE Computer |
| Volume |
23 |
| Issue |
2 |
| Pages |
43ÂÂ54 |
| Date |
1990 |
Matching Language and Hardware for Parallel Computation in the Linda Machine
The Linda Machine is a parallel computer that has been designed to support the Linda parallel programming environment in hardware. Programs in Linda communicate through a logically shared associative memory called tuple space. The goal of the Linda Machine project is to implement Linda’s high-level shared-memory abstraction efficiently on a nonshared-memory architecture. The authors describe the machine’s special-purpose communication network and its associated protocols, the design of the Linda coprocessor, and the way its interaction with the network supports global access to tuple space. The Linda Machine is in the process of fabrication. The authors discuss the machine’s projected performance and compare this to software versions of Linda.
| Authors |
Sudhir Ahuja, Nicholas J. Carriero, David H. Gelernter, Venkatesh Krishnaswamy |
| Type |
Journal Article |
| Publication |
IEEE Trans. Comput |
| Volume |
37 |
| Issue |
8 |
| Pages |
921-929 |
| Date |
1988 |
| DOI |
10.1109/12.2244 |
| Repository |
ACM |
Multicomputers: MessageÂPassing Concurrent Computers
| Authors |
William C. Athas, Charles L. Seitz |
| Type |
Journal Article |
| Publication |
IEEE Computer |
| Volume |
21 |
| Issue |
8 |
| Pages |
9ÂÂ24 |
| Date |
1988 |
Multiple Tuple Spaces in Linda
| Author |
David Gelernter |
| Type |
Conference Paper |
| Date |
1989 |
| Proceedings Title |
Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages |
| Publisher |
Springer-Verlag |
| Pages |
20-27 |
| ISBN |
3-540-51285-3 |
| Repository |
ACM |
New and improved: Linda in Java
This paper discusses the current resurgence of interest in the Linda coordination language for parallel and distributed programming. Particularly in the Java field, there have been a number of developments over the past few years. These developments are summarised together with the advantages of using Linda for programming concurrent systems. Some problems with the basic Linda approach are also discussed and a novel solution to these is presented. The power and flexibility of the proposed extensions to the Linda programming model are illustrated by considering a number of example applications, including a detailed case study of visual language parsing.
| Author |
George C. Wells |
| Type |
Journal Article |
| Publication |
Sci. Comput. Program |
| Volume |
59 |
| Issue |
1-2 |
| Pages |
82-96 |
| Date |
2006 |
| DOI |
10.1016/j.scico.2005.07.005 |
| Short Title |
New and improved |
| Repository |
ACM |
Object-ÂOriented Parallel Programming with Objective Linda
On the design of Eilean: A LindaÂlike library for MPI
| Author |
Joao Carreira Joao Gabriel Silva |
| Editor |
IEEE |
| Type |
Conference Paper |
| Date |
October 1994 |
| Proceedings Title |
2nd Scalable Parallel Libraries Conference |
| Short Title |
On the design of Eilean |
| URL |
http://citeseer.ist.psu.edu/carreira94design.html |
| Repository |
CiteSeer |
On the Expressiveness of Linda Coordination Primitives
| Authors |
Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro |
| Type |
Journal Article |
| Publication |
Information and Computation |
| Volume |
156 |
| Issue |
1ÂÂ2 |
| Pages |
90-ÂÂ121 |
| Date |
2000 |
| URL |
http://citeseer.ist.psu.edu/111941.html |
| Repository |
CiteSeer |
On the incomparability of Gamma and Linda
On the Introduction of Location in Linda Systems
| Author |
Ronaldo Menezes |
| Type |
Conference Paper |
| Date |
2000 |
| Proceedings Title |
Proceedings of joint Meeting of the the 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI2000) and the 6th International Conference on Information Systems Analysis and Synthesis (ISAS2000) |
| URL |
http://citeseer.ist.psu.edu/menezes00introduction.html |
| Repository |
CiteSeer |
On the Use of Linda as a Framework for Distributed Database Systems
Linda is a coordination language capable of solving issues in distributed computing environments that relate to process synchronization, communication and creation. The expressiveness of Linda in distributed systems is such that researchers are proposing novel applications using Linda as a primary means of coordination. The examples range from peer-to-peer to groupware computing, from simple chat applications to control systems. Surprisingly, Linda has not been used in the field of distributed databases, although Linda can be helpful in solving coordination issues in a distributed database system. In this paper, we look at a possibility of usine Linda in the context of distributed databases.
On What Linda Is: Formal Description of Linda as a Reactive System
| Authors |
David Gelernter, Lenore D. Zuck |
| Type |
Conference Paper |
| Date |
1997 |
| Proceedings Title |
Proceedings of the Second International Conference on Coordination Languages and Models |
| Publisher |
Springer-Verlag |
| Pages |
187-204 |
| ISBN |
3-540-63383-9 |
| Short Title |
On What Linda Is |
| Repository |
ACM |
Optimising the Linda in Primitive: Understanding TupleÂSpace RunÂtimes
p4-ÂLinda: A Portable Implementation of Linda
| Authors |
Ralph M. Butler, Alan L. Levington, Ewing L. Lusk |
| Type |
Report |
| Report Type |
Technical Report |
| Place |
Jacksonville, FL 32246 and Argonne, IL 60439 |
| Date |
19?? |
Paradigms for Process Interaction in Distributed Programs
| Author |
Gregory R. Andrews |
| Type |
Journal Article |
| Publication |
ACM Computing Surveys |
| Volume |
23 |
| Issue |
1 |
| Pages |
50ÂÂ90 |
| Date |
1991 |
Parallel Hashing: An Efficient Implementation of Shared Memory
| Authors |
Anna R. Karlin, Eli Upfal |
| Type |
Journal Article |
| Publication |
Journal of the Association for Computing Machinery |
| Volume |
35 |
| Issue |
4 |
| Pages |
876ÂÂ892 |
| Date |
1988 |
Persistent Linda: Linda + transactions + query processing
| Authors |
Brian G. Anderson, Dennis Shasha |
| Type |
Journal Article |
| Publication |
Research Directions in High-Level Parallel Programming Languages |
| Pages |
93 – 109 |
| Date |
1991 |
| Short Title |
Persistent Linda |
| URL |
http://citeseer.ist.psu.edu/anderson91persistent.html |
| Repository |
CiteSeer |
Piranha Scheduling: Strategies and Their Implementation
| Authors |
David Gelernter, Marc R. Jourdenais, David Kaminsky |
| Type |
Report |
| Report Type |
Technical Report |
| Place |
New Haven |
| Date |
1993 |
PLinda 2.0: A Transactional/Checkpointing Approach to Fault Tolerant Linda
| Authors |
Karpjoo Jeong, Dennis Shasha |
| Type |
Conference Paper |
| Date |
1994 |
| Proceedings Title |
Proceedings of the 13th Symposium on Reliable Distributed Systems |
| Publisher |
IEEE |
| Pages |
96-ÂÂ105 |
| Short Title |
PLinda 2.0 |
| URL |
http://citeseer.nj.nec.com/56377.html |
| Repository |
CiteSeer |
ProblemÂOriented Shared Memory: A Decentralized Approach to Distributed System Design
| Author |
David R. Cheriton |
| Type |
Journal Article |
| Publication |
IEEE ???? |
| Volume |
?? |
| Issue |
?? |
| Pages |
190ÂÂ197 |
| Date |
1986 |
Proceedings of the Second International ACPC Conference
| Editor |
J. Volkert |
| Type |
Book |
| Series |
Lecture Notes in Computer Science |
| Volume |
734 |
| Place |
Heidelberg |
| Publisher |
Springer Verlag |
| Date |
1993 |
Process Calculi for Coordination: From Linda to JavaSpaces
| Authors |
Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro |
| Type |
Journal Article |
| Publication |
Lecture Notes in Computer Science |
| Volume |
1816 |
| Pages |
198+ |
| Date |
2000 |
| Short Title |
Process Calculi for Coordination |
| URL |
http://citeseer.ist.psu.edu/busi00process.html |
| Repository |
CiteSeer |
Programming a workstation cluster with PVM and Linda: a qualitative and quantitative comparison
Programming Environments for Parallel Computing: A Comparison of CPS, Linda, P4, PVM, POSYBL, and TCGMSG
Programming Three Parallel Computers
| Authors |
Marta Kallstrom, Shreekant S. Thakar |
| Type |
Journal Article |
| Publication |
IEEE Software |
| Volume |
?? |
| Issue |
? |
| Pages |
11ÂÂ22 |
| Date |
1988 |
Prolog-ÂD-ÂLinda: An Embedding of Linda in SICStus Prolog
PrologÂDÂLinda v2: A New Embedding of Linda in SICStus Prolog
| Author |
G. Sutcliffe |
| Editors |
F. DeBoesschere, J. Jacquet, P. Tarau |
| Type |
Conference Paper |
| Date |
1993 |
| Proceedings Title |
Proc. Workshop on BlackboardÂbased Logic Programming |
| Place |
Budapest, Hungary |
| Pages |
105ÂÂ117 |
| Short Title |
PrologÂDÂLinda v2 |
| URL |
http://citeseer.ist.psu.edu/53631.html |
| Repository |
CiteSeer |
PrologÂLinda: An Embedding of Linda in muProlog
This paper presents an embedding of the Linda parallel programming paradigm in Prolog. A mono-processor and a multi-processor implementation are described. Both implementations provide coarse grain parallelism to Prolog. The embedding of Linda in Prolog extends Linda’s standard tuple space operations, permitting unification and Prolog style deduction in the tuple space.
| Authors |
Geoff Sutcliff, James Pinakis |
| Type |
Report |
| Report Type |
Technical Report |
| Place |
Nedlands, 6009, Western Australia |
| Date |
1989 |
Prototyping Parallel Algotirhms with PROSETÂLinda
| Author |
Wilhelm Hasselbring |
| Type |
Conference Paper |
| Pages |
135ÂÂ150 |
Reconï¬guration of Hierarchical Tuple Spaces: Experiments with LindaÂPolylith
| Authors |
Gilberto Matos, James Purtilo |
| Type |
Report |
| Report Type |
Technical Report |
| Place |
College Park, MD 20742 |
| Date |
19?? |
Reconï¬guration of Hierarchical Tuple Spaces: Experiments with Linda-ÂPolylith
Recovery With Limited Replay: FaultÂ-Tolerant Processes In Linda
Research in the area of fault-tolerant distributed systems has focused to a large extent on
data surviving various forms of failure. The replica control algorithms for maintaining mutually
consistent replicas abound in number. However, comparatively little work has been devoted to
making processes recoverable. In domains other than databases and transaction processing, fault-
tolerance generally implies both fault-tolerant data and fault-tolerant processes. In environments
where cooperation among processes is important we argue that high availability of processes in
addition to their recoverability is crucial.
Our specific interest is in the Linda tuple space paradigm. In this paper we discuss efficient
techniques for making Linda processes recoverable and outline some characteristics of Linda that
make it particularly suitable for implementing fault-tolerance. We also propose a simple exten-
sion to our recoverable process mechanism that makes processes highly available.
SAHAYOG: A Test Bed for Evaluating Dynamic LoadÂSharing Policies
| Authors |
Piyush Dikshit, Satish K. Tripathi, Pankaj Jalote |
| Type |
Journal Article |
| Publication |
Software ÂÂ Practice and Experience |
| Volume |
19 |
| Issue |
5 |
| Pages |
411ÂÂ435 |
| Date |
1989 |
Scans as Primitive Parallel Operations
| Author |
Guy E. Blelloch |
| Type |
Journal Article |
| Publication |
IEEE Transactions on Computers |
| Volume |
38 |
| Issue |
11 |
| Pages |
1526ÂÂ1538 |
| Date |
1989 |
Semantics and Analysis of Linda-Âbased Languages
| Authors |
R. Cridlig, E. Goubault |
| Editors |
P. Cousot, M. Falaschi, G. File, A. Rauzy |
| Type |
Conference Paper |
| Date |
1993 |
| Proceedings Title |
Proc. Int. Workshop on Static Analysis (WSA 93) |
| Publisher |
SpringerÂVerlag, Berlin |
| Volume |
724 |
| Pages |
72ÂÂ86 |
| URL |
http://citeseer.ist.psu.edu/cridlig93semantics.html |
| Repository |
CiteSeer |
Separated at Birth
| Author |
Bob Ryan |
| Type |
Journal Article |
| Publication |
Byte |
| Volume |
?? |
| Issue |
5 |
| Pages |
207ÂÂ212 |
| Date |
1990 |
Shared Packages Through Linda
Simulating A Shared Associative Memory On A Transputer Network: Linda
Solving the Linda multiple problem
Solving the Linda Multiple rd Problem Using the CopyÂCollect Primitive
Some Experiences with Network LINDA
LINDA is a system for programming parallel computers. Although it was originally designed for shared memory machines, versions for distributed memory systems and machines connected over a network are also available. LINDA programs that run well over the network will run well without change on a shared memory system.
Spending Your Free Time
| Authors |
David Gelernter, James Philbin |
| Type |
Journal Article |
| Publication |
Byte |
| Volume |
?? |
| Issue |
5 |
| Pages |
213ÂÂ219 |
| Date |
1990 |
Strategies for Distributed Decisionmaking
| Authors |
Robert R. Tenney, Nils R. Sandell |
| Type |
Journal Article |
| Publication |
IEEE Transactions on Systems, Man, and Cybernetics |
| Volume |
SMCÂ11 |
| Issue |
8 |
| Pages |
527ÂÂ538 |
| Date |
1981 |
Structures for Distributed Decisionmaking
| Authors |
Robert R. Tenney, Nils R. Sandell |
| Type |
Journal Article |
| Publication |
IEEE Transactions on Systems, Man, and Cybernetics |
| Volume |
SMCÂ11 |
| Issue |
8 |
| Pages |
517ÂÂ527 |
| Date |
1981 |
Supercomputer Earth: Massively Parallel Internet
| Author |
Eric Freeman |
| Type |
Journal Article |
| Publication |
Omnibus, the Yale University Computing & Information Systems Supplement to the Yale Weekend Bulletin and Calendar |
| Volume |
6 |
| Issue |
4 |
| Pages |
1ÂÂ2 |
| Date |
1993 |
Supercomputers Get Personal
| Authors |
Sam Bogoch, Iain Bason, Jeff Williams, Mike Russel |
| Type |
Journal Article |
| Publication |
Byte |
| Volume |
?? |
| Issue |
5 |
| Pages |
231ÂÂ234 |
| Date |
1990 |
Supercomputing out of Recycled Garbage: Preliminary Experience with Piranha
In this paper we present a new system for making use of the cyles routinely wasted in local area networks. The Piranha system harnesses these cycles to run explicitly parallel programs. Programs written for Piranha are specializations of Linda master/worker programs [5]. We have used Piranha to run a number of production applications. We present a description of the Piranha prototype, briefly explain the Piranha programming methodology, and explore different types of Piranha algorithms. This work was supported by the National Science Foundation under grant number CCR-8657615 and NASA under grant number NGT-50719.
| Authors |
David Gelernter, David Kaminsky |
| Type |
Conference Paper |
| Date |
1992 |
| Proceedings Title |
Proceedings of the 6th international conference on Supercomputing |
| Conference Name |
International Conference on Supercomputing |
| Place |
New Haven |
| Publisher |
ACM New York, NY, USA |
| DOI |
10.1145/143369.143444 |
| URL |
http://doi.acm.org/10.1145/143369.143444 |
Supporting Fault-ÂTolerant Parallel Programming in Linda
Linda is a language for programming parallel applications whose most notable feature is a distributed shared memory called tuple space. While suitable for a wide variety of programs, one shortcoming of the language as commonly defined and implemented is a lack of support for writing programs that can tolerate failures in the underlying computing platform. This paper describes FT-Linda, a version of Linda that addresses this problem
| Authors |
David E. Bakken, Richard D. Schlichting |
| Type |
Journal Article |
| Publication |
IEEE Transactions on Parallel and Distributed Systems |
| Volume |
6 |
| Issue |
3 |
| Pages |
287ÂÂ-302 |
| Date |
1995 |
The architecture of a Linda coprocessor
We describe the architecture of a coprocessor that supports the communication primitives of the Linda parallel programming environment in hardware. The coprocessor is a critical element in the architecture of the Linda Machine, an MIMD parallel processing system that is designed top down from the specifications of Linda. Communication in Linda programs takes place through a logically shared associative memory mechanism called tuple space. The Linda Machine, however, has no physically shared memory. The microprogrammable coprocessor implements distributed protocols for executing tuple space operations over the Linda Machine communication network. The coprocessor has been designed and is in the process of fabrication. We discuss the projected performance of the coprocessor and compare it with software Linda implementations. This work is supported in part by National Science Foundation grants CCR-8657615 and ONR N00014-86-K-0310.
| Authors |
V. Krishnaswamy, S. Ahuja, N. Carriero, D. Gelernter |
| Type |
Conference Paper |
| Date |
1988 |
| Proceedings Title |
Proceedings of the 15th Annual International Symposium on Computer architecture |
| Place |
Honolulu, Hawaii, United States |
| Publisher |
IEEE Computer Society Press |
| Pages |
240-249 |
| ISBN |
0-8186-0861-1 |
| Repository |
ACM |
The Jini architecture for network-Âcentric computing
A federation of spontaneously networked electronic components of all types can communicate, interact, and share their services and functions, as explained by Jini’s lead architect.
The ProSetÂLinda approach to prototyping parallel systems
The S/Net’s Linda kernel (extended abstract)
The Symmetric CÂLinda Programming Language
| Author |
James E. Narem |
| Type |
Report |
| Report Type |
Abstract |
| Place |
New Haven |
| Date |
1993 |
To: Linda in Context
| Author |
Ehud Shapiro |
| Type |
Journal Article |
| Publication |
Communications of the ACM |
| Volume |
32 |
| Issue |
10 |
| Pages |
1244ÂÂ1249 |
| Date |
1989 |
To: Linda in Context
| Author |
L. V. Kale |
| Type |
Journal Article |
| Publication |
Communications of the ACM |
| Volume |
32 |
| Issue |
10 |
| Pages |
1252ÂÂ1253 |
| Date |
1989 |
To: Linda in Context
| Authors |
Kenneth M. Kahn, Mark S. Miller |
| Type |
Journal Article |
| Publication |
Communications of the ACM |
| Volume |
32 |
| Issue |
10 |
| Pages |
1252ÂÂ1255 |
| Date |
1989 |
To: Linda in Context
| Author |
Craig Davidson |
| Type |
Journal Article |
| Publication |
Communications of the ACM |
| Volume |
32 |
| Issue |
10 |
| Pages |
1249ÂÂ1252 |
| Date |
1989 |
T spaces
With the creation of computer networks in the 1970s came the birth of distributed network applications. Since then, there have been many applications that spanned multiple machines, but in the last 20 years no one created a serviceable network middleware package for developing highly effective distributed applications, that is, until now. This paper describes the design and architecture of T Spaces, a project at the IBM Almaden Research Center that fills the network middleware void. T Spaces embodies the three main characteristics of a useful mechanism for network programs, namely, data management, computation, and communication. Since it has the potential to connect any program to any other program on a computing network, T Spaces is an ideal platform on which to build a global computing services platform where any program or system service is available to any other program or service. In addition, its small footprint and JavaTM implementation make T Spaces an ideal platform for writing distributed applications for embedded and palm-top computers, thus forging a needed gateway from the emerging embedded and palm-top computers to established desktop and server computers.
| Authors |
P. Wyckoff, S. W. McLaughry, T. J. Lehman, D. A. Ford |
| Type |
Journal Article |
| Publication |
IBM Syst. J |
| Volume |
37 |
| Issue |
3 |
| Pages |
454-474 |
| Date |
1998 |
| Repository |
ACM |
T Spaces: The Next Wave
Tuple analysis and partial evaluation strategies in the Linda precompiler
| Authors |
Nicholas Carriero, David Gelernter |
| Type |
Conference Paper |
| Date |
1990 |
| Proceedings Title |
Selected papers of the second workshop on Languages and compilers for parallel computing |
| Place |
Urbana, Illinois, United States |
| Publisher |
Pitman Publishing |
| Pages |
114-125 |
| Repository |
ACM |
Turingware: Collaborative Ensembles of Humans and Software
| Author |
Susanne Hupfer |
| Type |
Report |
| Report Type |
Technical Report |
| Place |
New Haven |
| Date |
19?? |
Two Strategies for Solving the Vertex Cover Problem on a Transputer Network
| Authors |
R. Luling, B. Monien |
| Type |
Journal Article |
| Publication |
????? |
| Volume |
?? |
| Issue |
? |
| Pages |
160ÂÂ170 |
| Date |
?? 19?? |
Using JavaBeans for distributed configuration management on Jini and JavaSpace
| Author |
Hualiang Yu |
| Type |
Thesis |
| University |
Arizona State University |
| Date |
2001 |
| Language |
English |
Using Linda to Build Parallel AI Applications
| Authors |
Michael Factor, Scott Fertig, David H. Gelernter |
| Type |
Report |
| Report Number |
YALEU/DCS/TRÂ861 |
| Report Type |
Technical Report |
| Place |
New Haven |
| Date |
1991 |
Using Logical Operators as an Extended Coordination Mechanism in Linda
Using ObjectÂOriented Methods in Ada 95 to Implement Linda
Using swarm intelligence in linda systems
| Authors |
R. Tolksdorf, R. Menezes |
| Type |
Conference Paper |
| Date |
2003 |
| Proceedings Title |
Proceedings
of the Fourth International Workshop Engineering Societies in the Agents World ESAW’03 |
| URL |
http://citeseer.ist.psu.edu/tolksdorf03using.html |
| Repository |
CiteSeer |
Using the ProSetÂLinda Prototyping Language for Investigating MIMD Algorithms for Model Matching in 3ÂD Computer Vision
ViewÂCentric Reasoning for Linda and Tuple Space Computation
| Author |
Marc L. Smith |
| Editors |
James Pascoe, Roger Loader, Vaidy Sunderam |
| Type |
Conference Paper |
| Date |
2002 |
| Proceedings Title |
Communicating Process Architectures ÂÂ 2002 |
| Publisher |
IOS Press |
| URL |
http://citeseer.ist.psu.edu/smith02viewcentric.html |
| Repository |
CiteSeer |
VisuaLinda: A Framework and a System for Visualizing Parallel Linda Programs
ZeroÂsafe net models for transactions in Linda
