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

Mahamed Adda

dblp:74/1007 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
1 paper
Interconnection networks and networks-on-chip · 87% Parallel and multicore computing · 13%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip
bus-based interconnection
0.011997
A Scalable Multibus Configuration for Connecting Transputer Links · IEEE Trans. Parallel Distributed Syst. 1997
Interconnection networks and networks-on-chip › interprocessor communication
message-passing network
0.011997
A Scalable Multibus Configuration for Connecting Transputer Links · IEEE Trans. Parallel Distributed Syst. 1997

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

performance evaluation · 0.0deadlock analysis · 0.0
YearPublicationVenuePosition
2001 Performances of a Dynamic Threads Scheduler
Smaïl Niar, Mahamed Adda
Euro-Par2
1997 A Scalable Multibus Configuration for Connecting Transputer Links
abstract
The paper presents the development and the performance of a novel bus based message passing interconnection scheme which can be used to join a large number of INMOS transputers via their serial communication links. The main feature of this architecture is that it avoids the communication overhead which occurs in systems where processing nodes relay communications to their neighbors. It also produces a flexible and scalable machine whose attractive characteristics are its simplicity and low latency for large configurations. We show that this architecture is free from deadlock, exhibits much smaller latency than most directly connected transputer networks and has a scalable bandwidth, in contrast to other bus topologies.
Mahamed Adda
IEEE Trans. Parallel Distributed Syst.1