Sciweavers

1296 search results - page 127 / 260
» Exploiting communication concurrency on high performance com...
Sort
View
CN
2007
148views more  CN 2007»
14 years 11 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
INFOCOM
2007
IEEE
15 years 5 months ago
Non-Cooperative Scheduling of Multiple Bag-of-Task Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we analyze the behavior of K non-cooperative schedu...
Arnaud Legrand, Corinne Touati
CN
2006
91views more  CN 2006»
14 years 11 months ago
Reputation-based policies that provide the right incentives in peer-to-peer environments
Peer-to-peer are popular environments for exchanging services. A reputation mechanism is a proper means of discovering low-performing peers that fail to provide their services. In...
Thanasis G. Papaioannou, George D. Stamoulis
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 1 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
PPOPP
2012
ACM
13 years 6 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao