Search Results

Current serverless platforms introduce non-trivial overheads when chaining and orchestrating loosely-coupled microservices. Containerized function runtimes are also constrained by insufficient isolation and excessive startup time. This motivates our ...

Graphics Processing Units (GPUs) have become dominant accelerators for Machine Learning (ML) and High-Performance Computing (HPC) applications due to their massive parallelism capabilities, through the utilization of general matrix-to-matrix ...

In this article, we investigate the solvability of k-set agreement among n processes in distributed systems prone to different types of process failures. k-set agreement allows each process to propose a value and decide a value such that at most k ...$\frac{}{}\mathrm{}$$\mathrm{}$$\frac{}{}$$\mathrm{}$$\frac{}{\mathrm{}}\mathrm{}$$\frac{}{\mathrm{}}\mathrm{}$

We present a compositional denotational semantics for a functional language with first-class parallel composition and shared-memory operations whose operational semantics follows the Release/Acquire weak memory model (RA). The semantics is ...

In embedded systems, tightly coupled memories (TCMs) are usually shared between multiple masters for the purpose of hardware efficiency and software flexibility. On the one hand, memory sharing improves area utilization, but on the other hand, ...

Modern GPGPUs have employed multi-threading to hide the long off-chip memory access latency caused by frequent cache misses. However, the limited cache capacity shared by thousands of concurrently running warps will introduce serious cache ...

Approximate Computing techniques are finding a central role in modern applications, by optimizing architectures to relax some computation but with a constrained inaccuracy. In many applications, the FFT algorithm is invariably applied ...

• Approximate Computing can exploit error resilience of the applications to reduce chip resources.

The use of Euler–Lagrange methods on unstructured grids extends their application area to more versatile setups. However, the lack of a regular topology limits the scalability of distributed parallel methods, especially for routines ...

• A novel method to identify halo elements for unstructured Euler–Lagrange solvers.

A shared-memory counter is a widely-used and well-studied concurrent object. It supports two operations: An Inc operation that increases its value by 1 and a Read operation that returns its current value. In Jayanti et al (SIAM J Comput, 30(2), ...${}^{\mathrm{}}$$$${}^{\mathrm{}}$

Recent advances in non-volatile main memory (NVM) technology have spurred research on algorithms that are resilient to intermittent failures that cause processes to crash and subsequently restart. In this paper we present a Recoverable Mutual ...$$$$$$$$

Driven by cloud computing technology, traditional cryptography is transforming into cloud cryptographic service. Cryptographic cards must be virtualized if they are to be used in cloud. Hardware virtualization is the most commonly used ...

In embedded systems, tightly coupled memories (TCMs) are usually shared between multiple masters for the purpose of performance scalability, hardware efficiency and software flexibility. On the one hand, memory sharing improves area utilization, ...

Serverless computing is an emerging proposition in the cloud offering landscape that promotes a higher level of abstraction, further decoupling software operations from the underlying hardware. Often recognized as an economically ...

Graphic processing units (GPUs) are routinely used for general purpose computations to improve performance. To achieve the sought performance gains, care must be invested in fine tuning the way GPU programs interact with the underlying ...

Communication latency typically dominates the performance of message-passing systems, and consequently defines the efficiency of operations of algorithms implementing atomic read/write objects in asynchronous, crash-prone, message-...

• Reduce the communication demands of read operations for distributed atomic memory.

Shared memory mechanisms, e.g., POSIX shmem or XPMEM, are widely used to implement efficient intra-node communication among processes running on the same node. While POSIX shmem allows other processes to access only newly allocated memory, XPMEM ...

• The randomized consensus algorithm of Aspnes and Herlihy, which was shown to work with atomic registers, works even with regular registers.

The well-known randomized consensus algorithm by Aspnes and Herlihy (1990) for asynchronous shared-memory systems was proved to work, even against a strong adversary, under the assumption that the registers that it uses are atomic. ...

Motivated by recent distributed systems technology, Aguilera et al. introduced a hybrid model of distributed computing, called the message-and-memory model or m&m model for short. In this model, processes can communicate by message passing and ...

Upon graduation, a computer science student should have a good understanding of the current technology and have the soft skills necessary to secure a position in industry. Considering that typical computers and even the common ...

• Hands-on Project Based Learning is an effective means to teach parallel programming.

Rapidly advancing technology brings a huge volume of data along the way that grows at a staggering pace and cannot be processed with traditional algorithms/hardware. Therefore, storing, processing, and analyzing this data in a timely manner ...