MemSpaces: Evaluating the Tuple Space Paradigm in the Context of Memory-Centric Architectures

Data analytics applications handle large data sets subject to multiple processing phases, some of which can execute in parallel on clusters, grids or clouds. Such applications can benefit from using MapReduce model, only requiring the end-user to define the application algorithms for input data processing and the map and reduce functions, but this poses a need to install/configure specific frameworks such as Apache Hadoop or Elastic MapReduce in Amazon Cloud. In order to provide more flexibility in defining and adjusting the application configurations, as well as in the specification of the composition of the application phases and their orchestration, the authors describe an approach for supporting MapReduce stages as sub-workflows in the AWARD framework (Autonomic Workflow Activities Reconfigurable and Dynamic). The authors discuss how a text mining application is represented as a complex workflow with multiple phases, where individual workflow nodes support MapReduce computations. Access to intermediate data produced during the MapReduce computations is supported by a data sharing abstraction. The authors describe two implementations of this abstraction, one based on a shared tuple space and another based on an in-memory distributed key/value store. The authors describe the implementation of the framework, a set of developed tools, and our experimentation with the execution of the text mining algorithm over multiple Amazon EC2 (Elastic Compute Cloud) instances, and report on the speed-up and size-up results obtained up to 20 EC2 instances and for different corpus sizes, up to 97 million words.

Download Full-text

New Fields in Classifying Algorithms for Content Awareness

International Journal of Information Technology and Web Engineering ◽

10.4018/jitwe.2012040101 ◽

2012 ◽

Vol 7 (2) ◽

pp. 1-15

Author(s):

Radu-Dinel Miruta ◽

Cosmin Stanuica ◽

Eugen Borcoci

Keyword(s):

Packet Classification ◽

Tuple Space ◽

New Approach ◽

Data Packets ◽

Server Side ◽

The Media ◽

Bit Vector ◽

Edge Router ◽

Content Aware

The content aware (CA) packet classification and processing at network level is a new approach leading to significant increase of delivery quality of the multimedia traffic in Internet. This paper presents a solution for a new multi-dimensional packet classifier of an edge router, based on content - related new fields embedded in the data packets. The technique is applicable to content aware networks. The classification algorithm is using three new packet fields named Virtual Content Aware Network (VCAN), Service Type (STYPE), and U (unicast/multicast) which are part of the Content Awareness Transport Information (CATI) header. A CATI header is inserted into the transmitted data packets at the Service/Content Provider server side, in accordance with the media service definition, and enables the content awareness features at a new overlay Content Aware Network layer. The functionality of the CATI header within the classification process is then analyzed. Two possibilities are considered: the adaptation of the Lucent Bit vector algorithm and, respectively, of the tuple space search, in order to respond to the suggested multi-fields classifier. The results are very promising and they prove that theoretical model of inserting new packet fields for content aware classification can be implemented and can work in a real time classifier.

Download Full-text

A Dependable Infrastructure for Cooperative Web Services Coordination

International Journal of Web Services Research ◽

10.4018/jwsr.2010040103 ◽

2010 ◽

Vol 7 (2) ◽

pp. 43-64 ◽

Cited By ~ 1

Author(s):

Eduardo Adilio Pelinson Alchieri ◽

Alysson Neves Bessani ◽

Joni da Silva Fraga

Keyword(s):

Web Services ◽

Web Service ◽

Current Trend ◽

Coordination Mechanisms ◽

Tuple Space ◽

Coordination Model ◽

Intrusion Tolerant ◽

A Current ◽

The Web

A current trend in the web services community is to define coordination mechanisms to execute collaborative tasks involving multiple organizations. Following this tendency, in this paper the authors present a dependable (i.e., intrusion-tolerant) infrastructure for cooperative web services coordination that is based on the tuple space coordination model. This infrastructure provides decoupled communication and implements several security mechanisms that allow dependable coordination even in presence of malicious components. This work also investigates the costs related to the use of this infrastructure and possible web service applications that can benefit from it.

Download Full-text

Typed dataspace actors

Journal of Functional Programming ◽

10.1017/s0956796820000246 ◽

2020 ◽

Vol 30 ◽

Author(s):

SAM CALDWELL ◽

TONY GARNOCK-JONES ◽

MATTHIAS FELLEISEN

Keyword(s):

Design Patterns ◽

Type System ◽

Structural Type ◽

Storage Facility ◽

Tuple Space ◽

Common Goal ◽

Actor Model ◽

Shared Storage ◽

Erroneous Data ◽

Rule Out

Absatract Actors collaborate via message exchanges to reach a common goal. Experience has shown, however, that pure message-based communication is limiting and forces developers to use design patterns. The recently introduced dataspace actor model borrows ideas from the tuple space realm. It offers a tightly controlled, shared storage facility for groups of actors. In this model, actors assert facts that they wish to share and interests in such assertions. The dataspace notifies interested parties of changes to the set of assertions that they are interested in. Although it is straightforward to add the dataspace model to untyped languages, adding a typed interface is both necessary and challenging. Without restrictions on exchanged data, a faulty actor may propagate erroneous data through a malformed assertion, causing an otherwise well-behaved actor to crash—violating the key principle of failure isolation. A properly designed type system can prevent this scenario and rule out other kinds of uncooperative actors. This paper presents the first structural type system for the dataspace model of actors; it does not address the question of behavioral types for assertion-oriented protocols.

Download Full-text