Publications related to Shared-nothing architecture

Decentralized in-order execution of a sequential task-based code for shared-memory architectures

The hardware complexity of modern machines makes the design of adequate programming models crucial for jointly ensuring performance, portability, and productivity in high-performance computing (HPC). Sequential task-based programming models paired with adv ...

IEEE COMPUTER SOC2022

System Support for Robust Distributed Learning

Arsany Hany Abdelmessih Guirguis

Machine learning (ML) applications are ubiquitous. They run in different environments such as datacenters, the cloud, and even on edge devices. Despite where they run, distributing ML training seems the only way to attain scalable, high-quality learning. B ...

EPFL2022

Finding a Needle in the Haystack of Hardened Interconnect Patterns

Paolo Ienne, Grace Zgheib, Stefan Nikolic

Circuits naturally exhibit recurring patterns of local interconnect. Hardening those patterns when designing Field Programmable Gate Array (FPGA) clusters can both eliminate slow programmable connections from the critical path and remove the need for trans ...

IEEE2019

Formal Approaches to Querying Big Data in Shared-Nothing Systems

Bas Ketsman

To meet today's data management needs, it is a widespread practice to use distributed data storage and processing systems. Since the publication of the MapReduce paradigm, a plethora of such systems arose, but although widespread, the capabilities of these ...

ASSOC COMPUTING MACHINERY2019

Characterization of the Impact of Hardware Islands on OLTP

Anastasia Ailamaki, Miguel Sérgio De Oliveira Branco, Pinar Tözün, Ippokratis Pandis, Danica Porobic

Modern hardware is abundantly parallel and increasingly heterogeneous. The numerous processing cores have non-uniform access latencies to the main memory and processor caches, which causes variability in the communication costs. Unfortunately, database sys ...

Springer Verlag2016

Near Optimal Work-Stealing Tree Scheduler for Highly Irregular Data-Parallel Workloads

Martin Odersky, Aleksandar Prokopec

We present a work-stealing algorithm for runtime scheduling of data-parallel operations in the context of shared-memory architectures on data sets with highly-irregular workloads that are not known a priori to the scheduler. This scheduler can parallelize ...

Springer-Verlag Berlin2014

On Lock-Free Work-stealing Iterators for Parallel Data Structures

Martin Odersky, Aleksandar Prokopec, Dmytro Petrashko

With the rise of multicores, there is a trend of supporting data-parallel collection operations in general purpose programming languages. These operations are highly parametric, incurring abstraction performance penalties. Furthermore, data-parallel operat ...

2014

Toward Scalable Transaction Processing -- Evolution of Shore-MT

Anastasia Ailamaki, Frederick Ryan Johnson, Pinar Tözün, Ippokratis Pandis

Designing scalable transaction processing systems on modern multicore hardware has been a challenge for almost a decade. The typical characteristics of transaction processing workloads lead to a high degree of unbounded communication on multicores for conv ...

VLDB Endowment2013

OLTP on Hardware Islands

Anastasia Ailamaki, Miguel Sérgio De Oliveira Branco, Pinar Tözün, Ippokratis Pandis, Danica Porobic

Modern hardware is abundantly parallel and increasingly heterogeneous. The numerous processing cores have non-uniform access latencies to the main memory and to the processor caches, which causes variability in the communication costs. Unfortunately, datab ...

2012

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Shared-nothing architecture

Decentralized in-order execution of a sequential task-based code for shared-memory architectures

System Support for Robust Distributed Learning

Finding a Needle in the Haystack of Hardened Interconnect Patterns

Formal Approaches to Querying Big Data in Shared-Nothing Systems

Characterization of the Impact of Hardware Islands on OLTP

Near Optimal Work-Stealing Tree Scheduler for Highly Irregular Data-Parallel Workloads

On Lock-Free Work-stealing Iterators for Parallel Data Structures

On a Near Optimal Work-Stealing Tree Data-Parallel Scheduler for Highly Irregular Workloads

Toward Scalable Transaction Processing -- Evolution of Shore-MT

OLTP on Hardware Islands

Graph Chatbot

Chat with Graph Search

Formal Approaches to Querying Big Data in Shared-Nothing Systems

Finding a Needle in the Haystack of Hardened Interconnect Patterns

System Support for Robust Distributed Learning

Near Optimal Work-Stealing Tree Scheduler for Highly Irregular Data-Parallel Workloads

Decentralized in-order execution of a sequential task-based code for shared-memory architectures

On Lock-Free Work-stealing Iterators for Parallel Data Structures

On a Near Optimal Work-Stealing Tree Data-Parallel Scheduler for Highly Irregular Workloads

Characterization of the Impact of Hardware Islands on OLTP

OLTP on Hardware Islands

Toward Scalable Transaction Processing -- Evolution of Shore-MT