Sciweavers

139 search results - page 14 / 28
» Bandwidth on AT-Free Graphs
Sort
View
ISCAS
2002
IEEE
124views Hardware» more  ISCAS 2002»
14 years 2 months ago
Performance optimization of multiple memory architectures for DSP
Multiple memory module architecture offers higher performance by providing potentially doubled memory bandwidth. Two key problems in gaining high performance in this kind of archi...
Qingfeng Zhuge, Bin Xiao, Edwin Hsing-Mean Sha
INFOCOM
2011
IEEE
13 years 1 months ago
Construction of directional virtual backbones with minimum routing cost in wireless networks
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wo...
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 9 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
INFOCOM
2008
IEEE
14 years 4 months ago
Swarming on Optimized Graphs for n-Way Broadcast
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
Georgios Smaragdakis, Azer Bestavros, Nikolaos Lao...
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