{"title":"Sorting Algorithms Implemented Using JavaSpaces","authors":"C. Muresan","doi":"10.1109/ISPDC.2012.27","DOIUrl":null,"url":null,"abstract":"Java Spaces technology is a Java implementation of a tuple-based system providing a programming model that views an application as a collection of processes cooperating via the flow of objects into and out of one or more spaces. A space is a shared, network-accessible repository for objects together with their behavior. Processes perform simple operations to write objects into a space, take or read objects from a space that are of interest to them. This technology is suited for parallel computation applications and provides tremendous benefits in terms of scalability and fault-tolerance. I have described how three sorting algorithms can be implemented using Java Spaces technology.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 11th International Symposium on Parallel and Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC.2012.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Java Spaces technology is a Java implementation of a tuple-based system providing a programming model that views an application as a collection of processes cooperating via the flow of objects into and out of one or more spaces. A space is a shared, network-accessible repository for objects together with their behavior. Processes perform simple operations to write objects into a space, take or read objects from a space that are of interest to them. This technology is suited for parallel computation applications and provides tremendous benefits in terms of scalability and fault-tolerance. I have described how three sorting algorithms can be implemented using Java Spaces technology.