Search
Now showing items 11-20 of 49
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 ...
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 ...
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 ...
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 ...
Experimental Studies On A New Class Of Combinatorial LDPC Codes
(2009-06-05)
We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth graph construction technique, and study the performance of the codes so constructed on ...
Hyperplane Partitioning : An Approach To Global Data Partitioning For Distributed Memory Machines
(Indian Institute of Science, 2005-12-07)
Automatic Global Data Partitioning for Distributed Memory Machines (DMMs)
is a difficult problem. Distributed memory machines are scalable,
but since the memory is distributed across processors, the scheme
of placement ...
An Environment for Automatic Generation of Code Optimizers
(Indian Institute of Science, 2005-03-11)
Code optimization or code transformation is a complex function of a compiler involving analyses and modifications with the entire program as its scope. In spite of its complexity, hardly any tools exist to support this ...
A Study of the Performance Benefits of Controlling Parallel Asynochrous Iteractive Applications
(Indian Institute of Science, 2005-03-11)
High performance networks of workstation are becoming increasingly popular a parallel computing platform because of their lower cost. Both message passing and software distributed shared memory (DSM) programming paradigms ...
TriSL: A Software Architecture Description Language and Environment
(Indian Institute of Science, 2005-03-14)
As the size and complexity of a software system increases, the design problem goes beyond the algorithms and data structures of the computation. Designing and specifying the overall system structure -- or software architecture ...

