Demo Data from EDBT 2026 / reviewers in the wild / expert
Todd Tannenbaum
dblp:03/6861
· DBLP profile ↗
8ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 8
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
2 papers |
Distributed systems · 77% Cloud and datacenter computing · 23% | |
| Software engineering, system software, and programming languages
1 paper |
Software testing · 77% Debugging and program repair · 23% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
grid computing |
0.1 | 2 | 2007 | Inter-operating grids through delegated matchmaking · SC 2007 Condor-G: A Computation Management Agent for Multi-Institutional Grids · HPDC 2001 |
Distributed systems › distributed resource management
matchmaking |
0.1 | 1 | 2007 | Inter-operating grids through delegated matchmaking · SC 2007 |
Cloud and datacenter computing › resource allocation
resource selection |
0.1 | 1 | 2007 | Inter-operating grids through delegated matchmaking · SC 2007 |
Debugging and program repair
fault localization |
0.0 | 1 | 2012 | Enforcing Murphy's Law for Advance Identification of Run-time Failures · USENIX ATC 2012 |
Distributed systems › distributed resource management
job management |
0.0 | 1 | 2001 | Condor-G: A Computation Management Agent for Multi-Institutional Grids · HPDC 2001 |
Distributed systems › distributed resource management
resource aggregation |
0.0 | 1 | 2001 | Condor-G: A Computation Management Agent for Multi-Institutional Grids · HPDC 2001 |
Methods — techniques the papers use, named apart from their topics
trace-based simulation · 0.1delegated matchmaking · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Lark: An effective approach for software-defined networking in high throughput computing clusters
Zhe Zhang 0003, Brian Bockelman, Dale W. Carder, Todd Tannenbaum |
Future Gener. Comput. Syst. | 4 |
| 2015 | Lark: Bringing Network Awareness to High Throughput ComputingabstractHigh throughput computing (HTC) systems are widely adopted in scientific discovery and engineering research. They are responsible for scheduling submitted batch jobs to utilize the cluster resources. Current systems mostly focus on managing computing resources like CPU and memory, however, they lack flexible and fine-grained management mechanisms for network resources. This has increasingly been an urgent need as current batch systems may be distributed among dozens of sites around the globe like Open Science Grid. The Lark project was motivated by this need to re-examine how the HTC layer interacts with the network layer. In this paper, we present the system architecture of Lark and its implementation as a plugin of HTCondor which is a popular HTC software project. Lark achieves lightweight network virtualization at per-job granularity for HTCondor by utilizing Linux container and virtual Ethernet devices, this provides each batch job with a unique network address in a private network namespace. We extended HTCondor's description language, Class Ads, so users can specify networking requirements in the job submission script. HTCondor can perform matchmaking to make sure user-specified network requirements and resource-specific policies are fulfilled. We also extended the job agent, condor starter, so that it can manage and configure the job's network environment. Given this important building block as the core, we implement bandwidth management functionality at both the host and network levels utilizing software-defined networking (SDN). Our experiments and evaluations show that Lark can effectively manage network resources within the cluster with low overhead. It provides the users with better predictability of their job execution and the administrators more flexibility in network resource consumption policies. Zhe Zhang 0003, Brian Bockelman, Dale W. Carder, Todd Tannenbaum |
CCGRID | 4 |
| 2012 | Enforcing Murphy's Law for Advance Identification of Run-time Failures
Zach Miller, Todd Tannenbaum, Ben Liblit |
USENIX ATC | 2 |
| 2007 | Inter-operating grids through delegated matchmakingabstractThe grid vision of a single computing utility has yet to materíalize: while many grids with thousands of processors each exist, most work in isolation. An important obstacle for the effective and efficient inter-operation of grids is the problem of resource selection. In this paper we propose a solution to this problem that combines the hierarchical and decentralized approaches for interconnecting grids. In our solution, a hierarchy of grid sites is augmented with peer-to-peer connections between sites under the same administrative control. To operate this architecture, we employ the key concept of delegated matchmaking, which temporarily binds resources from remote sites to the local environment. With trace-based simulations we evaluate our solution under various infrastructural and load conditions, and we show that it outperforms other approaches to inter-operating grids. Specifically, we show that delegated matchmaking achieves up to 60% more goodput and completes 26% more jobs than its best alternative. Alexandru Iosup, Dick H. J. Epema, Todd Tannenbaum, Matthew Farrellee, Miron Livny |
SC | 3 |
| 2006 | How to measure a large open-source distributed systemabstractHow can we measure the impact of an open-source software package over time? When a system has no price, no purchase contracts and no buyers or sellers it can be difficult to judge its impact on the world. To explore this issue, we have instrumented the Condor distributed batch system in a variety of ways and observed its growth to over 50 000 CPUs at over 1000 sites over five years. Instrumentation methods include automatic updates by e-mail and user datagram protocol (UDP), annotated download records and a voluntary user survey. Each of these metrics has various strengths and weaknesses that we are able to compare and contrast. We also explore the ethical and legal issues surrounding automatic data collection. Surprisingly, we discover that objections to automatic data collection are higher among people that are not using the Condor software. We conclude with some practical advice for further research into the measurement of software systems. Copyright © 2006 John Wiley & Sons, Ltd. Douglas Thain, Todd Tannenbaum, Miron Livny |
Concurr. Comput. Pract. Exp. | 2 |
| 2005 | Distributed computing in practice: the Condor experienceabstractAbstract Since 1984, the Condor project has enabled ordinary users to do extraordinary computing. Today, the project continues to explore the social and technical problems of cooperative computing on scales ranging from the desktop to the world‐wide computational Grid. In this paper, we provide the history and philosophy of the Condor project and describe how it has interacted with other projects and evolved along with the field of distributed computing. We outline the core components of the Condor system and describe how the technology of computing must correspond to social structures. Throughout, we reflect on the lessons of experience and chart the course travelled by research ideas as they grow into production systems. Copyright © 2005 John Wiley & Sons, Ltd. Douglas Thain, Todd Tannenbaum, Miron Livny |
Concurr. Pract. Exp. | 2 |
| 2004 | Management of grid jobs and data within SAMGridabstractWhen designing SAMGrid, a project for distributing high-energy physics computations on a grid, we discovered that it was challenging to decide where to place user's jobs. Jobs typically need to access hundreds of files, and each site has a different subset of the files. Our data system SAM knows what portion of a user's data may be at each site, but does not know how to submit grid jobs. Our job submission system Condor-G knows how to submit grid jobs, but originally it required users to choose grid sites and gave them no assistance in choosing. This work describes how we enhanced Condor-G to interact with SAM to make good decisions about where jobs should be executed, and thereby improve the performance of grid jobs that access large amounts of data. All these enhancements are general enough to be applicable to grid computing beyond the data-intensive computing with SAMGrid. A. Baranovski, Gabriele Garzoglio, Igor Terekhov, Alain J. Roy, Todd Tannenbaum |
CLUSTER | 5 |
| 2001 | Condor-G: A Computation Management Agent for Multi-Institutional GridsabstractIn recent years, there has been a dramatic increase in the amount of available computing and storage resources, yet few have been able to exploit these resources in an aggregated form. We present the Condor-G system, which leverages software from Globus and Condor to allow users to harness multi-domain resources as if they all belong to one personal domain. We describe the structure of Condor-G and how it handles job management, resource selection, security and fault tolerance. James Frey, Todd Tannenbaum, Miron Livny, Ian T. Foster, Steven Tuecke |
HPDC | 2 |