Sciweavers

11565 search results - page 391 / 2313
» Computing Minimal Mappings
Sort
View
CONEXT
2007
ACM
15 years 11 months ago
On the cost of caching locator/ID mappings
Very recent activities in the IETF and in the Routing Research Group (RRG) of the IRTG focus on defining a new Internet architecture, in order to solve scalability issues related ...
Luigi Iannone, Olivier Bonaventure
199
Voted
PODC
2010
ACM
15 years 11 months ago
Transactional predication: high-performance concurrent sets and maps for STM
Concurrent collection classes are widely used in multi-threaded programming, but they provide atomicity only for a fixed set of operations. Software transactional memory (STM) pr...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
HPCC
2009
Springer
15 years 11 months ago
Kahn Process Networks are a Flexible Alternative to MapReduce
Experience has shown that development using shared-memory concurrency, the prevalent parallel programming paradigm today, is hard and synchronization primitives nonintuitive becaus...
Zeljko Vrba, Pål Halvorsen, Carsten Griwodz,...
CCGRID
2006
IEEE
15 years 11 months ago
Mirroring Resources or Mapping Requests: Implementing WS-RF for Grid Workflows
The Web Services Resource Framework (WS-RF) and the Web Services Notification (WS-N) specifications are a crucial component of Grid infrastructures. They provide a standardized int...
Thomas Heinis, Cesare Pautasso, Gustavo Alonso
ISMB
1997
15 years 9 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey