Sciweavers

1422 search results - page 146 / 285
» How to measure a large open-source distributed system
Sort
View
HPDC
2005
IEEE
16 years 2 days ago
A new metric for robustness with application to job scheduling
Scheduling strategies for parallel and distributed computing have mostly been oriented toward performance, while striving to achieve some notion of fairness. With the increase in ...
Darin England, Jon B. Weissman, Jayashree Sadagopa...
HIPC
2000
Springer
15 years 10 months ago
Applying Patterns to Improve the Performance of Fault Tolerant CORBA
An increasing number of mission-critical, embedded, telecommunications, and financial distributed systems are being developed using distributed object computing middleware, such a...
Balachandran Natarajan, Aniruddha S. Gokhale, Shal...
RTCSA
2003
IEEE
15 years 11 months ago
Introducing Temporal Analyzability Late in the Lifecycle of Complex Real-Time Systems
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by c...
Anders Wall, Johan Andersson, Jonas Neander, Chris...
CIKM
2009
Springer
16 years 1 months ago
Collaborative filtering using random neighbours in peer-to-peer networks
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
Arno Bakker, Elth Ogston, Maarten van Steen
TIT
2010
143views Education» more  TIT 2010»
15 years 1 months ago
Asynchronous CDMA systems with random spreading-part I: fundamental limits
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
Laura Cottatellucci, Ralf R. Müller, Mé...