Search
Now showing items 51-60 of 124
Automatic Data Partitioning By Hierarchical Genetic Search
(Indian Institute of Science, 2005-12-07)
The introduction of languages like High Performance Fortran (HPF) which allow the programmer to indicate how the arrays used in the
program have to be distributed across the local memories of a multi-computer has not ...
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 ...
Algorithms For Efficient Implementation Of Secure Group Communication Systems
(2007-10-23)
A distributed application may be considered as a set of nodes which are spread across the network, and need to communicate with each other. The design and implementation of these distributed applications is greatly simplified ...
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 ...
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 ...
A Unified Approach to Quantitative Software Lifecycle Modeling
(Indian Institute of Science, 2005-04-06)
An evolutionary process currently taking place in engineering systems is the shift from hardware to software where the role of software engineering is becoming more central in developing large engineering systems. This ...