Sciweavers

2110 search results - page 48 / 422
» What is the complexity of a distributed computing system
Sort
View
GRID
2007
Springer
15 years 10 months ago
Log summarization and anomaly detection for troubleshooting distributed systems
— Today’s system monitoring tools are capable of detecting system failures such as host failures, OS errors, and network partitions in near-real time. Unfortunately, the same c...
Dan Gunter, Brian Tierney, Aaron Brown, D. Martin ...
WOA
2003
15 years 5 months ago
Using a Properties Based Naming System in Mobile Agents Environments for Pervasive Computing
— Mobile Agents model is widely accepted as a good solution to simplify the coordination in a complex and distributed environment. Pervasive computing, presents many issues regar...
Fabio Tarantino, Alessio Ravani, Mario Zambrini
EUC
2007
Springer
15 years 10 months ago
Consensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
Jonathan Stephen Anderson, Binoy Ravindran, E. Dou...
PERCOM
2004
ACM
16 years 3 months ago
Programming Pervasive and Mobile Computing Applications with the TOTA Middleware
Pervasive computing calls for suitable middleware and programming models to deal with large software systems dived in dynamic mobile network environments. Here we present the prog...
Marco Mamei, Franco Zambonelli
CLUSTER
2003
IEEE
15 years 9 months ago
A General Self-Adaptive Task Scheduling System for Non-Dedicated Heterogeneous Computing
— The efforts to construct a national scale Grid computing environment have brought unprecedented computing capacity and complicacy. Exploiting this complex infrastructure requir...
Ming Wu, Xian-He Sun