Abstract
We define a lexically scoped, asynchronous and distributed p-calculus, with local communication and process migration. This calculus adopts the network-awareness principle for distributed programming and follows a simple model of distribution for mobile calculi: a lexical scope discipline combines static scoping with dynamic linking, associating channels to a fixed site throughout computation. This discipline provides for both remote invocation and process migration. A simple type system is a straightforward extension of that of the p-calculus, adapted to take into account the lexical scope of channels. An equivalence law captures the essence of this model: a process behavior depends on the channels it uses, not on where it runs. This work was partially supported by the Portuguese Fundação para a Ciencia e a Tecnologia (via CLC, the project MIMO, POSI/CHS/39789/2001, and scholarships POCTI/SFRH/BPD/6782/2001 and POSI/SFRH/BD/7100/20- 01), by the EU FEDER (via CLC) and the EU IST proactive initiative FET- Global Computing (projects Mikado, IST-2001-32222, and Profundis, IST- 2001-33100). We thank Gérard Boudol, Ilaria Castellani, Matthew Hennessy and Francisco Martins, as well as the anonymous referees, for their comments. © 2003 Published by Elsevier Science B.V.

Abstract
We describe a linear channel inference system for the TyCO programming language, where channel usage is tracked through method invocations as well as definition instantiations. We then apply linear channel information to optimize code generation for a multithreaded runtime system. The impact in terms of speed and space is analyzed. © 2003 Published by Elsevier Science B.V.

Abstract
We present MOB, a service-oriented scripting language, for programming mobile agents. We argue that combining the service-oriented and mobile agent paradigms provides a very natural model for programming a large class of distributed applications. In MOB, mobile agents in a network simultaneously provide and use services. The service interfaces constitute contracts that bind agents among themselves. The language features static type-checking to guarantee that contracts are respected at run-time. Other language features, such as redundant service providers, allow a certain degree of fault-tolerance by allowing applications to switch servers dynamically in case a failure is detected (e.g. a server crash). For these reasons, the target applications we envision more interesting to develop using MOB are services for networks with highly dynamic, volatile resources or simply highly adaptive, reconfigurable applications for more classical networks. The paper presents MOB and its implementation from an application programmer's and a systems developer's view. Copyright (C) 2007 John Wiley & Sons, Ltd.

Abstract

Abstract
In this paper we present the architecture of RTPM, a middle-ware framework aimed at supporting the development and management of information systems for high-speed public transportation systems. The framework is based on a peer-to-peer overlay infrastructure with the main focus being on providing a scalable, resilient, reconfigurable, highly available platform for real-time and QoS computing. Copyright 2008 ACM.

Abstract
The efficiency of scheduling algorithms is essential in order to attain optimal performances from parallel programming systems. In this paper we use a portable parallel programming environment we have implemented, the pSystem, to evaluate and compare the performance of various scheduling algorithms on shared memory parallel machines. © Springer-Verlag Berlin Heidelberg 1994.