Sciweavers

116 search results - page 11 / 24
» Fundamental Network Processor Performance Bounds
Sort
View
IPPS
1995
IEEE
13 years 10 months ago
Data parallel programming in an adaptive environment
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this...
Guy Edjlali, Gagan Agrawal, Alan Sussman, Joel H. ...
ASPLOS
1996
ACM
13 years 11 months ago
Reducing Network Latency Using Subpages in a Global Memory Environment
New high-speed networks greatly encourage the use of network memory as a cache for virtual memory and file pages, thereby reducing the need for disk access. Becausepages are the f...
Hervé A. Jamrozik, Michael J. Feeley, Geoff...
IPSN
2005
Springer
14 years 7 days ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 6 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
WASA
2010
Springer
288views Algorithms» more  WASA 2010»
13 years 5 months ago
Approaching the Optimal Schedule for Data Aggregation in Wireless Sensor Networks
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
Pei Wang, Yuan He, Liusheng Huang