Demo Data from EDBT 2026 / reviewers in the wild / expert
Vladimir Petrov
dblp:121/2416
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Systems, 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
1 paper |
High-performance computing · 50% Distributed systems · 50% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
communication optimization |
0.1 | 1 | 2012 | A framework for low-communication 1-D FFT · SC 2012 |
High-performance computing › fast fourier transform
distributed FFT |
0.1 | 1 | 2012 | A framework for low-communication 1-D FFT · SC 2012 |
Algorithms and data structures › fourier transform
fast fourier transform |
0.0 | 1 | 2012 | A framework for low-communication 1-D FFT · SC 2012 |
Methods — techniques the papers use, named apart from their topics
all-to-all communication reduction · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | A framework for low-communication 1-D FFTabstractIn high-performance computing on distributed-memory systems, communication often represents a significant part of the overall execution time. The relative cost of communication will certainly continue to rise as compute-density growth follows the current technology and industry trends. Design of lower-communication alternatives to fundamental computational algorithms has become an important field of research. For distributed 1-D FFT, communication cost has hitherto remained high as all industry-standard implementations perform three all-to-all internode data exchanges (also called global transposes). These communication steps indeed dominate execution time. In this paper, we present a mathematical framework from which many single-all-to-all and easy-to-implement 1-D FFT algorithms can be derived. For large-scale problems, our implementation can be twice as fast as leading FFT libraries on state-of-the-art computer clusters. Moreover, our framework allows tradeoff between accuracy and performance, further boosting performance if reduced accuracy is acceptable. Ping Tak Peter Tang, Jongsoo Park, Daehyun Kim 0001, Vladimir Petrov |
SC | 4 |
| 1999 | Computer-aided translation tools for Russian. Ukrainian, and EnglishabstractThe paper presents a new development by Lingvistica ‘98 Inc.: the PG-PARS computer-assisted translation system and a series of professional bidirectional dictionaries. PG-PARS was designed as a Windows 95 and Windows 98 application to support English-Russian-English and English-Ukrainian-English dictionaries. PG-PARS dictionaries are all bidirectional, i.e. they include, for example, both the English-Russian and Russian-English parts. Each part has its alphabetical index of entries displayed on a separate tab in the PG-PARS main window. The word entries are displayed for both parts of the dictionary, and translations of translations can be found easily, which is useful for a professional translator. One of the main peculiarities of PG-PARS is the Smart search mode based on morphological analysis of Slavic and English words looked up in the dictionaries. This is especially beneficial if the user is not a native speaker of Russian and Ukrainian. Another important feature is the Selection option which allows the user to mark a portion of the dictionary entry and paste it into the text. The presentation will show professional applications of the PG-PARS system for translating Russian and English texts. Michael S. Blekhman, Maryna Byezhanova, Andrei Kursin, Igor Backlan, Alexander Kazakov, Vladimir Petrov |
MTSummit | 6 |