scholarly journals Distributed Fault Simulation Algorithms on Parallel Virtual Machine

VLSI Design ◽  
2001 ◽  
Vol 12 (1) ◽  
pp. 81-99 ◽  
Author(s):  
C. P. Ravikumar ◽  
Vikas Jain ◽  
Anurag Dod
Keyword(s):  
Virtual Machine ◽  
Distributed Algorithms ◽  
Fault Simulation ◽  
Fault Model ◽  
Experimental Results ◽  
Sequential Algorithm ◽  
Set Partition ◽  
Compression Technique ◽  
Test Set ◽  
Parallel Virtual Machine

In this paper, we describe distributed algorithms for combinational fault simulation assuming the classical stuck-at fault model. Our algorithms have been implemented on a network of Sun workstations under the Parallel Virtual Machine (PVM) environment. Two techniques are used for subdividing work among processors – test set partition and fault set partition. The sequential algorithm for fault simulation, used on individual nodes of the network, is based on a novel path compression technique proposed in this paper. We describe experimental results on a number of ISCAS′85 benchmark circuits.

scholarly journals Choice of a High-Level Fault Model for the Optimization of Validation Test Set Reused for Manufacturing Test

VLSI Design ◽  
2008 ◽  
Vol 2008 ◽  
pp. 1-9 ◽  
Author(s):  
Yves Joannon ◽  
Vincent Beroulle ◽  
Chantal Robach ◽  
Smail Tedjini ◽  
Jean-Louis Carbonero
Keyword(s):  
Fault Simulation ◽  
Fault Model ◽  
Test Set ◽  
Abstraction Level ◽  
Validation Test ◽  
Systems On Chip ◽  
Manufacturing Test ◽  
On Chip ◽  
High Level ◽  
Abstraction Levels

With the growing complexity of wireless systems on chip integrating hundreds-of-millions of transistors, electronic design methods need to be upgraded to reduce time-to-market. In this paper, the test benches defined for design validation or characterization of AMS & RF SoCs are optimized and reused for production testing. Although the original validation test set allows the verification of both design functionalities and performances, this test set is not well adapted to manufacturing test due to its high execution time and high test equipment costs requirement. The optimization of this validation test set is based on the evaluation of each test vector. This evaluation relies on high-level fault modeling and fault simulation. Hence, a fault model based on the variations of the parameters of high abstraction level descriptions and its related qualification metric are presented. The choice of functional or behavioral abstraction levels is discussed by comparing their impact on structural fault coverage. Experiments are performed on the receiver part of a WCDMA transceiver. Results show that for this SoC, using behavioral abstraction level is justified for the generation of manufacturing test benches.

KylinX

2021 ◽  
Vol 37 (1--4) ◽  
pp. 1-27
Author(s):  
Yiming Zhang ◽  
Chengfei Zhang ◽  
Yaozheng Wang ◽  
Kai Yu ◽  
Guangtao Xue ◽  
...  
Keyword(s):  
Operating System ◽  
Virtual Machine ◽  
Web Server ◽  
Experimental Results ◽  
Similar Performance ◽  
Dynamic Mapping ◽  
Memory Footprint ◽  
Dynamic Library ◽  
High Flexibility

Unikernel specializes a minimalistic LibOS and a target application into a standalone single-purpose virtual machine (VM) running on a hypervisor, which is referred to as (virtual) appliance . Compared to traditional VMs, Unikernel appliances have smaller memory footprint and lower overhead while guaranteeing the same level of isolation. On the downside, Unikernel strips off the process abstraction from its monolithic appliance and thus sacrifices flexibility, efficiency, and applicability. In this article, we examine whether there is a balance embracing the best of both Unikernel appliances (strong isolation) and processes (high flexibility/efficiency). We present KylinX, a dynamic library operating system for simplified and efficient cloud virtualization by providing the pVM (process-like VM) abstraction. A pVM takes the hypervisor as an OS and the Unikernel appliance as a process allowing both page-level and library-level dynamic mapping. At the page level, KylinX supports pVM fork plus a set of API for inter-pVM communication (IpC, which is compatible with conventional UNIX IPC). At the library level, KylinX supports shared libraries to be linked to a Unikernel appliance at runtime. KylinX enforces mapping restrictions against potential threats. We implement a prototype of KylinX by modifying MiniOS and Xen tools. Extensive experimental results show that KylinX achieves similar performance both in micro benchmarks (fork, IpC, library update, etc.) and in applications (Redis, web server, and DNS server) compared to conventional processes, while retaining the strong isolation benefit of VMs/Unikernels.

scholarly journals Simulation of Compressor Performance Deterioration due to Erosion

1989 ◽  
Author(s):  
W. Tabakoff ◽  
A. N. Lakshminarasimha ◽  
M. Pasin
Keyword(s):  
Fault Model ◽  
Experimental Results ◽  
Performance Tests ◽  
Individual Stage ◽  
One Stage ◽  
Before And After ◽  
Performance Deterioration ◽  
Compressor Performance ◽  
Multistage Compressor ◽  
The Individual

