ETD at Indian Institute of Science
(529 recursos)
Repository of Theses and Dissertations of Indian Institute of Science, Bangalore, India. The repository has been developed to capture, disseminate and preserve research theses of Indian Institute of Science.
Mostrando recursos 1 - 20 de 46
1.
An Implementation of Cross Architecture Procedure Call - Laeeq, Khan M
workstations are ideally suited for computing jobs which require an interactive environment because they are basically single user machines and hence provide consistent response time.
Another factor is the availability of many peripheral devices such as mice and light pens etc., which render workstations more user friendly for interactive jobs. However workstations are not suitable for highly compute intensive jobs as they are basically uniprocessor machines operating at moderate frequencies. For such type of work, large mainframes or supercomputers are more suitable, but interactive use of these machines is not economically feasible. Further more devices like mice etc., are not...
2.
A Broadcast Cube-Based Multiprocessor Architecture for Solving Partial Differential Equations - Murthy, Siva Ram C
A large number of mathematical models in engineering and physical sciences employ Partial Differential Equations (PDEs). The sheer number of operations required in numerically integrating PDEs in these applications has motivated the search for faster methods of computing. The conventional uniprocessor computers are often unable to fulfill the performance requirements for these computation intensive problems. In this dissertation, a cost-effective message-based multiprocessor system which we call the Broadcast Cube System (BCS) has been proposed for solving important computation intensive problems such as, systems of linear algebraic equations and PDEs. A simulator for performance evaluation of parallel algorithms to be executed...
3.
ACE-Model: A Conceptual Evolutionary Model For Evolutionary Computation And Artificial Life - Dukkipati, Ambedkar
Darwinian Evolutionary system - a system satisfying the abstract conditions: reproduction with heritable variation, in a finite world, giving rise to Natural Selection encompasses a complex and subtle system of interrelated theories, whose substantive transplantation to any artificial medium let it be mathematical model or computational model - will be very far from easy. There are two motives in bringing Darwinian evolution into computational frameworks: one to understand the Darwinian evolution, and the other is to view Darwinian evolution - that carries out controlled adaptive-stochastic search in the space of all possible DNA-sequences for emergence and improvement of the living...
4.
Kernel Methods Fast Algorithms and real life applications - Vishwanathan, S V N
Support Vector Machines (SVM) have recently gained prominence in the field of machine learning and pattern classification (Vapnik, 1995, Herbrich, 2002, Scholkopf and Smola, 2002). Classification is achieved by finding a separating hyperplane in a feature space, which can be mapped back onto a non-linear surface in the input space. However, training an SVM involves solving a quadratic optimization problem, which tends to be computationally intensive. Furthermore, it can be subject to stability problems and is non-trivial to implement. This thesis proposes an fast iterative Support Vector training algorithm which overcomes some of these problems.
Our algorithm, which we christen Simple...
5.
Adaptive Hierarchial RAID - Muppalaneni, Nitin
Redundant Arrays of Inexpensive Disks or RAID is a popular method of improving the reliability and performance of disk storage. Of various levels of RAID, mirrored or RAID1 and rotating parity or RAID5 configurations have become moat popular. Mirrored or RAID1 provides best overall performance and is easier to configure, but has 100 percent storage overhead for the redundancy. Rotating parity or RAID5, on the other hand, is quite inexpensive for the redundancy it provides, shorn impressive performance for reads and full-stripe writes in normal mode, but the small write performance is poor due to the read-modify-write cycle involved. The...
6.
Adaptive Selective Flooding Qos Routing - Porwal, Rupesh
The routing strategy used in today's Internet is best-effort service, where all data packets are treated equally. This type of service is not suited for applications such as video conferencing, and video on demand, that requires the availability of certain resources (such as bandwidth) to be guaranteed for them to function properly. The routing in this context, called Quality-of-Service (QoS) Routing, is the problem of finding suitable paths that meet the application's resource requirements.
The majority of proposed QoS routing schemes operate by maintaining the global state of the network, and using this knowledge to compute the QoS route. However,...
7.
Architecture, Performance and Applications of a Hierarchial Network of Hypercubes - Kumar, Mohan J
This thesis, presents a multiprocessor topology, the hierarchical network of hyper-cubes, which has a low diameter, low degree of connectivity and yet exhibits hypercube like versatile characteristics. The hierarchical network of hyper-cubes consists of k-cubes interconnected in two or more hierarchical levels. The network has a hierarchical, expansive, recursive structure with a constant pre-defined building block. The basic building block of the hierarchical network of hyper-cubes comprises of a k-cube of processor elements and a network controller. The hierarchical network of hyper-cubes retains the positive features of the k-cube at different levels of hierarchy and has been found to perform...
8.
Experiments with the pentium Performance monitoring counters - Agarwal, Gunjan
Performance monitoring counters are implemented in most recent microprocessors. In this thesis, we describe various performance measurement experiments for a program and a system that we conducted on a Linux operating system using the Pentium performance counters. We carried out our performance measurements on a Pentium II microprocessor. The Pentium II performance counters can be configured to count events such as cache misses, TLB misses, instructions executed etc. We used a low intrusive overhead technique to access these performance counters.
We used these performance counters to measure the cache miss overheads due to context switches in Linux system. Our methodology involves...
9.
Design and Implementation of an Authentication and Authorization Framework for a Nomadic Service Delivery System - Das, Devaraj
Internet has changed our lives. It has made the true distributed computing paradigm a reality. It has opened up a lot of opportunities both in the research domain and in business domain. One can now think of developing software and make it available to the large community of users. Hyper Text Transfer Protocol (HTTP), which was originally developed for the purpose of requesting/transferring content (text, images, etc.), is now a standard for remotely invoking services and getting back results.
The wireless technologies have also matured. 802.11 is the existing standard for wireless communication in a LAN environment. Today, even the...
10.
Language Support for Exploiting Software Structure Specifications - Kumar, Bharath M
Precise specification of the architecture and design of software is a good practice. Such
specifications contain a lot of information about the software that can potentially be exploited by
tools, to reduce redundancy in software writing by automating routine tasks, as well as giving
valuable feedback on the software. We first broadly classify such tools based on their application,
and look at some of the issues involved in writing them. Most of these tools are built using
conventional programming languages that do not provide primitives that are routinely required by
such tools. We identify some patterns that are seen while writing such tools and abstract them...
11.
Implementation Of Database Security Features Using Bit Matrices - Gopal, K
Information security is of utmost concern in a multiuser environment. The importance of security is felt much more with the widespread use of distributed database. Information is by itself a critical resource of an enterprise and thus the successful operation of an enterprise demands that data be made accessible only by authorized users and that the data be made to reflect the state of the enterprise.
Since many databases are online, accessed by multiple users concurrently, special mechanisms are needed to insure integrity and security of relevant information, This thesis describes a model for computer database security that supports a wide...
12.
Hierarchical Data Structures for Pattern Recognition - Choudhury, Sabyasachy
Pattern recognition is an important area with potential applications in computer vision, Speech understanding, knowledge engineering, bio-medical data classification, earth sciences, life sciences, economics, psychology, linguistics, etc. Clustering is an unsupervised classification process corning under the area of pattern recognition. There are two types of clustering approaches:
1) Non-hierarchical methods 2) Hierarchical methods. Non-hierarchical algorithms are iterative in nature and. perform well in the context of isotropic clusters. Time-complexity of these algorithms is order of (0 (n) ) and above, Hierarchical agglomerative algorithms, on the other hand, are effective when clusters are non-isotropic. The single linkage method of hierarchical category produces...
13.
TriSL: A Software Architecture Description Language and Environment - Lakshminarayanan, R
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 --
becomes the central problem. A system's architecture provides a model of the
system that hides implementation detail, allowing the architect to concentrate on the analyses and decisions that are most crucial to structuring
the system to satisfy its requirements.
Unfortunately, with few exceptions, current exploitation of software architecture and architectural style is informal and ad hoc.
The lack of an explicit, independent characterization of architecture and architectural style significantly limits...
14.
A Compiler and Symbolic Debugger for Occam - Chelliah, M
We have implemented Occam, a parallel programming language, on a uniprocessor machine (MC-68020 based HORIZON I11 running on UNIX system V.2) with simulated concurrency. Occam is a descendant of CSP with a few convenient modifications like channels used for communication and procedures. Two additions to the original language, i.e., output guards and recursion have been proposed. Front end of the compiler was developed using LEX and YACC. An innovative code generator, generator based on tree pattern matching has been used to generate the back end of the compiler, which generates efficient MC-68020 assembly code. A kernel for process administration is...
15.
A Study of the Performance Benefits of Controlling Parallel Asynochrous Iteractive Applications - Joseph, P J
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 have been developed and employed on such distributed hardware platforms. An important performance bottleneck in these systems is the effective data transmission latency, which is poorer than in high-speed parallel computer interconnection networks.
Iterative algorithms are used in a large class of applications like solution of partial algorithms are used, optimization problems, solutions to systems of linear equations, and so on. These can be parallelized in a straight-forward fashion with cad1 node...
16.
A Parallelizing Compiler for Fortran - Janaki, S
With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the work of a programmer these systems. Data parallel languages like Fortran D, Vienna Fortran, High Performance Fortran and C+ allow the user to specify data distribution across processor with some directives, and the compiler for these language use the directives to compile the programme in to an SPMD code. There are number of old program which are still in use and rewriting them in to new data parallel languages is a costly effort.
Most of the work on these parallelizing compilers concentrate on efficient data...
17.
Design and Implementation of Java Virtual Machine - Mandal, Abhijit
Interpretation of Java bytecode results in slow execution of program.First version of Java Virtual Machine(JVM) implementation was relied
on interpretation techniques. On the other hand performance can be improved by translating the Java bytecode into machine code by a Just-In-Time(JIT) compiler and this technique is being integrated into most JVM implementations.
Java is an automatic garbage collected language, freeing the programmer from the explicit memory management. Garbage collection "pause" time can
be reduced by using a generational garbage collection.
This thesis describes an implementation of a JVM. The specific contributions made in this thesis include: development of a Just-In-Time(JIT) compiler using DAG...
18.
Architecture Descriptions for Retargetable Code Translation - Ravindra, D V
The study of architectural parameterization has long neglected other parameterizations in favour of code selector descriptions.
In this dissertation, we are concerned with providing linguistic notations for modelling architectures with special emphasis on
translation. We focus on high level descriptions to aid code selection and storage allocation. The view taken in the thesis is that a description specializes a framework with a particular architecture. Independently, the framework must support other translation algorithms without constraining their freedom or forcing them towards architecture-specific idioms.
The first contribution is an architectural description language with features tuned towards better parameterizability. Emphasis is laid on addressing...
19.
An Environment for Automatic Generation of Code Optimizers - Paleri, Vineeth Kumar
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 function of the
compiler. This thesis presents the development of a code transformation system, specifically for scalar transformations, which can be used either as a tool to assist the generation of code transformers or as an environment for experimentation with code transformations.
The development of the code transformation system involves the formal specification of code transformations using dependence relations. We have written formal specifications for the...
20.
A Knowledge-Based Approach To Pattern Clustering - Shekar, B
The primary objective of this thesis is to develop a methodology for clustering of objects based on their functionality typified by the notion of concept.
We begin by giving a formal definition of concept. By assigning a functional interpretation to the underlying concept, we demonstrate the applicability of the functionally interpreted concept for clustering objects. This functional interpretation leads us to identifying two classes of concepts, namely, the Necessary class and the Quality-Improvement class. Next, we categorize the functional cohesiveness among objects into three different classes. Further, we axiomatize the restrictions imposed, on the execution of functions of objects, by the...
1.
