As communication networks grow, existing fault handling tools that involve global measures such as global time-outs or reset procedures become increasingly unaffordable, since their cost grows with the size of the net...
详细信息
As communication networks grow, existing fault handling tools that involve global measures such as global time-outs or reset procedures become increasingly unaffordable, since their cost grows with the size of the network. Rather, for a fault handling mechanism to scale to large networks, its cost must depend only on the number of failed nodes (which, thanks to today's technology, grows much slower than the networks). Moreover, it should allow the non-faulty regions of the networks to continue their operation even during the recovery of the faulty parts. This abstract introduces the concepts fault locality, and of fault-locally mendable problems, which are problems for which there exist correction algorithms (applied after faults) whose cost depends only on the (unknown) number of faults. We show that any problem is fault locally mendable. The solution involves a novel technique combining data structures and 'local votes' among nodes, that may be of interest in itself.
The U-Net communication architecture provides processes with a virtual view of a network interface to enable user-level access to high-speed communication devices. The architecture, implemented on standard workstation...
详细信息
The proceedings contain 38 papers. The topics discussed include: contention-free complexity of shared memory algorithms;making operations of concurrent data types fast;open systems in TLA;delimiting the power of bound...
ISBN:
(纸本)0897916549
The proceedings contain 38 papers. The topics discussed include: contention-free complexity of shared memory algorithms;making operations of concurrent data types fast;open systems in TLA;delimiting the power of bounded size synchronization objects;wait-freedom vs. bounded wait-freedom in public data structures;ENF event predicate detection in distributed systems;repeatable and portable message-passing programs;mixed consistency: a model for parallel programming;using belief to reason about cache coherence;global flush communication primitive communication;multimedia networking: applications and challenges;a performance evaluation of lock-free synchronization protocols;disjoint-access-parallel implementations of strong shared memory primitives;time-optimal message-efficient work performance in the presence of faults;using k-exclusion to implement resilient, scalable shared objects;coins, weights and contention in balancing networks;resilience of general interactive tasks;asynchronous secure computations with optimal resilience;a combinatorial treatment of balancing networks;and memory-efficient and self-stabilizing network reset.
Data-parallel languages, such as High Performance Fortran, are widely regarded as a promising means for writing portable programs for distributed-memory machines. Novel features of these languages call for the develop...
ISBN:
(纸本)9780897917001
Data-parallel languages, such as High Performance Fortran, are widely regarded as a promising means for writing portable programs for distributed-memory machines. Novel features of these languages call for the development of new techniques in both compilers and run-time systems. In this paper, we present an improved algorithm for finding the local memory access sequence in computations involving regular sections of arrays with cyclic(k) distributions. After establishing the fact that regular section indices correspond to elements of an integer lattice, we show how to find a lattice basis that allows for simple and fast enumeration of memory accesses. The complexity of our algorithm is shown to be lower than that of the previous solution for the same problem. In addition, the experimental results demonstrate the efficiency of our method in practice.
暂无评论