Sciweavers

1075 search results - page 64 / 215
» Parallel Programming with Transactional Memory
Sort
View
114
Voted
IPPS
1998
IEEE
15 years 6 months ago
Experimental Study of Compiler Techniques for NUMA Machines
This study1 explores the applicability of fully automatic parallelizing techniques for parallel computers. In this study, we capitalize on a variety of traditional compiling techn...
Yunheung Paek, David A. Padua
ICS
2010
Tsinghua U.
15 years 6 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
IPPS
2006
IEEE
15 years 8 months ago
Monitoring remotely executing shared memory programs in software DSMs
Peer-to-Peer (P2P) cycle sharing over the Internet has become increasingly popular as a way to share idle cycles. A fundamental problem faced by P2P cycle sharing systems is how t...
Long Fei, Xing Fang, Y. Charlie Hu, Samuel P. Midk...
IPPS
2006
IEEE
15 years 8 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...
115
Voted
FTCS
1998
91views more  FTCS 1998»
15 years 3 months ago
How Fail-Stop are Faulty Programs?
Most fault-tolerant systems are designed to stop faulty programs before they write permanent data or communicate with other processes. This property (halt-on-failure) forms the co...
Subhachandra Chandra, Peter M. Chen