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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Baback A. Izadi

dblp:07/2164 · DBLP profile ↗
← Back
3ranked-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 · 3 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
1 paper
Interconnection networks and networks-on-chip · 61% Hardware reliability and fault tolerance · 30% Parallel and multicore computing · 9%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › fault-tolerant architecture
fault-tolerant multiprocessor		 0.012003
Enhanced Cluster k-Ary n-Cube, A Fault-Tolerant Multiprocessor · IEEE Trans. Computers 2003
Interconnection networks and networks-on-chip › network topology › torus network
k-ary n-cube		 0.012003
Enhanced Cluster k-Ary n-Cube, A Fault-Tolerant Multiprocessor · IEEE Trans. Computers 2003
Interconnection networks and networks-on-chip
network topology		 0.012003
Enhanced Cluster k-Ary n-Cube, A Fault-Tolerant Multiprocessor · IEEE Trans. Computers 2003
Parallel and multicore computing
multiprocessor system		 0.012003
Enhanced Cluster k-Ary n-Cube, A Fault-Tolerant Multiprocessor · IEEE Trans. Computers 2003

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

wave-switching · 0.0theoretical analysis · 0.0experimental evaluation · 0.0
YearPublicationVenuePosition
2004 An Augmented k-ary Tree Multiprocessor with Real-Time Fault-Tolerant Capability
Baback A. Izadi, Füsun Özgüner
 J. Supercomput.1
2003 Enhanced Cluster k-Ary n-Cube, A Fault-Tolerant Multiprocessor
abstract
We present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with (k/j)/sup n/ spare nodes. Each set of j/sup n/ regular nodes is connected to a spare node and the spare nodes are interconnected as either a (k/j)-ary n-cube if j/spl ne/(k/2) or a hypercube of dimension n if j=k/2. Our approach utilizes the capabilities of the wave-switching communication modules of the spare nodes to tolerate a large number of faulty nodes. Both theoretical and experimental results are examined. Compared with other proposed schemes, our approach can tolerate significantly more faulty nodes with a low overhead and no performance degradation.
Baback A. Izadi, Füsun Özgüner
 IEEE Trans. Computers1
1997 Design of a Circuit-Switched Highly Fault-Tolerant k-ary n-cube
abstract
In this paper we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with (/sup k///sub j/)/sup n/ spare nodes; each set of j/sup n/ regular nodes is connected to a spare node and the spare nodes are interconnected as a (/sup k///sub j/)-ary n-cube. Our approach utilizes the circuit-switched capabilities of the communication modules of the spare nodes to tolerate a large number of faulty nodes and faulty links without any performance degradation. Both theoretical and simulation results are presented.
Baback A. Izadi, Füsun Özgüner
 ICPP1