Sciweavers

1485 search results - page 176 / 297
» Whole Program Paths
Sort
View
INFOCOM
2002
IEEE
14 years 2 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
ICC
2007
IEEE
139views Communications» more  ICC 2007»
14 years 28 days ago
Comparison of Protection Mechanisms: Capacity Efficiency and Recovery Time
High efficiency in capacity utilization and fast restoration are two primary goals of survivable design in optical networks. Shared backup path protection has been shown to be effi...
Wensheng He, Arun K. Somani
PLDI
2009
ACM
14 years 3 months ago
Trace-based just-in-time type specialization for dynamic languages
Dynamic languages such as JavaScript are more difficult to compile than statically typed ones. Since no concrete type information is available, traditional compilers need to emit...
Andreas Gal, Brendan Eich, Mike Shaver, David Ande...
VEE
2009
ACM
246views Virtualization» more  VEE 2009»
14 years 3 months ago
Tracing for web 3.0: trace compilation for the next generation web applications
Today’s web applications are pushing the limits of modern web browsers. The emergence of the browser as the platform of choice for rich client-side applications has shifted the ...
Mason Chang, Edwin W. Smith, Rick Reitmaier, Micha...
ISCA
1995
IEEE
120views Hardware» more  ISCA 1995»
14 years 18 days ago
Streamlining Data Cache Access with Fast Address Calculation
For many programs, especially integer codes, untolerated load instruction latencies account for a significant portion of total execution time. In this paper, we present the desig...
Todd M. Austin, Dionisios N. Pnevmatikatos, Gurind...