Experimental results obtained from cascades and one stage compressor performance tests before and after erosion were used to test a fault model to represent erosion. This model was implemented on a stage stacking program developed to demonstrate the effect of erosion in a multistage compressor. The effect of the individual stage erosion on the overall compressor performance is also demonstrated.

scholarly journals Multi-Task Self-Supervised Learning for Disfluency Detection

2020 ◽  
Vol 34 (05) ◽  
pp. 9193-9200
Author(s):  
Shaolei Wang ◽  
Wangxiang Che ◽  
Qi Liu ◽  
Pengda Qin ◽  
Ting Liu ◽  
...  
Keyword(s):  
Supervised Learning ◽  
Large Scale ◽  
Experimental Results ◽  
Training Data ◽  
Competitive Performance ◽  
Test Set ◽  
Full Dataset ◽  
Sentence Classification ◽  
Trained Network

Most existing approaches to disfluency detection heavily rely on human-annotated data, which is expensive to obtain in practice. To tackle the training data bottleneck, we investigate methods for combining multiple self-supervised tasks-i.e., supervised tasks where data can be collected without manual labeling. First, we construct large-scale pseudo training data by randomly adding or deleting words from unlabeled news data, and propose two self-supervised pre-training tasks: (i) tagging task to detect the added noisy words. (ii) sentence classification to distinguish original sentences from grammatically-incorrect sentences. We then combine these two tasks to jointly train a network. The pre-trained network is then fine-tuned using human-annotated disfluency detection training data. Experimental results on the commonly used English Switchboard test set show that our approach can achieve competitive performance compared to the previous systems (trained using the full dataset) by using less than 1% (1000 sentences) of the training data. Our method trained on the full dataset significantly outperforms previous methods, reducing the error by 21% on English Switchboard.

TVGuarder

2018 ◽  
pp. 638-658
Author(s):  
Li Lin ◽  
Shuang Li ◽  
Bo Li ◽  
Jing Zhan ◽  
Yong Zhao
Keyword(s):  
Cloud Computing ◽  
Virtual Machine ◽  
Performance Degradation ◽  
Experimental Results ◽  
Important Data ◽  
Threat Model ◽  
Security Concerns

Cloud computing has a most vulnerable security concerns as virtualization. This paper presents a Trace-enable Virtualization protection framework named TVGuarder, which protects IaaS user's important data from being illegally accessed or maliciously damaged by insider attacks. A threat model is established to characterize cloud-oriented insider attacks and countermeasures are proposed in TVGuarder. First, LSM hooks in host OS kernel are leveraged to enforce that VM images could only be accessed by host virtualization service. Second, a trusted loading mechanism is proposed to prevent tampered or disguised virtualization process from being executed in Host OS. Third, a log-based back tracing mechanism is designed to record full call trace of VM operations and guarantee that only legitimate VM operations are allowed. TVGuarder has been implemented in Openstack platform and several comprehensive experiments are conducted. Experimental results show that TVGuarder can identify several important insider attacks and protect virtual machine images with only a small performance degradation.

scholarly journals PVM-Parallel Virtual Machine: AUsers' Guide and Tutorial for Networked Parallel Computing

1995 ◽  
Vol 9 (6) ◽  
pp. 607 ◽  
Author(s):  
Al Geist ◽  
Adam Beguelin ◽  
Jack Dongarra ◽  
Weicheng Jiang ◽  
Robert Manchek ◽  
...  
Keyword(s):  
Parallel Computing ◽  
Virtual Machine ◽  
Parallel Virtual Machine

scholarly journals DISTRIBUTED ALGORITHMS FOR BUILDING HAMILTONIAN CYCLES IN k-ARY n-CUBES AND HYPERCUBES WITH FAULTY LINKS

2007 ◽  
Vol 08 (03) ◽  
pp. 253-284 ◽  
Author(s):  
IAIN A. STEWART
Keyword(s):  
Distributed Algorithms ◽  
Distributed Algorithm ◽  
Hamiltonian Cycle ◽  
Sequential Algorithm ◽  
Hamiltonian Cycles ◽  
Cube Formula

We derive a sequential algorithm Find-Ham-Cycle with the following property. On input: k and n (specifying the k-ary n-cube [Formula: see text]); F, a set of at most 2n − 2 faulty links; and v , a node of [Formula: see text], the algorithm outputs nodes v + and v − such that if Find-Ham-Cycle is executed once for every node v of [Formula: see text] then the node v + (resp. v −) denotes the successor (resp. predecessor) node of v on a fixed Hamiltonian cycle in [Formula: see text] in which no link is in F. Moreover, the algorithm Find-Ham-Cycle runs in time polynomial in n and log k. We also obtain a similar algorithm for an n-dimensional hypercube with at most n − 2 faulty links. We use our algorithms to obtain distributed algorithms to embed Hamiltonian cycles k-ary n-cubes and hypercubes with faulty links; our hypercube algorithm improves on a recently-derived algorithm due to Leu and Kuo, and our k-ary n-cube algorithm is the first distributed algorithm for embedding a Hamiltonian cycle in a k-ary n-cube with faulty links.

Sign in / Sign up

Export Citation Format

Share Document