Optimization of Reduced Dependencies for Synchronous Sequential Machines

From MaRDI portal
Revision as of 03:47, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5583470

DOI10.1109/PGEC.1967.264747zbMath0189.16904WikidataQ114628998 ScholiaQ114628998MaRDI QIDQ5583470

Robert Tienwen Chien, Gernot Metze, Franco P. Preparata

Publication date: 1967

Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)




Related Items (only showing first 100 items - show all)

\(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networksThe 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) modelThe \(t/s\)-diagnosability and \(t/s\)-diagnosis algorithm of folded hypercube under the PMC/MM* modelReliability analysis of the cactus-based networksOn the \(t/k\)-diagnosability of BC networksThe \(g\)-good-neighbor conditional diagnosability of \(n\)-dimensional hypercubes under the MM* modelDiagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic modelThe \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphsDiagnosability of star graphs under the comparison diagnosis modelOn the conditional diagnosability of matching composition networksThe strong local diagnosability of a hypercube network with missing edgesSystem-level diagnosis: analysis of two new modelsFault-tolerant sequential scanPaths and cycles identifying vertices in twisted cubes2-satisfiability and diagnosing fault processors in massively parallel computing systemsNecessary and sufficient conditions for \(t\)-diagnosability of multiprocessor computer systems for various models of nonreliable testing established using the system graph-theoretical modelAn efficient algorithm for multiprocessor fault diagnosis using the comparison approachDiagnosis in hybrid fault situations under AIM and a unified t- characterization theoremA diagnosis algorithm by using graph-coloring under the PMC modelThe 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphsDiagnosability of digital systems structured as minimal quasicomplete \(7 \times 7\) graphDetermining the majority: The biased caseDiagnosable evaluation of enhanced optical transpose interconnection system networksConditional diagnosability of the round matching composition networksThe \(g\)-good-neighbor conditional diagnosability of locally twisted cubesConditional diagnosability of multiprocessor systems based on complete-transposition graphsA \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube networkOn \(t\)-diagnosability of multicore systems with symmetric circulant structureRandom and conditional \((t,k)\)-diagnosis of hypercubesOn \(g\)-extra conditional diagnosability of hypercubes and folded hypercubesFault isolation and identification in general biswapped networks under the PMC diagnostic modelA local-sparing design methodology for fault-tolerant multiprocessorsConditional local self-regulation rules and a diagnostic algorithm for a multiprocessor system with circulant diagnostic structure based on these rulesDiagnosis of multiprocessor systems under failure of more than half processorsConditional diagnosability of arrangement graphs under the PMC modelAn approach to conditional diagnosability analysis under the PMC model and its application to torus networks\(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) modelThe pessimistic diagnosabilities of some general regular graphsOn conditional fault tolerance and diagnosability of hierarchical cubic networksA new method to test system diagnosabilityConditional diagnosability of bubble-sort star graphsThe conditional fault diagnosability of \((n, k)\)-star graphsThe pessimistic diagnosability of data center networksReliability of \((n,k)\)-star network based on \(g\)-extra conditional faultA general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networksAnalysis of the possibility of local diagnosis in computer systems with circulant structure based on redundancy in the number of analyzed testing resultsThe \(g\)-good-neighbor conditional diagnosability of hypercube under PMC modelHybrid fault diagnosis capability analysis of regular graphsA fast fault-identification algorithm for bijective connection graphs using the PMC modelDynamic design of a reliable computer network on using information theoryThe conditional diagnosability of shuffle-cubesConditional diagnosability of alternating group networksThe \(g\)-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* modelOn fault identification in interconnection networks under the comparison modelConditional diagnosability and strong diagnosability of split-star networks under the PMC modelThe pessimistic diagnosability of alternating group graphs under the PMC modelThe extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCellThe 2-good-neighbor (2-extra) diagnosability of alternating group graph networks under the PMC model and MM\(^*\) modelFault diagnosability of DQcube under the PMC modelThe diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodesFault diagnosability of arrangement graphsAdaptive system-level diagnosis for hypercube multiprocessors using a comparison modelOn the conceptual foundations of comparative analysis and solution of self-diagnostic problems in multiprocessor systems under different unreliable testing modelsCredible execution of bounded-time parallel systems with delayed diagnosisThe relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC modelThe pessimistic diagnosability of three kinds of graphsThe 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networksDetermining majority in networks with local interactions and very small local memoryReliability analysis of Cayley graphs generated by transpositionsConnectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphsHybrid fault diagnosis capability analysis of hypercubes under the PMC model and \(\mathrm{MM}^\ast\) modelComputing majority with triple queriesConditional diagnosability of a class of matching composition networks under the comparison modelThe \(g\)-good-neighbor conditional diagnosability of star graphs under the PMC and MM* modelStrong diagnosability of regular networks under the comparison modelDistributed fault detection and isolation of continuous-time non-linear systemsOn sequential diagnosis of multiprocessor systemsThe plurality problem with three colors and more.A survey for conditional diagnosability of alternating group networksA general technique to establish the asymptotic conditional diagnosability of interconnection networksLocal diagnosability of generic star-pyramid graphThe \(g\)-good-neighbor diagnosability of \((n,k)\)-star graphsComponent conditional fault tolerance of hierarchical folded cubic networksPartial and complete local diagnosis in computer systems with circulant structureThe \(R_g\)-conditional diagnosability of international networksSystem diagnosis with smallest risk of errorMeasurement and algorithm for conditional local diagnosis of regular networks under the \(\mathrm{MM}^\ast\) modelNumber of mutual connections in neighborhoods and its application to self-diagnosable systemsThe worst-case chip problemScheduling multiprocessor tasks -- An overviewReliability of the round matching composition networks based on \(g\)-extra conditional faultA flexible formal framework for masking/demasking faultsTwo-level self-diagnosis model for bus-topology distributed systemsAlarm placement in systems with fault propagationTwo-round diagnosability measures for multiprocessor systemsOrganization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphsScheduling independent 2-processor tasks to minimize schedule lengthFault-diagnosis of grid structures.Quantifying fault recovery in multiprocessor systemsTest case generators and computational results for the maximum clique problem







This page was built for publication: Optimization of Reduced Dependencies for Synchronous Sequential Machines