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.
VLDB 2026 Research / reviewers in the wild / expert

Shem-Tov Levi

dblp:49/6087 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1988
—ORCID · none

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

Applied, 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 architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 83% Distributed systems · 17%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling
fault-tolerant real-time scheduling		 0.011988
Allocation of Real-Time Computations under Fault Tolerance Constraints · RTSS 1988
Embedded and real-time systems
real-time scheduling		 0.011988
Allocation of Real-Time Computations under Fault Tolerance Constraints · RTSS 1988
Embedded and real-time systems › real-time scheduling
schedulability analysis		 0.011988
Allocation of Real-Time Computations under Fault Tolerance Constraints · RTSS 1988
Distributed systems
fault tolerance		 0.011988
Allocation of Real-Time Computations under Fault Tolerance Constraints · RTSS 1988
Distributed systems
replication		 0.011988
Allocation of Real-Time Computations under Fault Tolerance Constraints · RTSS 1988

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

schedulability verification · 0.0resource allocation · 0.0
YearPublicationVenuePosition
1988 Allocation of Real-Time Computations under Fault Tolerance Constraints
abstract
An allocation scheme is proposed that accomplishes the hard real-time goal of guaranteeing a deadline satisfaction in case the job is accepted. In addition, the scheme supports fault-tolerance objectives in both damage containment and resiliency requirements. It does this in cooperation with a schedulability verification mechanism and with an object architecture in which for each object there exists a calendar that maintains the time of its execution. The scheme can be used for reallocation while increasing the resiliency.>
Shem-Tov Levi, Daniel Mossé, Ashok K. Agrawala
 RTSS1