Sciweavers

822 search results - page 3 / 165
» Contention in shared memory algorithms
Sort
View
ICDCS
2002
IEEE
14 years 14 days ago
Fast Collect in the absence of contention
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
Burkhard Englert, Eli Gafni
ICPPW
2006
IEEE
14 years 1 months ago
Dynamic Algorithm Selection in Parallel GAMESS Calculations
Applications augmented with adaptive capabilities are becoming common in parallel computing environments which share resources such as main memory, network, or disk I/O. For large...
Nurzhan Ustemirov, Masha Sosonkina, Mark S. Gordon...
WMTE
2002
IEEE
14 years 13 days ago
Pattern-Based Annotations on E-Books: From Personal to Shared Didactic Content
Our research aims at defining models and software tools in order to provide learners with a training memory. This memory is a computer-based space where a learner can organize and...
Cyrille Desmoulins, Dominique Mille
ISAAC
2009
Springer
114views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Good Programming in Transactional Memory
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
Raphael Eidenbenz, Roger Wattenhofer
ICPADS
2006
IEEE
14 years 1 months ago
Memory and Network Bandwidth Aware Scheduling of Multiprogrammed Workloads on Clusters of SMPs
Symmetric Multiprocessors (SMPs), combined with modern interconnection technologies are commonly used to build cost-effective compute clusters. However, contention among processor...
Evangelos Koukis, Nectarios Koziris