CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems (2009)
Issarny, Valérie, Steffen, Bernhard, Jonsson, Bengt, Blair, Gordon, Grace, Paul, Kwiatkowska, Marta, ...
The CONNECT European project that started in February 2009 aims at dropping the interoperability barrier faced by today's distributed systems. It does so by adopting a revolutionary approach to the...
CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems (2009)
Issarny, Valérie, Steffen, Bernhard, Jonsson, Bengt, Blair, Gordon, Grace, Paul, Kwiatkowska, Marta, ...
The CONNECT European project that started in February 2009 aims at dropping the interoperability barrier faced by today's distributed systems. It does so by adopting a revolutionary approach to the...
Towards a Generic Autonomic Architecture for Legacy Resource Management (2008)
Abstract Half a decade has passed since the objectives and benefits of autonomic computing were stated, yet even the latest system designs and deployments exhibit only limited and isolated elements...
Cross-Trial Query System for Cancer Clinical Trials (2008)
Radu Calinescu, Steve Harris, Jeremy Gibbons, Jim Davies
Abstract Data sharing represents one of the key objectives and major challenges of today’s cancer research. CancerGrid, a consortium of clinicians, cancer researchers, computational biologists and...
Automatic Loop Parallelization in the BSP Model (1998)
This paper introduces a new scheme for the scheduling of generic, untightly nested loops on distributed-memory systems. Being targeted at the bulk-synchronous parallel (BSP) model of computation, the...
A BSP approach to the scheduling of tightly-nested loops (1997)
This paper addresses the scheduling of uniformdependence loop nests within the framework of the bulksynchronous parallel (BSP) model. Two broad classes of tightly-nested loops are identified in the...
BSP Scheduling of Regular Patterns of Computation (1997)
Radu Calinescu, Radu Calinescu
One of the major challenges of the current research in the field of parallel computing is the development of a realistic underlying framework for the design and programming of general purpose...
A BSP Scheduling Tool for Loop Nest Parallelisation (1997)
Radu Calinescu, Radu Calinescu
This report introduces BSPscheduler, a new tool for the automatic parallelisation of nested loops. The novel parallelisation tool generates bulk synchronous parallel (BSP) code, by automatically...
A Scheme for the BSP Scheduling of Generic Loop Nests (1997)
Radu Calinescu, Radu Calinescu
This report presents a scheme for the bulk-synchronous parallel (BSP) scheduling of generic, untightly nested loops. Being targeted at the BSP model of computation, the novel parallelisation scheme...
Bulk synchronous parallel algorithms for optimistic discrete event simulation (1996)
Radu Calinescu, Radu Calinescu
The optimistic approach to parallel discrete event simulation (PDES) has led to a number of algorithms capable of fully exploiting the inherent parallelism of discrete event systems. On the other...
Bulk Synchronous Parallel Scheduling of Uniform Dags (1996)
. This paper addresses the dag scheduling problem, proposing the bulk synchronous parallel (BSP) model as a framework for the derivation of general purpose parallel computer schedules of uniform...
Conservative Discrete-Event Simulations On Bulk Synchronous Parallel Architectures (1995)
Radu Calinescu, Radu Calinescu
All the parallel discrete-event simulation algorithms developed so far have been designed to suit a specific parallel model (e.g., a PRAM model, a MP-RAM model, etc.). This paper presents several...