Add to ORKGThe memories of real life computers usually have a hierarchical structure with levels like registers, cache, main memory and disks. In contrast, the RAM model is based on a homogeneous memory, hence hidding an important source for speeding up programs, their locality. Locality means that algorithms can be implemented to run the faster the better they are adapted to mechanisms like blocking data or keeping currently used data in fast levels. We describe a model (MDMH) which reflects the most important features of computer memories and is despite of easy enough to design and analyse algorithms. We give MDMH algorithms for basic problems, e.g. maintaining heaps and sorting. Most of them can be proved to be optimal according to a modified measu...
A parameterized generic model that captures the features of diverse computer architectures would fac...
We prove an analogue of Brent's lemma for BSP-like parallel machines featuring a hierarchical struct...
) Sandeep Sen y Siddhartha Chatterjee z Submitted for publication Abstract We describe a model...
Processors have become faster at a much quicker rate than memory access time, creating wide gap betw...
In this paper we introduce parallel versions of two hierarchical memory models and give optimal algo...
In this thesis we study the limitations of data structures and how they can be overcome through care...
Modern computer systems usually have a complex memory system consisting of increasingly larger and ...
We present several e cient algorithms for sorting on the uniform memory hierarchy (UMH), introduced ...
This paper formulates and investigates the question of whether a given algorithm can be coded in a w...
The objective of this thesis is the unified investigation of a wide range of fundament...
In this work, we show that the submachine locality exposed by hierarchical bulksynchronous computati...
In order to mitigate the impact of the constantly widening gap between processor speed and main memo...
Abstract. We prove an analogue of Brent’s lemma for BSP-like parallel machines featuring a hierarchi...
The Hierarchical PRAM (H-PRAM) is a model of parallel computation which retains the ideal properties...
This paper investigates the design of parallel algorithmic strategies that address the efficient use...
A parameterized generic model that captures the features of diverse computer architectures would fac...
We prove an analogue of Brent's lemma for BSP-like parallel machines featuring a hierarchical struct...
) Sandeep Sen y Siddhartha Chatterjee z Submitted for publication Abstract We describe a model...
Processors have become faster at a much quicker rate than memory access time, creating wide gap betw...
In this paper we introduce parallel versions of two hierarchical memory models and give optimal algo...
In this thesis we study the limitations of data structures and how they can be overcome through care...
Modern computer systems usually have a complex memory system consisting of increasingly larger and ...
We present several e cient algorithms for sorting on the uniform memory hierarchy (UMH), introduced ...
This paper formulates and investigates the question of whether a given algorithm can be coded in a w...
The objective of this thesis is the unified investigation of a wide range of fundament...
In this work, we show that the submachine locality exposed by hierarchical bulksynchronous computati...
In order to mitigate the impact of the constantly widening gap between processor speed and main memo...
Abstract. We prove an analogue of Brent’s lemma for BSP-like parallel machines featuring a hierarchi...
The Hierarchical PRAM (H-PRAM) is a model of parallel computation which retains the ideal properties...
This paper investigates the design of parallel algorithmic strategies that address the efficient use...
A parameterized generic model that captures the features of diverse computer architectures would fac...
We prove an analogue of Brent's lemma for BSP-like parallel machines featuring a hierarchical struct...
) Sandeep Sen y Siddhartha Chatterjee z Submitted for publication Abstract We describe a model...