Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 30 of 41
Full-Text Articles in Physical Sciences and Mathematics
Survivable Traffic Grooming With Path Protection At The Connection Level In Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy
Survivable Traffic Grooming With Path Protection At The Connection Level In Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy
School of Computing: Faculty Publications
Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. …
Profiling Deployed Software: Strategic Probe Placement, Madeline Diep, Sebastian Elbaum, Myra B. Cohen
Profiling Deployed Software: Strategic Probe Placement, Madeline Diep, Sebastian Elbaum, Myra B. Cohen
CSE Technical Reports
Profiling deployed software provides valuable insights for quality improvement activities. The probes required for profiling, however, can cause an unacceptable performance overhead for users. In previous work we have shown that significant overhead reduction can be achieved, with limited information loss, through the distribution of probes across deployed instances. However, existing strategies for probe distribution do not account for several relevant factors: acceptable overheads may vary, the distributions to be deployed may be limited, profiled events may have different likelihoods, and the user pool composition may be unknown. This paper evaluates strategies for probe distribution while manipulating these factors through …
Shared Risk Link Group (Srlg)-Diverse Path Provisioning Under Hybrid Service Level Agreements In Wavelength-Routed Optical Mesh Networks, Lu Shen, Xi Yang, Byrav Ramamurthy
Shared Risk Link Group (Srlg)-Diverse Path Provisioning Under Hybrid Service Level Agreements In Wavelength-Routed Optical Mesh Networks, Lu Shen, Xi Yang, Byrav Ramamurthy
School of Computing: Faculty Publications
The static provisioning problem in wavelength-routed optical networks has been studied for many years. However, service providers are still facing the challenges arising from the special requirements for provisioning services at the optical layer. In this paper, we incorporate some realistic constraints into the static provisioning problem, and formulate it under different network resource availability conditions.We consider three classes of shared risk link group (SRLG)-diverse path protection schemes: dedicated, shared, and unprotected. We associate with each connection request a lightpath length constraint and a revenue value. When the network resources are not sufficient to accommodate all the connection requests, the …
A Link Bundled Auxiliary Graph Model For Constrained Dynamic Traffic Grooming In Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy
A Link Bundled Auxiliary Graph Model For Constrained Dynamic Traffic Grooming In Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy
School of Computing: Faculty Publications
This paper addresses the two-layer dynamic traffic grooming problem in wavelength-division-multiplexed (WDM) mesh optical networks subject to resource constraints and the generalized wavelength continuity (GWC) constraint. The GWC constraint is a relaxed wavelength continuity constraint which incorporates various kinds of wavelength conversion capabilities that exist in optical networks. As an improvement over the existing layered auxiliary graph (layered-AG) approach which represents each wavelength separately in the auxiliary graph, we introduce a largely simplified link bundled auxiliary graph (LBAG) model and propose the SAG-LB method to find paths and assign wavelengths for new lightpaths subject to the GWC constraint.We propose the …
An Efficient Consistency Algorithm For The Temporal Constraint Satisfaction Problem, Berthe Y. Choueiry, Lin Xu
An Efficient Consistency Algorithm For The Temporal Constraint Satisfaction Problem, Berthe Y. Choueiry, Lin Xu
School of Computing: Faculty Publications
Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a meta-CSP, which is a finite CSP with a unique global constraint. The size of this global constraint is exponential in the number of time points in the original TCSP, and generalized-arc consistency is equivalent to finding the minimal network of the TCSP, which is NP-hard. We introduce _AC, an efficient consistency algorithm for filtering the meta-CSP. This algorithm significantly reduces the domains of the variables of the meta-CSP without guaranteeing arc-consistency. We use _AC as a preprocessing step to solving the meta-CSP. We …
Geospatial Decision Support For Drought Risk Management, Steve Goddard, Sherri K. Harms, Stephen E. Reichenbach, Tsegaye Tadesse, William J. Waltman
Geospatial Decision Support For Drought Risk Management, Steve Goddard, Sherri K. Harms, Stephen E. Reichenbach, Tsegaye Tadesse, William J. Waltman
School of Computing: Faculty Publications
Drought affects virtually all regions of the world and results in significant economic, social, and environmental impacts. The Federal Emergency Management Agency estimates annual drought-related losses in the U.S. at $6–$8 billion, which is more than any other natural hazard. Congress enacted the Agricultural Risk Protection Act of 2000 to encourage the U.S. Department of Agriculture (USDA) Risk Management Agency (RMA) and farmers to be more proactive in managing drought risk. Through the NSF’s Digital Government Program, the USDA RMA is working with the University of Nebraska–Lincoln Computer Science and Engineering Department, National Drought Mitigation Center (NDMC), and High Plains …
Experimental Program Analysis: A New Program Analysis Paradigm, Joseph R. Ruthruff, Sebastian Elbaum, Gregg Rothermel
Experimental Program Analysis: A New Program Analysis Paradigm, Joseph R. Ruthruff, Sebastian Elbaum, Gregg Rothermel
CSE Technical Reports
Program analysis techniques analyze software systems to collect, deduce, or infer information about them, which can then be used in software-engineering related tasks. Recent research has suggested that a new form of program analysis technique might be created by incorporating characteristics of experimentation into analyses. This paper reports the results of research exploring this suggestion. Building on background in classical experimentation, we provide descriptive and operational definitions of experimental program analysis, illustrate them by examples, and describe several differences between experimental program analysis and classical experimentation. We present three studies that show how the use of the paradigm can help …
Guest Editor’S Introduction: Ieee 2004 International Symposium On Software Testing And Analysis, Gregg Rothermel
Guest Editor’S Introduction: Ieee 2004 International Symposium On Software Testing And Analysis, Gregg Rothermel
School of Computing: Faculty Publications
The International Symposium on Software Testing and Analysis (ISSTA) is the leading research conference in software testing and analysis. ISSTA brings together academics, industrial researchers, and practitioners to present and discuss the most promising approaches for using testing and analysis to assess and improve software and the processes by which it is engineered.
ISSTA 2004 was held in at the Parker House Hotel in Boston, Massachusetts, July 11-14, 2004. On this occasion the conference was co-located with the 16th Computer- Aided Verification Conference (CAV 2004), with the two conferences sharing a day of sessions. The conference was also preceded by …
Survivable Lightpath Provisioning In Wdm Mesh Networks Under Shared Path Protection And Signal Quality Constraints, Xi Yang, Lu Shen, Byrav Ramamurthy
Survivable Lightpath Provisioning In Wdm Mesh Networks Under Shared Path Protection And Signal Quality Constraints, Xi Yang, Lu Shen, Byrav Ramamurthy
School of Computing: Faculty Publications
This paper addresses the problem of survivable lightpath provisioning in wavelength-division-multiplexing (WDM) mesh networks, taking into consideration optical-layer protection and some realistic optical signal quality constraints. The investigated networks use sparsely placed optical–electrical–optical (O/E/O) modules for regeneration and wavelength conversion. Given a fixed network topology with a number of sparsely placed O/E/O modules and a set of connection requests, a pair of link-disjoint lightpaths is established for each connection. Due to physical impairments and wavelength continuity, both the working and protection lightpaths need to be regenerated at some intermediate nodes to overcome signal quality degradation and wavelength contention. In the …
Leveraging User-Session Data To Support Web Application Testing, Sebastian Elbaum, Gregg Rothermel, Srikanth Karre, Marc Fisher Ii
Leveraging User-Session Data To Support Web Application Testing, Sebastian Elbaum, Gregg Rothermel, Srikanth Karre, Marc Fisher Ii
School of Computing: Faculty Publications
Web applications are vital components of the global information infrastructure, and it is important to ensure their dependability. Many techniques and tools for validating Web applications have been created, but few of these have addressed the need to test Web application functionality and none have attempted to leverage data gathered in the operation of Web applications to assist with testing. In this paper, we present several techniques for using user session data gathered as users operate Web applications to help test those applications from a functional standpoint. We report results of an experiment comparing these new techniques to existing white-box …
Dynamic Routing In Translucent Wdm Optical Networks: The Intradomain Case, Xi Yang, Byrav Ramamurthy
Dynamic Routing In Translucent Wdm Optical Networks: The Intradomain Case, Xi Yang, Byrav Ramamurthy
School of Computing: Faculty Publications
Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under …
An Empirical Study Of Fault Localization For End-User Programmers, Joseph R. Ruthruff, Margaret Burnett, Gregg Rothermel
An Empirical Study Of Fault Localization For End-User Programmers, Joseph R. Ruthruff, Margaret Burnett, Gregg Rothermel
CSE Conference and Workshop Papers
End users develop more software than any other group of programmers, using software authoring devices such as e-mail filtering editors, by-demonstration macro builders, and spreadsheet environments. Despite this, there has been little research on finding ways to help these programmers with the dependability of their software. We have been addressing this problem in several ways, one of which includes supporting end-user debugging activities through fault localization techniques. This paper presents the results of an empirical study conducted in an end-user programming environment to examine the impact of two separate factors in fault localization techniques that affect technique effectiveness. Our results …
Performance Analysis Of Sparse Traffic Grooming In Wdm Mesh Networks, Wang Yao, Mengke Li, Byrav Ramamurthy
Performance Analysis Of Sparse Traffic Grooming In Wdm Mesh Networks, Wang Yao, Mengke Li, Byrav Ramamurthy
CSE Conference and Workshop Papers
Sparse traffic grooming is a practical problem to be addressed in heterogeneous multi-vendor optical WDM networks where only some of the optical cross-connects (OXCs) have grooming capabilities. Such a network is called as a sparse grooming network. The sparse grooming problem under dynamic traffic in optical WDM mesh networks is a relatively unexplored problem. In this work, we propose the maximize-lightpath-sharing multi-hop (MLS-MH) grooming algorithm to support dynamic traffic grooming in sparse grooming networks. We also present an analytical model to evaluate the blocking performance of the MLS-MH algorithm. Simulation results show that MLSMH outperforms an existing grooming algorithm, the …
A Controlled Experiment Assessing Test Case Prioritization Techniques Via Mutation Faults, Hyunsook Do, Gregg Rothermel
A Controlled Experiment Assessing Test Case Prioritization Techniques Via Mutation Faults, Hyunsook Do, Gregg Rothermel
CSE Conference and Workshop Papers
Regression testing is an important part of software maintenance, but it can also be very expensive. To reduce this expense, software testers may prioritize their test cases so that those that are more important are run earlier in the regression testing process. Previous work has shown that prioritization can improve a test suite’s rate of fault detection, but the assessment of prioritization techniques has been limited to hand-seeded faults, primarily due to the belief that such faults are more realistic than automatically generated (mutation) faults. A recent empirical study, however, suggests that mutation faults can be representative of real faults. …
Dcdp: A Novel Data-Centric And Design-Pattern Based Approach To Automatic Loop Transformation And Parallelization For A Shared-Object Environment In Clusters, Xuli Liu, Hong Jiang, Leen-Kiat Soh
Dcdp: A Novel Data-Centric And Design-Pattern Based Approach To Automatic Loop Transformation And Parallelization For A Shared-Object Environment In Clusters, Xuli Liu, Hong Jiang, Leen-Kiat Soh
CSE Technical Reports
Most of the parallelism associated with scientific/numeric applications exists in the form of loops, and thus transforming loops has been extensively studied in the past, especially in the areas of programming languages and compiler designs. Almost all the existing transformation approaches are control-centric, in which the transformation process starts from partitioning the iteration space, followed by the decomposition of the data space only as a side-effect. Originally designed for shared-memory multi-processors, these control-centric approaches might not be suitable under some circumstances for current loosely-coupled clusters and the Grid with physically distributed memories. In this paper, we introduce a novel data-centric …
Utilizing Device Slack For Energy-Efficient I/O Device Scheduling In Hard Real-Time Systems With Non-Preemptible Resources, Hui Cheng, Steve Goddard
Utilizing Device Slack For Energy-Efficient I/O Device Scheduling In Hard Real-Time Systems With Non-Preemptible Resources, Hui Cheng, Steve Goddard
CSE Technical Reports
The challenge in conserving energy in embedded real-time systems is to reduce power consumption while preserving temporal correctness. Much research has focused on power conservation for the processor, while power conservation for I/O devices has received little attention. In this paper, we analyze the problem of online energy-aware I/O scheduling for hard real-time systems based on the preemptive periodic task model with non-preemptible shared resources. We extend the concept of device slack proposed in [2] to support non-preemptible shared resources; and propose an online energy-aware I/O scheduling algorithm: Energy-efficient Device Scheduling with Non-preemptible Resources (EEDS NR). The EEDS NR algorithm …
Efficient Test Compaction For Pseudo-Random Testing, Sheng Zhang, Sharad C. Seth, Bhargab B. Bhattacharya
Efficient Test Compaction For Pseudo-Random Testing, Sheng Zhang, Sharad C. Seth, Bhargab B. Bhattacharya
CSE Conference and Workshop Papers
Compact set of 3-valued test vectors for random pattern resistant faults are covered in multiple test passes. During a pass, its associated test cube specifies certain bits in the scan chain to be held fixed and others to change pseudo-randomly. We propose an algorithm to find a small number of cubes to cover all the test vectors, thus minimizing total test length. The test-cube finding algorithm repeatedly evaluates small perturbations of the current solution so as to maximize the expected test coverage of the cube. Experimental results show that our algorithm covers the test vectors by test cubes that are …
Neighborhood Interchangeability And Dynamic Bundling For Non-Binary Finite Csps, Anagh Lal, Berthe Y. Choueiry, Eugene C. Freuder
Neighborhood Interchangeability And Dynamic Bundling For Non-Binary Finite Csps, Anagh Lal, Berthe Y. Choueiry, Eugene C. Freuder
CSE Conference and Workshop Papers
Neighborhood Interchangeability (NI) identifies the equivalent values in the domain of a variable of a Constraint Satisfaction Problem (CSP) by considering only the constraints that directly apply to the variable. Freuder described an algorithm for efficiently computing NI values in binary CSPs. In this paper, we show that the generalization of this algorithm to non-binary CSPs is not straightforward, and introduce an efficient algorithm for computing NI values in the presence of non-binary constraints. Further, we show how to interleave this mechanism with search for solving CSPs, thus yielding a dynamic bundling strategy. While the goal of dynamic bundling is …
Real-Time Divisible Load Scheduling For Cluster Computing, Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Goddard
Real-Time Divisible Load Scheduling For Cluster Computing, Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Goddard
CSE Technical Reports
Cluster Computing has emerged as a new paradigm for solving large-scale problems. To enhance QoS and provide performance guarantees in cluster computing environments, various workload models and real-time scheduling algorithms have been investigated. The divisible load model, propagated by divisible load theory, models computations that can be arbitrarily divided into independent pieces and provides a good approximation of many real-world applications. However, researchers have not yet investigated the problem of providing performance guarantees to divisible load applications. Two contributions are made in this paper: (1) divisible load theory is extended to compute the minimum number of processors required to meet …
Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar
Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar
CSE Technical Reports
Usability patterns represent knowledge about known ways to design graphical user interfaces that are usable and meet the needs and expectations of users. There is currently a plethora of usability patterns published in books, private repositories and the World-Wide Web. The dominance of pattern discovery efforts has neglected the emerging need to organize the patterns so they can become a proactive resource for developing interfaces. This paper presents an approach using Semantic Web concepts that turns informal patterns into formal representations capable of supporting systematic design methods. Through this method, loosely coupled pattern collections can be turned into strongly coupled …
Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar
Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar
CSE Technical Reports
Usability patterns represent knowledge about known ways to design graphical user interfaces that are usable and meet the needs and expectations of users. There is currently a plethora of usability patterns published in books, private repositories and the World-Wide Web. The dominance of pattern discovery efforts has neglected the emerging need to organize the patterns so they can become a proactive resource for developing interfaces. This paper presents an approach using Semantic Web concepts that turns informal patterns into formal representations capable of supporting systematic design methods. Through this method, loosely coupled pattern collections can be turned into strongly coupled …
Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar
Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar
CSE Technical Reports
Usability patterns represent knowledge about known ways to design graphical user interfaces that are usable and meet the needs and expectations of users. There is currently a plethora of usability patterns published in books, private repositories and the World-Wide Web. The dominance of pattern discovery efforts has neglected the emerging need to organize the patterns so they can become a proactive resource for developing interfaces. This paper presents an approach using Semantic Web concepts that turns informal patterns into formal representations capable of supporting systematic design methods. Through this method, loosely coupled pattern collections can be turned into strongly coupled …
Crtdh: An Efficient Key Agreement Scheme For Secure Group Communications In Wireless Ad Hoc Networks, Ravi K Balachandran, Byrav Ramamurthy, Xukai Zou, N.V. Vinodchandran
Crtdh: An Efficient Key Agreement Scheme For Secure Group Communications In Wireless Ad Hoc Networks, Ravi K Balachandran, Byrav Ramamurthy, Xukai Zou, N.V. Vinodchandran
CSE Conference and Workshop Papers
As a result of the growing popularity of wireless networks, in particular ad hoc networks, security over such networks has become very important. In this paper, we study the problem of secure group communications (SGC) and key management over ad hoc networks. We identify the key features of any SGC protocol for such networks. We also propose an efficient key agreement scheme for SGC. The scheme solves two important problems that exist in most current SGC schemes: requirement of member serialization and existence of a central entity. Besides this, the protocol also has many highly desirable properties such as contributory …
Ground Water Monitoring Using Smart Sensors, Srikanth Anumalla, Byrav Ramamurthy, David Gosselin
Ground Water Monitoring Using Smart Sensors, Srikanth Anumalla, Byrav Ramamurthy, David Gosselin
CSE Conference and Workshop Papers
Groundwater resources are the principal source of drinking water for about 50 percent of the United States population. Groundwater resources in Nebraska are under increasing stress as there is a rapid growth in their usage. Water managers need more timely and accurate data to assess ground-water conditions to manage adverse situations such as drought and loss of pumpage in agriculture and domestic water supply. Currently groundwater researchers use stand-alone data logging equipment which is labor intensive and the method is not easily scalable if the number of logging locations increases. Commercially available real-time data monitoring solutions are either prohibitively costly …
Survivable Waveband Switching In Wdm Mesh Networks Under Dedicated Path-Protection, Mengke Li, Byrav Ramamurthy
Survivable Waveband Switching In Wdm Mesh Networks Under Dedicated Path-Protection, Mengke Li, Byrav Ramamurthy
CSE Conference and Workshop Papers
This paper considers the problem of dedicated path-protection in wavelength-division multiplexed (WDM) mesh networks with waveband switching functionality under shared risk link group (SRLG) constraints. Two dedicated path protection schemes are proposed, namely the PBABL scheme and the MPABWL scheme. The PBABL scheme protects each working waveband-path through a backup waveband-path. The MPABWL scheme protects each working waveband-path by either a backup waveband-path or multiple backup lightpaths. Heuristic algorithms adopting random optimization technique are proposed for both the schemes. The performance of the two protection schemes is studied and compared. Simulation results show that both the heuristics can obtain optimum …
Same-Destination-Intermediate Grouping Vs. End-To-End Grouping For Waveband Switching In Wdm Mesh Networks, Mengke Li, Wang Yao, Byrav Ramamurthy
Same-Destination-Intermediate Grouping Vs. End-To-End Grouping For Waveband Switching In Wdm Mesh Networks, Mengke Li, Wang Yao, Byrav Ramamurthy
CSE Conference and Workshop Papers
We investigate waveband switching (WBS) with different grouping strategies in wavelength-division multiplexing (WDM) mesh networks. End-to-end waveband switching (ETEWBS) and same-destination-intermediate waveband switching (SD-IT-WBS) are analyzed and compared in terms of blocking probability and cost savings. First, an analytical model for ETEWBS is proposed to determine the network blocking probability in a mesh network. For SD-IT-WBS, a simple waveband switching algorithm is presented. An analytical model to determine the network blocking probability is proposed for SD-IT-WBS based on the algorithm. The analytical results are validated by comparing with simulation results. Both results match well and show that ETE-WBS slightly outperforms …
A Novel Cost-Efficient On-Line Intermediate Waveband-Switching Scheme In Wdm Mesh Networks, Mengke Li, Wang Yao, Byrav Ramamurthy
A Novel Cost-Efficient On-Line Intermediate Waveband-Switching Scheme In Wdm Mesh Networks, Mengke Li, Wang Yao, Byrav Ramamurthy
CSE Conference and Workshop Papers
Waveband switching (WBS) is an important technique to save switching and transmission cost in wavelength -division multiplexed (WDM) optical networks. A cost-efficient WBS scheme would enable network carriers to increase the network throughput (revenue) while achieving significant cost savings. We identify the critical factors that determine the WBS network throughput and switching cost and propose a novel intermediate waveband switching (IT-WBS) algorithm, called the minimizing-weighted-cost (MWC) algorithm. The MWC algorithm defines a cost for each candidate route of a call. By selecting the route with the smallest weighted cost, MWC balances between minimizing the call blocking probability and minimizing the …
Technical Reports (1999 - 2005)
Technical Reports (1999 - 2005)
CSE Technical Reports
Authors of Technical Reports (1999-2005):
Choueiry, Berthe
Elbaum, Sebastian
Goddard, Steve
Henninger, Scott
Jiang, Hong
Rothermel, Gregg
Scott, Stephen
Seth, Sharad
Soh, Leen-Kiat
Variyam, Vinodchandran
Discontinuous Waveband Switching In Wdm Optical Networks, Bhavana Lekkala, Byrav Ramamurthy
Discontinuous Waveband Switching In Wdm Optical Networks, Bhavana Lekkala, Byrav Ramamurthy
CSE Conference and Workshop Papers
Routing techniques used in wavelength routed optical networks (WRN) do not give an efficient solution with Waveband routed optical networks (WBN) as the objective of routing in WRN is to reduce the blocking probability and that in WBN is to reduce the number of switching ports. Routing in WBN can be divided two parts, finding the route and grouping the wavelength assigned into that route with some existing wavelengths/wavebands. In this paper, we propose a heuristic for waveband routing, which uses a new grouping strategy called discontinuous waveband grouping to group the wavelengths into a waveband. The main objective of …
On Finding Consecutive Test Vectors In A Random Sequence For Energy-Aware Bist Design, Sheng Zhang, Sharad C. Seth, Bhargab B. Bhattacharya
On Finding Consecutive Test Vectors In A Random Sequence For Energy-Aware Bist Design, Sheng Zhang, Sharad C. Seth, Bhargab B. Bhattacharya
CSE Conference and Workshop Papers
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute to fault dropping. For low-power testing, modification logic/ROM may be used to skip the LFSR states that generate useless test patterns. The overhead of extra logic increases rapidly with the number of such jumps. Since identification of useless patterns strongly depends on the order in which incremental fault simulation is performed, an elegant solution to this problem would be to find a minimum set of segments in the LFSR sequence, where each segment corresponds …