Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amir Roozbeh

dblp:145/0803 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
2since 2021 · last 2022
0000-0003-4088-7884ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 since 2021Software engineering, systems software and programming languages · 2 · 1 since 2021Artificial intelligence and machine learning · 1Computer networks · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
3 papers
Routing and switching · 39% Software-defined and programmable networks · 36% Internet architecture and protocols · 21%
Computer architecture, parallel and distributed computing, and storage systems
4 papers
Memory systems · 74% Cloud and datacenter computing · 26%

Topics — the 11 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching › packet switching
packet ordering
0.612022
Packet Order Matters! Improving Application Performance by Deliberately Delaying Packets · NSDI 2022
Internet architecture and protocols
packet scheduling
0.612022
Packet Order Matters! Improving Application Performance by Deliberately Delaying Packets · NSDI 2022
Routing and switching › data plane › router data plane
high-speed packet processing
0.512021
PacketMill: toward per-Core 100-Gbps networking · ASPLOS 2021
Software-defined and programmable networks
programmable data plane
0.512021
PacketMill: toward per-Core 100-Gbps networking · ASPLOS 2021
Software-defined and programmable networks › programmable data plane
software packet processing
0.512021
PacketMill: toward per-Core 100-Gbps networking · ASPLOS 2021
Memory systems › cache management
direct cache access
0.412020
Reexamining Direct Cache Access to Optimize I/O Intensive Applications for Multi-hundred-gigabit Networks · USENIX ATC 2020
Memory systems › cache management
cache isolation
0.412019
Make the Most out of Last Level Cache in Intel Processors · EuroSys 2019
Memory systems
cache management
0.412019
Make the Most out of Last Level Cache in Intel Processors · EuroSys 2019
Memory systems › memory hierarchy › cache hierarchy
last-level cache
0.412019
Make the Most out of Last Level Cache in Intel Processors · EuroSys 2019
Cloud and datacenter computing
datacenter network
0.322021
PacketMill: toward per-Core 100-Gbps networking · ASPLOS 2021
Make the Most out of Last Level Cache in Intel Processors · EuroSys 2019
Cloud and datacenter computing
network i/o
0.112019
Make the Most out of Last Level Cache in Intel Processors · EuroSys 2019

Methods — techniques the papers use, named apart from their topics

code optimization · 1.0complex addressing analysis · 0.4DPDK · 0.4
YearPublicationVenuePosition
2022 Packet Order Matters! Improving Application Performance by Deliberately Delaying Packets
Hamid Ghasemirahni, Tom Barbette, George P. Katsikas, Alireza Farshin, Amir Roozbeh, Massimo Girondi, Marco Chiesa, Gerald Q. Maguire Jr., Dejan Kostic
NSDI5
2021 PacketMill: toward per-Core 100-Gbps networking
abstract
We present PacketMill, a system for optimizing software packet processing, which (i) introduces a new model to efficiently manage packet metadata and (ii) employs code-optimization techniques to better utilize commodity hardware. PacketMill grinds the whole packet processing stack, from the high-level network function configuration file to the low-level userspace network (specifically DPDK) drivers, to mitigate inefficiencies and produce a customized binary for a given network function. Our evaluation results show that PacketMill increases throughput (up to 36.4 Gbps -- 70%) & reduces latency (up to 101 us -- 28%) and enables nontrivial packet processing (e.g., router) at ~100 Gbps, when new packets arrive >10× faster than main memory access times, while using only one processing core.
Alireza Farshin, Tom Barbette, Amir Roozbeh, Gerald Q. Maguire Jr., Dejan Kostic
ASPLOS3
2020 Reexamining Direct Cache Access to Optimize I/O Intensive Applications for Multi-hundred-gigabit Networks
Alireza Farshin, Amir Roozbeh, Gerald Q. Maguire Jr., Dejan Kostic
USENIX ATC2
2019 Make the Most out of Last Level Cache in Intel Processors
abstract
In modern (Intel) processors, Last Level Cache (LLC) is divided into multiple slices and an undocumented hashing algorithm (aka Complex Addressing) maps different parts of memory address space among these slices to increase the effective memory bandwidth. After a careful study of Intel's Complex Addressing, we introduce a slice-aware memory management scheme, wherein frequently used data can be accessed faster via the LLC. Using our proposed scheme, we show that a key-value store can potentially improve its average performance ~12.2% and ~11.4% for 100% & 95% GET workloads, respectively. Furthermore, we propose CacheDirector, a network I/O solution which extends Direct Data I/O (DDIO) and places the packet's header in the slice of the LLC that is closest to the relevant processing core. We implemented CacheDirector as an extension to DPDK and evaluated our proposed solution for latency-critical applications in Network Function Virtualization (NFV) systems. Evaluation results show that CacheDirector makes packet processing faster by reducing tail latencies (90-99th percentiles) by up to 119 μs (~21.5%) for optimized NFV service chains that are running at 100 Gbps. Finally, we analyze the effectiveness of slice-aware memory management to realize cache isolation.
Alireza Farshin, Amir Roozbeh, Gerald Q. Maguire Jr., Dejan Kostic
EuroSys2
2017 Techno-economic framework for cloud infrastructure: a cost study of resource disaggregation
abstract
The rapid growth of data and high-dependency of industries on using data put lots of focus on the computing facilities.Increasing the efficiency and re-architecting the underlying infrastructure of datacenters, has become a major priority.The total cost of owning and running a datacenter (DC) is affected by many parameters, which until recently were ignored as their impact on the business economy was negligible.However, that is not the case anymore, as in the new era of digital economy every penny counts.The market is too aggressive to ignore anything.Hence, the economic efficiency becomes vital for cloud infrastructure providers despite their size.This article presents a framework to assess cloud infrastructure economic efficiency, taking into account three main aspects: application profiling, hardware dimensioning and total cost of ownership (TCO).Moreover, it presents a cost study of deploying the emerging concept of disaggregated hardware architecture in DCs based on the proposed framework.The study considers all the major cost categories incurred during the DC lifetime in terms of both capital and operational expenditures.A thorough cost comparison between a DC running on a disaggregated hardware architecture with one running on a traditional server-based hardware architecture is presented.The study demonstrates the evolution of the yearly cost over DC lifetime as well as a sensitivity analysis, allowing to understand how to minimize the cost of running cloud.Results show that, lifecycle management cost is one of the main differentiators between two technologies.Moreover, it is shown that in the presence of heterogeneous workloads, having a DC based on a fully disaggregated hardware brings high savings (more than 40% depending on the applications) compared to the traditional hardware architectures independent of the hardware set-up.
Mozhgan Mahloo, João Monteiro Soares, Amir Roozbeh
FedCSIS3