Sciweavers

11212 search results - page 2094 / 2243
» Semi-persistent Data Structures
Sort
View
INFOCOM
2007
IEEE
15 years 9 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo
124
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
105
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
Shape Segmentation and Applications in Sensor Networks
—Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed uniformly inside a simple geometric region. When the real deployment deviates fr...
Xianjin Zhu, Rik Sarkar, Jie Gao
146
Voted
IPPS
2007
IEEE
15 years 9 months ago
A Portable Framework for High-Speed Parallel Producer/Consumers on Real CMP, SMT and SMP Architectures
This paper explores generating efficient, portable HighSpeed Producer Consumer (HSPC) code on current shared memory architectures: Chip Multi-Processors (CMP), Simultaneous Multi...
Richard T. Saunders, Clinton L. Jeffery, Derek T. ...
90
Voted
IPPS
2007
IEEE
15 years 9 months ago
Scheduling Issues in Optimistic Parallelization
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
Milind Kulkarni, Keshav Pingali
« Prev « First page 2094 / 2243 Last » Next »