Sciweavers

62 search results - page 3 / 13
» The Ackermann functions are not optimal, but by how much
Sort
View
IEEEINTERACT
2003
IEEE
13 years 10 months ago
High Performance Code Generation through Lazy Activation Records
For call intensive programs, function calls are major bottlenecks during program execution since they usually force register contents to be spilled into memory. Such register to m...
Manoranjan Satpathy, Rabi N. Mahapatra, Siddharth ...
ICDE
2005
IEEE
113views Database» more  ICDE 2005»
14 years 6 months ago
On the Optimal Ordering of Maps and Selections under Factorization
The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs b...
Thomas Neumann, Sven Helmer, Guido Moerkotte
POPL
2010
ACM
14 years 2 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
SIGCOMM
2012
ACM
11 years 7 months ago
Multi-resource fair queueing for packet processing
Middleboxes are ubiquitous in today’s networks and perform a variety of important functions, including IDS, VPN, firewalling, and WAN optimization. These functions differ vastl...
Ali Ghodsi, Vyas Sekar, Matei Zaharia, Ion Stoica
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
13 years 6 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin