Sciweavers

1783 search results - page 317 / 357
» Low-Complexity Distributed Scheduling Algorithms for Wireles...
Sort
View
MOBIHOC
2003
ACM
16 years 1 months ago
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
Chao Gui, Prasant Mohapatra
ICPADS
2007
IEEE
15 years 8 months ago
Federated clusters using the transparent remote Execution (TREx) environment
- Due to the increasing complexity of scientific models, large-scale simulation tools often require a critical amount of computational power to produce results in a reasonable amou...
Richert Wang, Enrique Cauich, Isaac D. Scherson
MOBIHOC
2005
ACM
16 years 1 months ago
Link-layer salvaging for making routing progress in mobile ad hoc networks
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
Chansu Yu, Kang G. Shin, Lubo Song
LCN
2005
IEEE
15 years 7 months ago
Constructing Efficient Multi-hop Mesh Networks
The Wireless Channel-oriented Ad-hoc Multi-hop Broadband (W-CHAMB) is a new link layer protocol with the aim of being able to support Quality of Service (QoS) in multi-hop operati...
Rui Zhao, Bernhard Walke, Michael Einhaus
HIPC
2009
Springer
14 years 11 months ago
Optimizing the use of GPU memory in applications with large data sets
Abstract--With General Purpose programmable GPUs becoming more and more popular, automated tools are needed to bridge the gap between achievable performance from highly parallel ar...
Nadathur Satish, Narayanan Sundaram, Kurt Keutzer