The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processes which causes all correct processes to agree on one out of k possible alternatives. The agreement on a single choice is complicated by the fact that there is no a priori agreement on names for the alternatives. Furthermore pro...

In a dynamic reordering superscalar processor, the front-end fetches instructions and places them in the issue queue. Instructions are then issued by the back-end execution core. Till recently, the front-end was designed to maximize performance without considering energy consumption. The front-end fetches instructions as fast as it can until it is stalled by a filled issue queue or some other b...

Despite the astonishing increases in processor performance over the last forty years, delivered application performance remains a critical issue for many important problems. Compilers play a critical role in determining that performance. A modern optimizing compiler contains many transformations that attempt to increase application performance. However, the best combination of transformations i...

sors, it will have all the data relative to a full event. No processing is applied to the event (for the time being). Then, it will inform the Supervisor that it is free again for another task (again using non blocking send/recv functions). Note that while Local processors are sending their data to the Global processor, the Supervisor is scanning its list of free Global processor in order to se...

Structured grid-based sparse matrix-vector multiplication and Gauss–Seidel iterations are very important kernel functions in scientific engineering computations, both of which memory intensive bandwidth-limited. GPDSP is a general purpose digital signal processor, significant embedded processor that has been introduced into high-performance computing. In this paper, we designed various optimiza...

The behavior and performance of MPI non-blocking message passing operations are sensitive to implementation specifics as they are heavily dependant on available system level buffers. In this paper we investigate the behavior of non-blocking communication primitives provided by popular MPI implementations and propose strategies for these primitives than can reduce processor synchronization overh...

Cache optimization is a crucial technique for most numerical code to exploit the performance of modern processors. It can be classified into improving access locality, and prefetching. Inherent algorithm constrains often limit the first approach which typically uses a blocking technique. While there exist automatic prefetching mechanism in hardware and/or compilers, they can not complement bloc...

Storage workloads are typically heavy-tailed, and a small number of large requests incur burdensome performance overhead. To this end, we present NetStore, an in-network storage accelerator that exploits the capability emerging programmable switches. The key idea NetStore is to directly process in network by leveraging switches as request processor. not only mitigates head-of-line blocking but ...

The present work investigates using non-blocking and minimum-blocking Java library classes as a basis for improving performance of parallel bidirectional search on a multiple-instruction multiple-data (MIMD) processor. The approach represents individual states as minimum-size, immutable objects. It uses a work queue to distribute states-for-expansion among worker threads, and it uses two sets f...

This work presents a performance evaluation of single node and subdomain communication schemes available in EdgeCFD, an implicit edgebased coupled fluid flow and transport code for solving large scale problems in modern clusters. A natural convection flow problem is considered to assess performance metrics. Tests, focused in single node multi-core performance, show that past Intel Xeon processo...