Searching for authors named "Nectarios Koziris" – sorted by Relevance.
42 documents found, showing 1 through 10.
Next 10 →
-
Code Generation Methods for tiling transformations
- …Tiling or supernode transformation has been widely used to improve locality in multi-level memory hierarchies, as well as to efficiently execute loops onto parallel architectures. However, automatic code generation for tiled loops can be a very complex compiler work due to non-rectangular tile shape…
- Cited by 1 (0 self) – Add To MetaCart
-
A Pipelined Schedule for Loop Tiling to Minimize Overall Completion Time
- ……
- Add To MetaCart
-
peer-to-peer
- …and locating mutable data in structured…
- Add To MetaCart
-
XOROS: A mutable Distributed Hash Table
- …Abstract. Data redundancy in DHTs is commonly accomplished through automatic replication of values to a set of close participating nodes. Such copies, once written, should not be modified, as there is no inherent DHT function that can operate on a dynamic set of mutable replicas. In this paper, we p…
- Add To MetaCart
-
Performance Comparison of Pure MPI vs Hybrid MPI-OpenMP Parallelization Models on SMP Clusters
- …This paper compares the performance of three programming paradigms for the parallelization of nested loop algorithms onto SMP clusters. More specifically, we propose three alternative models for tiled nested loop algorithms, namely a pure message passing paradigm, as well as two hybrid ones, that im…
- Cited by 4 (2 self) – Add To MetaCart
-
Synchronized Send Operations for Efficient Streaming Block I/O over Myrinet
- …Providing scalable clustered storage in a cost-effective way depends on the availability of an efficient network block device (nbd) layer. We study the performance of gmblock, an nbd server over Myrinet utilizing a direct disk-to-NIC data path which bypasses the CPU and main memory bus. To overcome …
- Add To MetaCart
-
Free Scheduling of General Nested Loops For Distributed Memory Architectures
- …: The most extensive, in terms of time execution, part of a program is the nested loops. Loop parallelization involves two steps: First the time partitioning of the index space to achieve the minimum makespan, and second the efficient assignment of the concurrent partitions into the target parallel …
- Add To MetaCart
-
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
- …The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution - unit communication time (UET-UCT). In this paper we enhance the model of ndimensional grid by adding extra diagonal edg…
- Cited by 4 (4 self) – Add To MetaCart
-
Mapping Nested Loops onto Distributed Memory Multiprocessors
- …This paper presents Chain grouping; a new low complexity method for the problem of partitioning the index space into groups with little intercommunication requirements, for mapping onto distributed mesh-connected architectures. First the loop iterations are scheduled in time, according to the hyperp…
- Cited by 4 (3 self) – Add To MetaCart
-
Optimal Scheduling for UET-UCT Grids Into Fixed Number of Processors
- …The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. Many scientific algorithms, which require nearest neighbor communication in a lattice space, are modeled by a task graph with the properties of a simple or enhanced grid. In this paper we consider…
- Cited by 1 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
