Three join algorithms are evaluated in an environment with distributed main-memory based mediators and data sources. A streamed ship-out join ships bulks of tuples to a mediator near a data source, followed by post-processing in the client. An extended streamed semi-join in addition builds a main-memory hash index in the client mediator. A ship-in algorithm materializes and joins the data in th...

This paper presents an overview of the field of distributed development of software systems and applications (DD). Based on an analysis of the published literature, including its use in different industrial contexts, we provide a preliminary analysis that structures existing DD knowledge, indicating opportunities but identifying threats to communication, coordination, and control caused by temp...

A distributed implementation of the functional language Objective Caml, to speed up functional computations by spawning tasks to diierent nodes in a cluster of computers, is instrumented for performance monitoring purposes. The gathered data will support and guide programmer's annotations and, nally, the strategy used by the scheduler to balance the workload. The architecture of the system is b...

This work demonstrates the potentialities of a simulated fault-injection based approach to the design of effective recovery strategies for distributed multimedia systems. Fault injection experiments are conducted on a simulated model of a real prototype of a Video on Demand (VoD) distributed application. The model is built by combining the basic objects of a simulation tool for dependability (r...

The amplification cycle of many replicators (natural or artificial) involves the usage of a host compartment, inside which the replicator express phenotypic compounds necessary to carry out its genetic replication. The compartment limits the diffusion of the intermediate compounds, thereby also maintaining the genotypephenotype linkage enabling natural selection. In most cases however, genotypi...

In this paper a number of alternative strategies for distributed/parallel association rule mining are investigated. The methods examined make use of a data structure, the T-tree, introduced previously by the authors as a structure for organising sets of attributes for which support is being counted. We consider six different approaches, representing different ways of parallelising the basic Apr...

While traditional databases have focused on single query evaluation in a centralized setting, emerging applications require continuous tracking of queries on data that is widely distributed and constantly updated. We describe such scenarios, and describe the challenges involved in designing communication-efficient protocols for the tracking tasks we define. We outline some solutions to these pr...

Distributed software development has resulted in formation of business partners spread across different economic, temporal, and organizational zones collaborating together for shared authorship of evolving software artifacts. However, the distributed approach is not without risks, and organizations implement specific test strategies to assist in the verification process of work-in-progress soft...