Sciweavers

4356 search results - page 94 / 872
» Communicating Transactions - (Extended Abstract)
Sort
View
ISCIS
2003
Springer
15 years 3 months ago
Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices
Abstract. We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partitioning of sparse matrices for parallel processing. In the first phase...
Bora Uçar, Cevdet Aykanat
EUROPAR
1995
Springer
15 years 1 months ago
Communication in Multicomputers with Nonconvex Faults
Abstract. Enhancingcurrentmulticomputerrouters for fault-tolerant routing with modest increasein routing complexity and resource requirements is addressed. The proposed method hand...
Suresh Chalasani, Rajendra V. Boppana
ICONIP
2004
14 years 11 months ago
Genetic Algorithm for Optimal Imperceptibility in Image Communication Through Noisy Channel
Abstract. Data embedding in digital images involves a trade off relationship among imperceptibility, robustness, data security and embedding rate etc. Genetic Algorithms (GA) can b...
Santi P. Maity, Malay Kumar Kundu, Prasanta Kumar ...
VLDB
2000
ACM
113views Database» more  VLDB 2000»
15 years 1 months ago
The Zero Latency Enterprise
Today's Internet economy has primed customers to expect immediate access and immediate results. But instant results are difficult to achieve when your customers want up-to-th...
Dave Liles
POPL
2009
ACM
15 years 4 months ago
Comparing the performance of concurrent linked-list implementations in Haskell
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
Martin Sulzmann, Edmund S. L. Lam, Simon Marlow