Sciweavers

570 search results - page 106 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
CLUSTER
2007
IEEE
13 years 8 months ago
Meta-communications in component-based communication frameworks for grids
— Applications are faced with several network-related problems on current grids: heterogeneous networks, firewalls, NAT, private IP addresses, non-routed networks, performance p...
Alexandre Denis
FCCM
2007
IEEE
122views VLSI» more  FCCM 2007»
14 years 20 days ago
Reconfigurable Computing Cluster (RCC) Project: Investigating the Feasibility of FPGA-Based Petascale Computing
While medium- and large-sized computing centers have increasingly relied on clusters of commodity PC hardware to provide cost-effective capacity and capability, it is not clear th...
Ron Sass, William V. Kritikos, Andrew G. Schmidt, ...
SOSP
2003
ACM
14 years 5 months ago
Samsara: honor among thieves in peer-to-peer storage
Peer-to-peer storage systems assume that their users consume resources in proportion to their contribution. Unfortunately, users are unlikely to do this without some enforcement m...
Landon P. Cox, Brian D. Noble
IPPS
1998
IEEE
14 years 1 months ago
Prioritized Token-Based Mutual Exclusion for Distributed Systems
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
Frank Mueller
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt