River is a prototype I/O programming environment for large-scale cluster of workstations. The assignment of the data ow and its operators (called modules) to participating nodes is currently done statically before any processing starts. The ow is dynamic because some data can be routed to modules that are processing data faster. We introduce module migration (by migrating the underlying thread)...

This paper presents MPIAB, an agent based architecture for parallel processing. The architecture is developed to model the functions of standard MPI using java agents. It remedies the deficiencies that exist in MPI, including the incapability to operate in heterogeneous environments. The architecture also addresses other issues such as effective utilization of system resources by dynamically se...

We present a query processing procedure for conjunctive queries in distributed ontology systems where a large ontology is divided into ontology fragments that are later distributed over a set of autonomous nodes. We focus on ontologies with large ABoxes. The query processing procedure determines and retrieves the facts that are relevant to answering a given query from other nodes, then construc...

A perennial problem in vector overlay is fuzzy creep. Commercial vector overlay algorithms resolve near intersections of lines employing arbitrary node movement to align two chains at nodes selected randomly in the area of an epsilon band. While this solution is effective in reducing the number of sliver polygons, it introduces distortion. In some situations this distortion may be tolerable, bu...

The distributed processing systems contain many nodes connected into one logical structure that is able to perform the processing of given task. The task is submitted by the system operator – and from his point of view the system is inputted with a task, computing layer processes the task and the result is returned by the system. Such layer-oriented approach requires to design the operational m...

The paper deals with a generic model of a mobile agent network that includes multi-agent system, and a set of processing nodes connected by a communication network. A mobile agent network is described as a queuing system where mobile agents represent information units that must be served. Network flows related to agent hosting and migration and serving capabilities of processing nodes are propo...

Abstract: Exploring the features of network motifs as it provides different processing activities is significantly important. As network structure is applicable into different scientific and engineering fields, motifs (or significantly recurrent subgraphs) will clarify the different processing structures involved in the proposed organization. Herein, the indegree and outdegree of a motif are pr...

We consider a Jackson network in which some of the nodes have an infinite supply of work: when all the customers queued at such a node have departed, the node will process a customer from this supply. Such nodes will be processing jobs all the time, so they will be fully utilized and experience a traffic intensity of 1. We calculate flow rates for such networks, obtain conditions for stability,...

We consider a Jackson network in which some of the nodes have an infinite supply of work: When all the customers queued at such a node have departed, the node will process a customer from this supply. Such nodes will be processing jobs all the time, so they will be fully utilized and experience traffic intensity of 1. We calculate flow rates for such networks, obtain conditions for stability, a...

This demo showcase the Community Extraction Cloud (CEC) system. The key idea is to drop weak-tie nodes by efficiently extracting core nodes based on the novel concept of asymptotically equivalent structures (AES) and parallel AES mining algorithm. Meanwhile, to facilitate storing and processing of massive networks, several cloud computing technologies including HDFS, Katta, and Hama are seamles...