Sciweavers

4311 search results - page 821 / 863
» Code Generation for Distributed Systems
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
ICS
2009
Tsinghua U.
14 years 2 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...
IWPSE
2007
IEEE
14 years 1 months ago
Talking tests: an empirical assessment of the role of fit acceptance tests in clarifying requirements
The starting point for software evolution is usually a change request, expressing the new or updated requirements on the delivered system. The requirements specified in a change ...
Filippo Ricca, Marco Torchiano, Mariano Ceccato, P...
ICS
2007
Tsinghua U.
14 years 1 months ago
Adaptive Strassen's matrix multiplication
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
Paolo D'Alberto, Alexandru Nicolau
IMC
2006
ACM
14 years 1 months ago
Rarest first and choke algorithms are enough
The performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rare...
Arnaud Legout, Guillaume Urvoy-Keller, Pietro Mich...