DocumentCode :
1984493
Title :
Sorting Algorithms Implemented Using JavaSpaces
Author :
Muresan, Codruta
Author_Institution :
Dept. of Comput. Sci., Babes-Bolyai Univ., Cluj-Napcoa, Romania
fYear :
2012
fDate :
25-29 June 2012
Firstpage :
143
Lastpage :
147
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.
Keywords :
Java; object-oriented programming; parallel programming; software fault tolerance; sorting; Java implementation; JavaSpaces technology; fault-tolerance; network-accessible objects repository; objects flow; parallel computation applications; programming model; read objects; sorting algorithms; tuple-based system; Algorithm design and analysis; Arrays; Indexes; Partitioning algorithms; Program processors; Servers; Sorting; JavaSpaces; parallel procesing; sorting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Computing (ISPDC), 2012 11th International Symposium on
Conference_Location :
Munich/Garching, Bavaria
Print_ISBN :
978-1-4673-2599-8
Type :
conf
DOI :
10.1109/ISPDC.2012.27
Filename :
6341505
Link To Document :
بازگشت