Sciweavers

241 search results - page 45 / 49
» Advanced Loop Optimizations for Parallel Computers
Sort
View
ICS
2005
Tsinghua U.
14 years 26 days ago
Lightweight reference affinity analysis
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
Xipeng Shen, Yaoqing Gao, Chen Ding, Roch Archamba...
DEBS
2007
ACM
13 years 11 months ago
Scalable event matching for overlapping subscriptions in pub/sub systems
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
CCGRID
2008
IEEE
14 years 1 months ago
Managing Cancellations and No-Shows of Reservations with Overbooking to Increase Resource Revenue
Advance reservation allows users to request available nodes in the future, whereas economy provides an incentive for resource owners to be part of the Grid, and encourages users t...
Anthony Sulistio, Kyong Hoon Kim, Rajkumar Buyya
BMCBI
2008
115views more  BMCBI 2008»
13 years 7 months ago
BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
George Chin Jr., Daniel G. Chavarría-Mirand...
PODC
2006
ACM
14 years 1 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...