Sciweavers

845 search results - page 143 / 169
» Diagnosabilities of regular networks
Sort
View
SSS
2007
Springer
121views Control Systems» more  SSS 2007»
14 years 2 months ago
Byzantine Self-stabilizing Pulse in a Bounded-Delay Model
Abstract. “Pulse Synchronization” intends to invoke a recurring distributed event at the different nodes, of a distributed system as simultaneously as possible and with a freq...
Danny Dolev, Ezra N. Hoch
MICRO
2003
IEEE
116views Hardware» more  MICRO 2003»
14 years 1 months ago
Universal Mechanisms for Data-Parallel Architectures
Data-parallel programs are both growing in importance and increasing in diversity, resulting in specialized processors targeted at specific classes of these programs. This paper ...
Karthikeyan Sankaralingam, Stephen W. Keckler, Wil...
IPPS
1999
IEEE
14 years 5 days ago
Run-Time Selection of Block Size in Pipelined Parallel Programs
Parallelizing compiler technology has improved in recent years. One area in which compilers have made progress is in handling DOACROSS loops, where crossprocessor data dependencie...
David K. Lowenthal, Michael James
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 8 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Bruno F. Ribeiro, Donald F. Towsley
PLDI
2011
ACM
12 years 10 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...