Sciweavers

1503 search results - page 44 / 301
» Self-optimizing distributed trees
Sort
View
ENTCS
2006
117views more  ENTCS 2006»
13 years 9 months ago
Distributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
Bilel Derbel, Mohamed Mosbah
TVLSI
2002
107views more  TVLSI 2002»
13 years 9 months ago
Low-power clock distribution using multiple voltages and reduced swings
: Clock networks account for a significant fraction of the power dissipation of a chip and are critical to performance. This paper presents theory and algorithms for building a low...
Jatuchai Pangjun, Sachin S. Sapatnekar
NGC
1999
Springer
106views Communications» more  NGC 1999»
14 years 2 months ago
Watercasting: Distributed Watermarking of Multicast Media
We outline a scheme by which encrypted multicast audiovisual data may be watermarked by lightweight active network components in the multicast tree. Every recipient receives a slig...
Ian Brown, Colin Perkins, Jon Crowcroft
FORTE
2011
13 years 1 months ago
A Framework for Verifying Data-Centric Protocols
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
Yuxin Deng, Stéphane Grumbach, Jean-Fran&cc...
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 9 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang