Sciweavers

2110 search results - page 264 / 422
» What is the complexity of a distributed computing system
Sort
View
FPGA
2004
ACM
137views FPGA» more  FPGA 2004»
15 years 10 months ago
Making visible the thermal behaviour of embedded microprocessors on FPGAs: a progress report
This paper shows a method to verifying the thermal status of complex FPGA-based circuits like microprocessors. Thus, the designer can evaluate if a particular block is working bey...
Sergio López-Buedo, Eduardo I. Boemo
EDOC
2008
IEEE
15 years 11 months ago
Achieving Business Process Flexibility with Business Rules
Business processes used in networked business are often large and complex, which makes them difficult to manage and change. In this paper we address this lack of flexibility by pr...
Tim van Eijndhoven, Maria-Eugenia Iacob, Mar&iacut...
ESOP
2004
Springer
15 years 10 months ago
A Dependently Typed Ambient Calculus
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to e...
Cédric Lhoussaine, Vladimiro Sassone
JDA
2008
85views more  JDA 2008»
15 years 4 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
ICDCS
1996
IEEE
15 years 8 months ago
Supporting a Flexible Parallel Programming Model on a Network of Workstations
We introduce a shared memory software prototype system for executing programs with nested parallelism on a network of workstations. This programming model exhibits a very convenie...
Shih-Chen Huang, Zvi M. Kedem