Sadegh Davari

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.

EDBT 2026 Demo / reviewers in the wild / expert

dblp:92/5933 · DBLP profile ↗

← Back

3ranked-venue papers

1as first author

0since 2021 · last 1994

—ORCID · none

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

Systems, architecture and hardware · 2Applied, 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.

Computer networks 1 paper		Internet architecture and protocols · 61% Wireless networking · 30% Internet of things and sensor networks · 9%
Computer architecture, parallel and distributed computing, and storage systems 1 paper		Embedded and real-time systems · 100%

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

Topic	Papers	Last	Evidence papers
Internet architecture and protocols › resource reservation synchronous bandwidth allocation	1	1994	Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol · IEEE Trans. Computers 1994
Wireless networking › multiple access protocols timed token protocol	1	1994	Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol · IEEE Trans. Computers 1994
Internet architecture and protocols › local area network › ring network token ring	1	1994	Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol · IEEE Trans. Computers 1994
Embedded and real-time systems real-time scheduling	1	1986	An On Line Algorithm for Real-Time Tasks Allocation · RTSS 1986

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

normalized proportional allocation · 0.0

Year	Publication	Venue	Position
1994	Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol abstract We study the problem of guaranteeing synchronous message deadlines in token ring networks where the timed token medium access control protocol is employed. Synchronous bandwidth, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be properly allocated to individual nodes. We address the issue of appropriate allocation of the synchronous capacities. Several synchronous bandwidth allocation schemes are analyzed in terms of their ability to satisfy deadline constraints of synchronous messages. We show that an inappropriate allocation of the synchronous capacities could cause message deadlines to be missed, even if the synchronous traffic is extremely low. We propose a scheme, called the normalized proportional allocation scheme, which can guarantee the synchronous message deadlines for synchronous traffic of up to 33% of available utilization.> Gopal Agrawal, Biao Chen 0002, Wei Zhao 0001, Sadegh Davari	IEEE Trans. Computers	4
1992	Guaranteeing Synchronous Message Deadlines with the Timed Token Protocol abstract The problem of guaranteeing synchronous message deadlines in token ring networks in which the timed token medium access control protocol is used is discussed. Synchronous capacity, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be properly allocated to individual nodes. Several synchronous capacity allocation schemes are analyzed in terms of their ability to satisfy deadline constraints of synchronous messages. It is shown that an inappropriate allocation of the synchronous capacities could cause message deadlines to be missed, even if the synchronous traffic is extremely low. The normalized proportional allocation scheme, which can guarantee the synchronous message deadlines for synchronous traffic of up to 33% of available utilization is proposed.> Gopal Agrawal, Biao Chen 0002, Wei Zhao 0001, Sadegh Davari	ICDCS	4
1986	An On Line Algorithm for Real-Time Tasks Allocation Sadegh Davari, Sudarshan K. Dhall	RTSS	1