Sciweavers

37 search results - page 2 / 8
» Worst-Case Analysis of Heap Allocations
Sort
View
CCECE
2009
IEEE
14 years 1 days ago
Application layer optimization for efficient video streaming over IEEE 802.11 based wireless networks
— Most of the existing video streaming systems employ the worst case analysis in application layer buffer size dimensioning. Even though the worst case buffer size dimensioning p...
Azfar Moid, Abraham O. Fapojuwo
PLDI
2005
ACM
13 years 11 months ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
RTS
2008
131views more  RTS 2008»
13 years 4 months ago
A constant-time dynamic storage allocator for real-time systems
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation ...
Miguel Masmano, Ismael Ripoll, Patricia Balbastre,...
DCC
2004
IEEE
14 years 4 months ago
Efficient Bit Allocation for Dependent Video Coding
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
Yegnaswamy Sermadevi, Sheila S. Hemami
ISPAN
2002
IEEE
13 years 10 months ago
On the Impact of Naming Methods for Heap-Oriented Pointers in C Programs
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...
Tong Chen, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew