Search
Now showing items 121-130 of 546
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 ...
Fast Actively Secure OT Extension for Short Secrets
(2018-05-25)
Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and special-purpose problems ...
An Improved Lower Bound for Depth four Arithmetic Circuits
(2018-05-29)
We study the problem of proving lower bounds for depth four arithmetic circuits. Depth four circuits have been receiving much attraction when it comes to recent circuit lower bound results, as a result of the series of ...
Large Scale Graph Processing in a Distributed Environment
(2018-05-25)
Graph algorithms are ubiquitously used across domains. They exhibit parallelism, which can be exploited on parallel architectures, such as multi-core processors and accelerators. However, real world graphs are massive in ...
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 ...
Improving Last-Level Cache Performance in Single and Multi-Core Processsors
(2018-04-23)
With off-chip memory access taking 100's of processor cycles, getting data to the processor in a timely fashion remains one of the key performance bottlenecks in current systems. With increasing core counts, this problem ...
Rainbow Colouring and Some Dimensional Problems in Graph Theory
(2018-04-05)
This thesis touches three different topics in graph theory, namely, rainbow colouring, product dimension and boxicity.
Rainbow colouring An edge colouring of a graph is called a rainbow colouring, if every pair of vertices ...
Outlier Detection with Applications in Graph Data Mining
(2018-04-24)
Outlier detection is an important data mining task due to its applicability in many contemporary applications such as fraud detection and anomaly detection in networks, etc. It assumes significance due to the general ...
Constructing Provably Secure Identity-Based Signature Schemes
(2018-04-03)
An identity-based cryptosystem (IBC) is a public-key system where the public key can be represented by any arbitrary string such as an e-mail address. The notion was introduced by Shamir with the primary goal of simplifying ...
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 ...

