Large-Scale Graph Processing on FPGAs with Caches for Thousands of Simultaneous Misses

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.

Recent advances in machine learning have dramatically increased model size and computational requirements, increasingly straining computing system capabilities. This tension is particularly acute for resource-constrained edge scenarios, for which careful h ...

Neurons in the human amygdala and hippocampus are classically thought to encode a person’s identity invariant to visual features. However, it remains largely unknown how visual information from higher visual cortical areas is translated into such a semanti ...

In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interact ...

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

The increasing demand for computing power and the emergence of heterogeneous computing architectures have driven the exploration of innovative techniques to address current limitations in both the compute and memory subsystems. One such solution is the use ...

We prove the non-planarity of a family of 3-regular graphs constructed from the solutions to the Markoff equation x2 + y2 + z2 = xyz modulo prime numbers greater than 7. The proof uses Euler characteristic and an enumeration of the short cycles in these gr ...

Driven by the demand for real-time processing and the need to minimize latency in AI algorithms, edge computing has experienced remarkable progress. Decision-making AI applications stand out for their heavy reliance on data-centric operations, predominantl ...

Verification and testing of hardware heavily relies on cycle-accurate simulation of RTL. As single-processor performance is growing only slowly, conventional, single-threaded RTL simulation is becoming impractical for increasingly complex chip designs and ...

Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

This chapter offers a new view of post-Soviet Ukrainain literary memory as expressed in varous texts, redefining the role of clashing narratives of the past under the divisive political and social conditions of upheavals, crises, and military conflicts. Th ...

All-solid-state time-resolved cameras based on CMOS single-photon avalanche diode (SPAD) arrays have made very significant advances since the fabrication of the first CMOS SPADs back in 2003. These natively digital sensors are now available in large format ...

Computer systems rely heavily on abstraction to manage the exponential growth of complexity across hardware and software. Due to practical considerations of compatibility between components of these complex systems across generations, developers have favou ...

Memory devices have returned to the spotlight due to increasing interest in using in-memory computing architectures to make data-driven algorithms more energy-efficient. One of the main advantages of this architecture is the efficient performance of vector ...

Resting-state fMRI has proven to entail subject-specific signatures that can serve as a fingerprint to identify individuals. Conventional methods are based on building a connectivity matrix based on correlation between the average time course of pairs of b ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Various forms of real-world data, such as social, financial, and biological networks, can be represented using graphs. An efficient method of analysing this type of data is to extract subgraph patterns, such as cliques, cycles, and motifs, from graphs. For ...

Accessing input data is a critical operation in data analytics: i) slow data access significantly degrades performance, and ii) storing everything in the fastest medium, i.e., memory, incurs high operational and hardware costs. Further, while GPUs offer in ...

Modern hardware is increasingly complex, requiring increasing effort to understand in order to carefully engineer systems for optimal performance and effective utilization. Moreover, established design principles and assumptions are not portable to modern ...

Large-Scale Graph Processing on FPGAs with Caches for Thousands of Simultaneous Misses

Chat with Graph Search

Keep All in Memory with Maxwell: a Near-SRAM Computing Architecture for Edge AI Applications

Feature-based encoding of face identity by single neurons in the human amygdala and hippocampus

Network-based kinetic models: Emergence of a statistical description of the graph topology

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Intermediate Address Space: virtual memory optimization of heterogeneous architectures for cache-resident workloads

Non-planarity of Markoff graphs mod p

EdgeAI-Aware Design of In-Memory Computing Architectures

Highly Parallel RTL Simulation

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Ukrainian Literary Imaginaries of Past after 1991: From Substitution to Restoration?

A review of recent developments on CMOS single-photon avalanche diode-based cameras for biomedical time-resolved applications

Secure Interface Design Leveraging Hardware/Software Support

How to Achieve Large-Area Ultra-Fast Operation of MoS 2 Monolayer Flash Memories?

Brain Fingerprinting Using Fmri Spectral Signatures On High-Resolution Cortical Graphs

Results on Sparse Integer Programming and Geometric Independent Sets

Acceleration of graph pattern mining and applications to financial crime

HetCache: Synergising NVMe Storage and GPU acceleration for Memory-Efficient Analytics

Chaosity: Understanding Contemporary NUMA-architectures