Athicha Muthitacharoen

dblp:57/2442 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2003
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 2 first-authorSystems, architecture and hardware · 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 architecture, parallel and distributed computing, and storage systems
4 papers
Storage systems · 63% Performance modeling and evaluation · 21% Distributed systems · 16%
Computer networks
1 paper
Internet architecture and protocols · 100%

Topics — the 9 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems
file systems
0.122002
Ivy: A Read/Write Peer-to-Peer File System · OSDI 2002
A Low-Bandwidth Network File System · SOSP 2001
Distributed systems
fault tolerance
0.012003
Performance debugging for distributed systems of black boxes · SOSP 2003
Storage systems › distributed storage
peer-to-peer storage
0.012003
Brief announcement: building data structures on untrusted peer-to-peer storage with per-participant logs · PODC 2003
Performance modeling and evaluation › performance diagnosis
performance debugging
0.012003
Performance debugging for distributed systems of black boxes · SOSP 2003
Storage systems
untrusted storage
0.012003
Brief announcement: building data structures on untrusted peer-to-peer storage with per-participant logs · PODC 2003
Performance modeling and evaluation
workload characterization
0.012003
Performance debugging for distributed systems of black boxes · SOSP 2003
Storage systems › file systems
distributed file system
0.012001
A Low-Bandwidth Network File System · SOSP 2001
Storage systems › networked storage
remote file access
0.012001
A Low-Bandwidth Network File System · SOSP 2001
Distributed systems
peer-to-peer systems
0.012002
Ivy: A Read/Write Peer-to-Peer File System · OSDI 2002

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

similarity detection · 0.1compression · 0.1caching · 0.1signal processing · 0.0RPC timing analysis · 0.0
YearPublicationVenuePosition
2003 Brief announcement: building data structures on untrusted peer-to-peer storage with per-participant logs
abstract
No abstract available.
Benjie Chen, Thomer M. Gil, Athicha Muthitacharoen, Robert Morris 0005
PODC3
2003 Performance debugging for distributed systems of black boxes
abstract
Many interesting large-scale systems are distributed systems of multiple communicating components. Such systems can be very hard to debug, especially when they exhibit poor performance. The problem becomes much harder when systems are composed of "black-box" components: software from many different (perhaps competing) vendors, usually without source code available. Typical solutions-provider employees are not always skilled or experienced enough to debug these systems efficiently. Our goal is to design tools that enable modestly-skilled programmers (and experts, too) to isolate performance bottlenecks in distributed systems composed of black-box nodes.We approach this problem by obtaining message-level traces of system activity, as passively as possible and without any knowledge of node internals or message semantics. We have developed two very different algorithms for inferring the dominant causal paths through a distributed system from these traces. One uses timing information from RPC messages to infer inter-call causality; the other uses signal-processing techniques. Our algorithms can ascribe delay to specific nodes on specific causal paths. Unlike previous approaches to similar problems, our approach requires no modifications to applications, middleware, or messages.
Marcos K. Aguilera, Jeffrey C. Mogul, Janet L. Wiener, Patrick Reynolds, Athicha Muthitacharoen
SOSP5
2002 Ivy: A Read/Write Peer-to-Peer File System
Athicha Muthitacharoen, Robert Morris 0005, Thomer M. Gil, Benjie Chen
OSDI1
2001 A Low-Bandwidth Network File System
abstract
Users rarely consider running network file systems over slow or wide-area networks, as the performance would be unacceptable and the bandwidth consumption too high. Nonetheless, efficient remote file access would often be desirable over such networks---particularly when high latency makes remote login sessions unresponsive. Rather than run interactive programs such as editors remotely, users could run the programs locally and manipulate remote files through the file system. To do so, however, would require a network file system that consumes less bandwidth than most current file systems.This paper presents LBFS, a network file system designed for low-bandwidth networks. LBFS exploits similarities between files or versions of the same file to save bandwidth. It avoids sending data over the network when the same data can already be found in the server's file system or the client's cache. Using this technique in conjunction with conventional compression and caching, LBFS consumes over an order of magnitude less bandwidth than traditional network file systems on common workloads.
Athicha Muthitacharoen, Benjie Chen, David Mazières
SOSP1