activity
20242026
collaborators

5 papers

cs.AR2026

Pickle: Precise, Flexible Cross-Core Last-level Cache Data Prefetching for Irregular Memory Accesses

Hoa Nguyen, Pongstorn Maidee, Jason Lowe-Power +1

Graph analytics and sparse scientific workloads are dominated by parallel chains of data-dependent, long-latency memory accesses whose patterns are difficult for hardware to infer…

cs.AR2025

Choreographer: A Full-System Framework for Fine-Grained Tasks in Cache Hierarchies

Hoa Nguyen, Pongstorn Maidee, Jason Lowe-Power +1

In this paper, we introduce Choreographer, a simulation framework that enables a holistic system-level evaluation of fine-grained accelerators designed for latency-sensitive tasks.…

cs.GT2025

Improved Maximin Share Guarantee for Additive Valuations

Ehsan Heidari, Alireza Kaviani, Masoud Seddighin +1

The maximin share () is the most prominent share-based fairness notion in the fair allocation of indivisible goods. Recent years have seen significant efforts to impr…

cs.GT2025

Improved Approximate EFX Guarantees for Multigraphs

Alireza Kaviani, Alireza Keshavarz, Masoud Seddighin +1

In recent years, a new line of work in fair allocation has focused on EFX allocations for \((p, q)\)-bounded valuations, where each good is relevant to at most \(p\) agents, and an…

cs.GT2024

Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations

Alireza Kaviani, Masoud Seddighin, AmirMohammad Shahrezaei

The existence of allocations stands as one of the main challenges in discrete fair division.In this paper, we present symmetrical results on the existence of $\texts…