JaCaL : an implementation of Linda in Java

Tysowski, Piotr; Zulkernine, Mohammad; Leue, Stefan

JaCaL : an implementation of Linda in Java

Dateien

Tysowski_221538.pdfGröße: 5.45 MBDownloads: 404

Datum

1999

Autor:innen

Tysowski, Piotr

Zulkernine, Mohammad

Leue, Stefan

URI (zitierfähiger Link)

http://nbn-resolving.de/urn:nbn:de:bsz:352-221538

Link zur Lizenz

Urheberrechtlich geschützt

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

ZHENG, Si-Qing, ed.. Proceedings of the Eleventh IASTED International Conference Parallel and Distributed Computing and Systems : November 3 - 6, 1999, MIT, Cambridge, Massachusetts, USA. Anaheim; Zurich [u.a.]: Acta Press, 1999, pp. 683-692. ISBN 0-88986-275-3

Zusammenfassung

Java is an object-oriented programming language with built-in features for creating distributed programs. A key feature-set that is missing, however, is'an easy-to-use, reliable, and scaleable tool for writing truly parallel programs. The Linda para\lel programming model defmes a client-server approach where concurrent execution requests are serviced and results are stored to a shared data repository called a Tuple Space. Tuples consist of heterogeneous coIIections of data of various types. An interpretation of the model aIIows the programmer to create active tuples, in which user-defined functions are automatically and transparently launched in concurrently executing processes distributed on remote workstations. This paper presents an implementation of Linda in Java called JaCaL, a library of classes and interfaces easily integrated into a client application. The Tuple Space has been implemented as a data store residing on a single machine, whilst being accessible by clients distributed on other machines. Clients can create active tuples, which cause processes on distributed machines to be transparently invoked to execute user-defined functions, employing a load-balanced worker process model. No pre-processor is required to parse the client program before compilation. The implementation allows a Java application developer to create more efficient coarse grained parallel programs with minimal effort. Performance measurements have been made and compared to those of another, similar implementation.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Linda, Java, concurrency, parallel programming, distributed computing

Konferenz

IASTED, 3. Nov. 1999 - 6. Nov. 1999, MIT, Cambridge, Massachusetts, USA

Zitieren

ISO 690

TYSOWSKI, Piotr, Mohammad ZULKERNINE, Stefan LEUE, 1999. JaCaL : an implementation of Linda in Java. IASTED. MIT, Cambridge, Massachusetts, USA, 3. Nov. 1999 - 6. Nov. 1999. In: ZHENG, Si-Qing, ed.. Proceedings of the Eleventh IASTED International Conference Parallel and Distributed Computing and Systems : November 3 - 6, 1999, MIT, Cambridge, Massachusetts, USA. Anaheim; Zurich [u.a.]: Acta Press, 1999, pp. 683-692. ISBN 0-88986-275-3

BibTex

@inproceedings{Tysowski1999JaCaL-22153,
  year={1999},
  title={JaCaL : an implementation of Linda in Java},
  isbn={0-88986-275-3},
  publisher={Acta Press},
  address={Anaheim; Zurich [u.a.]},
  booktitle={Proceedings of the Eleventh IASTED International Conference Parallel and Distributed Computing and Systems : November 3 - 6, 1999, MIT, Cambridge, Massachusetts, USA},
  pages={683--692},
  editor={Zheng, Si-Qing},
  author={Tysowski, Piotr and Zulkernine, Mohammad and Leue, Stefan}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/22153">
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-03-27T09:54:18Z</dcterms:available>
    <dcterms:bibliographicCitation>Proceedings of the Eleventh IASTED International Conference Parallel and Distributed Computing and Systems : November 3 - 6, 1999, MIT, Cambridge, Massachusetts, USA / a publ. of The International Association of Science and Technology for Development - IASTED. Ed.: Si-Qing Zheng. - Anaheim ; Zurich [u.a.] : Acta Press, 1999. - S. 683-692. - ISBN 0-88986-275-3</dcterms:bibliographicCitation>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:issued>1999</dcterms:issued>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22153/2/Tysowski_221538.pdf"/>
    <dc:contributor>Leue, Stefan</dc:contributor>
    <dc:creator>Tysowski, Piotr</dc:creator>
    <dcterms:abstract xml:lang="eng">Java is an object-oriented programming language with built-in features for creating distributed programs. A key feature-set that is missing, however, is'an easy-to-use, reliable, and scaleable tool for writing truly parallel programs. The Linda para\lel programming model defmes a client-server approach where concurrent execution requests are serviced and results are stored to a shared data repository called a Tuple Space. Tuples consist of heterogeneous coIIections of data of various types. An interpretation of the model aIIows the programmer to create active tuples, in which user-defined functions are automatically and transparently launched in concurrently executing processes distributed on remote workstations. This paper presents an implementation of Linda in Java called JaCaL, a library of classes and interfaces easily integrated into a client application. The Tuple Space has been implemented as a data store residing on a single machine, whilst being accessible by clients distributed on other machines. Clients can create active tuples, which cause processes on distributed machines to be transparently invoked to execute user-defined functions, employing a load-balanced worker process model. No pre-processor is required to parse the client program before compilation. The implementation allows a Java application developer to create more efficient coarse grained parallel programs with minimal effort. Performance measurements have been made and compared to those of another, similar implementation.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Tysowski, Piotr</dc:contributor>
    <dc:rights>terms-of-use</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22153/2/Tysowski_221538.pdf"/>
    <dc:creator>Zulkernine, Mohammad</dc:creator>
    <dcterms:title>JaCaL : an implementation of Linda in Java</dcterms:title>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22153"/>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-03-27T09:54:18Z</dc:date>
    <dc:creator>Leue, Stefan</dc:creator>
    <dc:contributor>Zulkernine, Mohammad</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein