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

Shachar Fienblit

dblp:31/5589 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

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

Systems, architecture and hardware · 3Databases, data management, data science and information retrieval · 1

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
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › storage reliability › data protection
continuous data protection
0.112007
Architectures for Controller Based CDP · FAST 2007
YearPublicationVenuePosition
2007 Architectures for Controller Based CDP
Guy Laden, Paula Ta-Shma, Eitan Yaffe, Michael Factor, Shachar Fienblit
FAST5
2007 Distributed desk checking
abstract
Abstract Desk checking is known to be an effective reading technique for early detection of sequential program errors. This paper discusses how to extend desk checking for concurrent and distributed programs. In addition to exponential possible schedules, concurrent and distributed programs have execution states that include more than one process. The new distributed desk‐checking technique supports the selection of schedules and execution states to be reviewed. The cross‐product functional coverage technique assists in the selection process. Schedule selection guidelines that facilitate early detection and coverage are introduced. It is demonstrated that code inspection can be applied effectively to large industrial applications using the selection mechanism introduced by this technique. Industrial pilots show that distributed desk checking is an effective early error‐detection review technique. Copyright © 2006 John Wiley & Sons, Ltd.
Amiram Hayardeny, Shachar Fienblit, Eitan Farchi
Concurr. Comput. Pract. Exp.2
2004 Concurrent and Distributed Desk Checking
abstract
Summary form only given. This paper discusses how to extend desk checking for concurrent and distributed programs. In addition to unbounded possible schedules, concurrent and distributed programs have execution states that include more than one process. Schedule selection guidelines that facilitate early detection and coverage are introduced. The cross-product technique assists in the selection process. Industrial pilots show that concurrent desk checking is a promising review technique for early error detection.
Amiram Hayardeny, Shachar Fienblit, Eitan Farchi
IPDPS2