Demo Data from SIGIR 2026 / reviewers in the wild / expert
Aydin Üresin
dblp:20/6074
· DBLP profile ↗
6ranked-venue papers
5as first author
0since 2021 · last 1996
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 5 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 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.
| Theoretical computer science
1 paper |
Distributed computing theory · 77% Graph algorithms and graph theory · 23% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › parallel algorithms › parallel matrix algorithms
asynchronous iterative methods |
0.0 | 1 | 1990 | Parallel Asynchronous Algorithms for Discrete Data · J. ACM 1990 |
Distributed computing theory › distributed algorithms
asynchronous iterations |
0.0 | 1 | 1990 | Parallel Asynchronous Algorithms for Discrete Data · J. ACM 1990 |
Graph algorithms and graph theory › shortest path
all-pairs shortest paths |
0.0 | 1 | 1990 | Parallel Asynchronous Algorithms for Discrete Data · J. ACM 1990 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1996 | Effects of Asynchronism on the Convergence Rate of Iterative Algorithms
Aydin Üresin, Michel Dubois 0001 |
J. Parallel Distributed Comput. | 1 |
| 1990 | Asynchronous Iterations with Bounded Delay
Aydin Üresin, Michel Dubois 0001 |
ICPP (3) | 1 |
| 1990 | OMP: a RISC-based multiprocessor using orthogonal-access memories and multiple spanning busesabstractThis paper presents the architectural design and RISC based implementation of a prototype supercomputer, namely the Orthogonal MultiProcessor (OMP). The OMP system is constructed with 16 Intel 1860 RISC microprocessors and 256 parallel memory modules, which are 2-D interleaved and orthogonally accessed using custom-designed spanning buses. The architectural design has been validated by a CSIM-based multiprocessor simulator. The design choices are based on worst-case delay analysis and simulation validation. The current OMP prototype chooses a 2-dimensional memory architecture, mainly for image processing, computer vision, and neural network simulation applications. The 16-processor OMP prototype is targeted to achieve a peak performance of 400 RISC integer MIPS or a maximum of 640 Mflops. This paper presents the architectural design of the OMP prototype at system and PC board levels. We are presently entering the fabrication stage of all the PC boards. The system is expected to become operational in late 1991 and benchmarking results will be available in 1992. Only hardware design features are reported here. Software and simulation results are reported elsewhere. Kai Hwang 0001, Michel Dubois 0001, Dhabaleswar K. Panda 0001, Shisheng Shang, Aydin Üresin, W. Mao, H. Nair, M. Lytwyn, F. Hsieh, Sharad Mehrotra, Chien-Ming Cheng |
ICS | 6 |
| 1990 | Parallel Asynchronous Algorithms for Discrete DataabstractMany problems in the area of symbolic computing can be solved by iterative algorithms. Implementations of these algorithms on multiprocessors can be synchronous or asynchronous. Asynchronous implementations are potentially more efficient because synchronization is a major source of performance degradation in most multiprocessor systems. In this paper, sufficient conditions for the convergence of asynchronous iterations to desired solutions are given. The main sufficient condition is shown to be also necessary for the case of finite data domains. The results are applied to prove the convergence of three asynchronous algorithms for the all-pairs shortest path problem, the consistent labeling problem, and a neural net model. Aydin Üresin, Michel Dubois 0001 |
J. ACM | 1 |
| 1989 | Sufficient conditions for the convergence of asynchronous iterations
Aydin Üresin, Michel Dubois 0001 |
Parallel Comput. | 1 |
| 1987 | Asynchronous Relaxation of Non-Numerical Data
Aydin Üresin, Michel Dubois 0001 |
ICPP | 1 |