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

Aspi B. Wadia

dblp:52/626 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 1980
—ORCID · none

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

Systems, architecture and hardware · 3Software engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Hardware reliability and fault tolerance · 55% Distributed systems · 27% Memory systems · 18%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance
reliability modeling
0.021973
Reliability Modeling for Fault-Tolerant Computers · IEEE Trans. Computers 1971
Modeling of a Bubble-Memory Organization with Self-Checking Translators to Achieve High Reliability · IEEE Trans. Computers 1973
Hardware reliability and fault tolerance › error correction
error-correcting codes
0.011973
Modeling of a Bubble-Memory Organization with Self-Checking Translators to Achieve High Reliability · IEEE Trans. Computers 1973
Memory systems › magnetic memory
magnetic bubble memory
0.011973
Modeling of a Bubble-Memory Organization with Self-Checking Translators to Achieve High Reliability · IEEE Trans. Computers 1973
Hardware reliability and fault tolerance
memory fault tolerance
0.011973
Modeling of a Bubble-Memory Organization with Self-Checking Translators to Achieve High Reliability · IEEE Trans. Computers 1973
Distributed systems › fault tolerance
checkpointing
0.011971
Logic Design for Dynamic and Interactive Recovery · IEEE Trans. Computers 1971
Distributed systems › fault tolerance
failure recovery
0.011971
Logic Design for Dynamic and Interactive Recovery · IEEE Trans. Computers 1971
Operating systems › system architecture
hardware-software interface
0.011971
Logic Design for Dynamic and Interactive Recovery · IEEE Trans. Computers 1971
Operating systems › fault tolerance
system recovery
0.011971
Logic Design for Dynamic and Interactive Recovery · IEEE Trans. Computers 1971

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

self-checking circuit design · 0.0error-correcting codes · 0.0recovery control unit · 0.0mathematical reliability modeling · 0.0audit routines · 0.0
YearPublicationVenuePosition
1980 Error correction scheme for telephone line transmission of RELP vocoder
abstract
This paper presents a scheme for encoding the output bits of an 8500 bps residual excited linear predictive coder (RELPC), in which the quality of the synthesized speech is more sensitive to errors in certain bits. Fifty-two of the 272 bits in a 32 ms voice frame were identified as most critical and in need of protection. A Burst-trapping code, using a (21,14) Single Error Correcting Double Error Detecting shortened Cyclic Hamming code as the basic block code was constructed. The code was selected with due consideration to computational load, delay in decoding and total bit rate requirement of less than 9.6 kbs. The paper also describes a Markov model for the decoding process and then determines the improvement in quality resulting from the use of the above scheme. In particular a bit error rate of 5 × 103is reduced to 3 × 106and a burst error rate of 5 × 104is reduced to 6.8 × 105. Some of the effects of errors on auditory perception which appear counter intuitive are briefly discussed.
Aspi B. Wadia
ICASSP1
1980 Generation of Node Lists Using Segment Analysis
Aspi B. Wadia
Comput. Lang.1
1973 Modeling of a Bubble-Memory Organization with Self-Checking Translators to Achieve High Reliability
abstract
This paper reports a study on the design and modeling of a highly reliable bubble-memory system. This system has the capability of correcting a single 16-adjacent bit-group error resulting from failures in a single basic storage module (BSM), and detecting with a probability greater than 0.99 any double errors resulting from failures in BSM's. The encoding/decoding network (memory translator) is designed to be self-checking, i.e., a single circuit failure in the translator wiH not produce an erroneous output that goes undetected. The system is able to perform reliable configuration in the event of uncorrectable BSM failures, memory translator failures, and dual-memory buffer failures; even in the presence of a single failure in the status registers controlling the configuration network. The bubble memory under study permits serial accessing of the store with 64 x 1024 bit blocks at a 100-kHz rate. The objective of this study is to develop good fault-tolerant design and analysis methods adequate for newly emerging technologies and prove the practicality by example. The reliability modeling study justifies the design philosophy adopted of employing memory data encoding and a translator to correct single group errors and detect double group errors to enhance the overall system reliability. By a proper design of the memory translator based on a new checking technique, a uniformly high percentage of multiple b-adjacent bit-group error detection is achieved through the use of a proposed code (detects 99.99695 percent of double b-adjacent bit-group errors and 99.9985 percent of triple or more b-adjacent bit-group errors).
Willard G. Bouricius, William C. Carter, Edward P. Hsieh, Donald C. Jessep Jr., Aspi B. Wadia
IEEE Trans. Computers5
1971 Reliability Modeling for Fault-Tolerant Computers
abstract
Reliability modeling and the mathematical equations involved are discussed for general computer systems organized to be fault tolerant. This paper summarizes the work done over the last four years on mathematical reliability modeling by the authors.
Willard G. Bouricius, William C. Carter, Donald C. Jessep, Peter R. Schneider, Aspi B. Wadia
IEEE Trans. Computers5
1971 Logic Design for Dynamic and Interactive Recovery
abstract
Recovery in a fault-tolerant computer means the continuation of system operation with data integrity after an error occurs. This paper delineates two parallel concepts embodied in the hardware and software functions required for recovery; detection, diagnosis, and reconfiguration for hardware, data integrity, checkpointing, and restart for the software. The hardware relies on the recovery variable set, checking circuits, and diagnostics, and the software relies on the recovery information set, audit, and reconstruct routines, to characterize the system state and assist in recovery when required. Of particular utility is a handware unit, the recovery control unit, which serves as an interface between error detection and software recovery programs in the supervisor and provides dynamic interactive recovery.
William C. Carter, Donald C. Jessep, Aspi B. Wadia, Peter R. Schneider, Willard G. Bouricius
IEEE Trans. Computers3