Search
Now showing items 1-10 of 15
Efficient Online Path Profiling
(2009-06-05)
Most dynamic program analysis techniques such as profile-driven compiler optimizations, software testing and runtime property checking infer program properties by profiling one or more executions of a program. Unfortunately, ...
Caching Techniques For Dynamic Web Servers
(2009-03-20)
Websites are shifting from static model to dynamic model, in order to deliver their users with dynamic, interactive, and personalized experiences. However, dynamic content generation comes at a cost – each request ...
Discovering Roles In The Evolution Of Collaboration Networks
(2009-04-02)
Searching the Web involves more than sifting through a huge graph of pages and hyperlinks. Specific collaboration networks have emerged that serve domain-specific queries better by exploiting the principles and patterns ...
A Mechanism Design Approach To Resource Procurement In Computational Grids With Rational Resource Providers
(2009-07-08)
A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities. In the presence of grid users who are autonomous, ...
Spill Code Minimization And Buffer And Code Size Aware Instruction Scheduling Techniques
(2009-05-19)
Instruction scheduling and Software pipelining are important compilation techniques which reorder instructions in a program to exploit instruction level parallelism. They are essential for enhancing instruction level ...
Superscalar Processor Models Using Statistical Learning
(2009-06-24)
Processor architectures are becoming increasingly complex and hence architects have to evaluate a large design space consisting of several parameters, each with a number of potential settings. In order to assist in guiding ...
Bounds On Augmented Automata And Quantum Adiabatic Optimization
(2009-05-25)
Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant results like an efficient algorithm for factoring and a ...
Computational Problems In Codes On Graphs
(2009-05-11)
Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code to be phrased as a computational problem on the corresponding ...
Optimizations In Storage Area Networks And Direct Attached Storage
(2009-07-23)
The thesis consists of three parts.
In the first part, we introduce the notion of device-cache-aware schedulers. Modern disk
subsystems have many megabytes of memory for various purposes such as prefetching and caching. ...
Design Of Incentive Compatible Mechanisms For Ticket Allocation In Software Maintenance Services
(2009-05-28)
Software Maintenance is becoming more and more challenging due to rapidly changing customer needs, technologies and need for highly skilled labor. Many problems that existed a decade ago continue to exist or have even ...