1995
Authors
deMoura, FS;
Publication
COMPUTING SYSTEMS IN ENGINEERING
Abstract
Parallel systems are not necessarily special-purpose machines. Al present, most departmental servers already resort to shared memory multiprocessing as a means to increase performance, while a network of workstations can also be regarded as a distributed memory parallel system. This paper examines the support offered by the operating system to exploit such parallelism. After discussing the design of multi-threaded programs in a Unix environment, a comparison is made with their distributed counterparts. Some performance figures obtained on a SparcCenter 2000 multiprocessor, on a network of workstations and on a transputer-based system are presented.
2001
Authors
Brito, L; Neves, J; Moura, F;
Publication
E-BUSINESS AND VIRTUAL ENTERPRISES: MANAGING BUSINESS-TO-BUSINESS COOPERATION
Abstract
Emerging technologies that allow a two-way communication between companies, or among companies and their customers, are changing the rules of the market, facilitating the emergence of virtual entities that have to be supported by some kind of platform. Making it is the main objective of this work, materialized in a Mobile Agent Architecture (MAA) which supports the emerging world of the m-Commerce (mobile-Commerce): the MAgnUM architecture, The MAA's development was based on the principles of process and knowledge abstraction, compositionality, reuse, formal semantics, formal evaluation, and security.
1994
Authors
BAQUERO, C; MOURA, F;
Publication
SIGPLAN NOTICES
Abstract
This paper describes CA/C++, Concurrency Annotations in C++, a language extension that regulates method invocations from multiple threads of execution in a shared-memory multiprocessor system. This system provides threads as an orthogonal element to the language, allowing them to travel through more than one object. Statically type-ckecked synchronous and asynchronous method invocations are supported, with return values from asynchronous invocations accessed through first claw future-like objects. Method invocations are regulated with synchronization code defined in a separate class hierarchy, allowing separate definition and inheritance of synchronization mechanisms. Each method is protected by an access flag that can be switched in pre and post-actions, and by a predicate. Both must evaluate to true in order to enable a thread to animate the method code. Flags and method predicates are independently redefinable along the inheritance chain, thus avoiding the inheritance anomaly.
1998
Authors
Baquero, C; Moura, F;
Publication
Mobile Computing and Communications Review
Abstract
1999
Authors
Baquero, C; Moura, F;
Publication
Operating Systems Review
Abstract
2000
Authors
Preguiça, NM; Baquero, C; Moura, F; Martins, JL; Oliveira, RC; Domingos, HJL; Pereira, JO; Duarte, S;
Publication
Current Issues in Databases and Information Systems, East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications, ADBIS-DASFAA 2000, Prague, Czech Republic, September 5-8, 2000, Proceedings
Abstract
In this paper we describe a transaction management system designed to face the inherent characteristics of mobile environments. Mobile clients cache subsets of the database state and allow disconnected users to perform transactions independently. Transactions are specified as mobile transactional programs that are propagated and executed in the server, thus allowing the validation of transactions based on application-specific semantics. In the proposed model (as in others previously presented in literature) the final result of a transaction is only determined when the transaction is processed in the central server. Users may be notified of the results of their transactions using system support (even when they are no longer using the same application or even the same computer). Additionally, the system implements a reservation mechanism in order to guarantee the results of transactions performed in disconnected computers. © Springer-Verlag Berlin Heidelberg 2000.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.