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

Igor Terekhov

dblp:18/5788 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

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 · 58% High-performance computing · 22% Storage systems · 15%

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

TopicWeightPapersLastEvidence papers
High-performance computing
data-intensive computing
0.022001
Distributed Data Access and Resource Management in the D0 SAM System · HPDC 2001
Distributed Data Access in the Sequential Access Model in the D0 Experiment at Fermilab · HPDC 2000
Distributed systems
grid computing
0.022001
Distributed Data Access and Resource Management in the D0 SAM System · HPDC 2001
Distributed Data Access in the Sequential Access Model in the D0 Experiment at Fermilab · HPDC 2000
Distributed systems
distributed data processing
0.012001
Distributed Data Access and Resource Management in the D0 SAM System · HPDC 2001
Storage systems
data management
0.012000
Distributed Data Access in the Sequential Access Model in the D0 Experiment at Fermilab · HPDC 2000
Distributed systems › distributed data processing
distributed data access
0.012000
Distributed Data Access in the Sequential Access Model in the D0 Experiment at Fermilab · HPDC 2000
Distributed systems › distributed resource management
job management
0.012001
Distributed Data Access and Resource Management in the D0 SAM System · HPDC 2001
Cloud and datacenter computing
resource management
0.012001
Distributed Data Access and Resource Management in the D0 SAM System · HPDC 2001

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

caching · 0.0
YearPublicationVenuePosition
2004 Management of grid jobs and data within SAMGrid
abstract
When 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
CLUSTER3
2001 Distributed Data Access and Resource Management in the D0 SAM System
abstract
SAM (Sequential Access through Meta-data) is the data access and job management system for the D0 high energy physics experiment at Fermilab. The SAM system is being developed and used to handle the Petabyte-scale experiment data, accessed by hundreds of D0 collaborators scattered around the world. In this paper, we present solutions to some of the distributed data processing problems from the perspective of real experience dealing with mission-critical data. We concentrate on the distributed disk caching, resource management and job control. The system has elements of Grid computing and has features applicable to data-intensive computing in general.
Igor Terekhov, Ruth Pordes, Victoria White, Lee Lueking, Lauri Loebel-Carpenter, J. Trumbo, Sinisa Veseli, Matt Vranicar, H. Schellman
HPDC1
2000 Distributed Data Access in the Sequential Access Model in the D0 Experiment at Fermilab
abstract
Presents the Sequential Access Model (SAM), which is the data-handling system for D0, one of two primary high-energy experiments at Fermilab. During the next several years, the D0 experiment will store a total of about 1 PByte of data, including raw detector data and data processed at various levels. The design of SAM is not specific to the D0 experiment and carries few assumptions about the underlying mass storage level; its ideas are applicable to any sequential data access. By definition, in the sequential access mode, a user application needs to process a stream of data by accessing each data unit exactly once, the order of the data units in the stream being irrelevant. The units of data are laid out sequentially in files. The adopted model allows for a significant optimization of system performance, a reduction in user file latency and an increase in the overall throughput. In particular, caching is done with the knowledge of all the files that are needed "in the near future", which is defined as all the files being used by already-running or submitted jobs. The bulk of the data is stored in files on tape in the mass storage system Enstore. All of the data managed by SAM is cataloged in great detail in a relational database (Oracle).
Igor Terekhov, Victoria White
HPDC1
1999 Time Efficient Deadlock Resolution Algorithms
Igor Terekhov, Tracy Camp
Inf. Process. Lett.1