8780 search results - page 188 / 1756 » On the Feasibility of Consistent Computations |
192
click to vote
SPAA
2003
ACM
16 years 13 days ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
170
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
178
click to vote
GG
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...
215
click to vote
STOC
2005
ACM
16 years 22 days ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
181
click to vote
MSS
2005
IEEE
16 years 23 days ago
2005
IEEE
Obtaining consistent bandwidth with predictable latency from disk-based storage systems has proven difficult due to the storage system’s inability to understand Quality of Serv...