Suchergebnisse - optimal fault-tolerant EREW PRAM algorithm

controlling memory access concurrency in efficient fault tolerant parallel algorithms: Controlling memory access concurrency in efficient fault-tolerant parallel algorithms

Autoren: Alexander A. Shvartsman Dimitrios Michailidis Paris C. Kanellakis

Quelle: Nordic Journal of Computing. 2(2):146-180

Schlagwörter: Distributed algorithms, optimal fault-tolerant EREW PRAM algorithm, CRCW PRAM

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/794259
https://dblp.uni-trier.de/db/journals/njc/njc2.html#KanellakisMS95
https://dl.acm.org/doi/10.5555/642068.642072

Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs

Autoren: Khan, Shahbaz

Index Begriffe: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1705.03637

Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract)

Autoren: Alexander A. Shvartsman Dimitrios Michailidis Paris C. Kanellakis

Quelle: Lecture Notes in Computer Science ISBN: 9783540572718

Zugangs-URL: https://rd.springer.com/chapter/10.1007/3-540-57271-6_30
https://link.springer.com/chapter/10.1007/3-540-57271-6_30
https://dblp.uni-trier.de/db/conf/wdag/wdag93.html#KanellakisMS93
https://link.springer.com/content/pdf/10.1007%2F3-540-57271-6_30.pdf
https://augusta.pure.elsevier.com/en/publications/controlling-memory-access-concurrency-in-efficient-fault-tolerant

Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs

Autoren: Shahbaz Khan

Quelle: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. :283-292

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Zugangs-URL: http://arxiv.org/pdf/1705.03637
http://arxiv.org/abs/1705.03637
http://export.arxiv.org/pdf/1705.03637
https://ui.adsabs.harvard.edu/abs/2017arXiv170503637K/abstract
https://arxiv.org/abs/1705.03637
https://arxiv.org/pdf/1705.03637
https://dblp.uni-trier.de/db/journals/corr/corr1705.html#Khan17
https://arxiv.org/abs/1705.03637
https://doi.org/10.1145/3087556.3087576
https://core.ac.uk/display/83857635

Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms

Autoren: Kanellakis, Paris C. Michailidis, Dimitrios Shvartsman, Alex A. et al.

Weitere Verfasser: Kanellakis, Paris C. Michailidis, Dimitrios Shvartsman, Alex A. et al.

Quelle: DTIC AND NTIS

Schlagwörter: Numerical Mathematics, Computer Programming and Software, ALGORITHMS, MULTIPROCESSORS, FAULT TOLERANCE, SIMULATION, MODELS, DYNAMICS, FAILURE, BEHAVIOR, FAULTS, REDUNDANCY, NUMBERS, EFFICIENCY, MEMORY DEVICES, RELIABILITY, GUARANTEES, PATTERNS

Dateibeschreibung: text/html

Relation: http://www.dtic.mil/docs/citations/ADA280909

Verfügbarkeit: http://www.dtic.mil/docs/citations/ADA280909
http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA280909

Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs

Autoren: Khan, Shahbaz Google India under the Google India PhD Fellowship Award

Weitere Verfasser: Khan, Shahbaz Google India under the Google India PhD Fellowship Award

Quelle: ACM Transactions on Parallel Computing ; volume 6, issue 3, page 1-33 ; ISSN 2329-4949 2329-4957

Verfügbarkeit: https://doi.org/10.1145/3364212
https://dl.acm.org/doi/10.1145/3364212
https://dl.acm.org/doi/pdf/10.1145/3364212

Directed s-t numberings, Rubber bands, and testing digraph k-vertex connectivity.

Autoren: Cheriyan, Joseph Reif, John

Quelle: Combinatorica; Dec1994, Vol. 14 Issue 4, p435-451, 17p

An -size fault-tolerant sorting network

Autoren: Yuan Ma The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Yuan Ma The Pennsylvania State University CiteSeerX Archives

Quelle: http://theorie.informatik.uni-ulm.de/Personen/Thierauf/Lehre/Par-Alg/Papers-on-line/ma.ps.

Schlagwörter: by Yuan Ma

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.4791

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.4791
http://theorie.informatik.uni-ulm.de/Personen/Thierauf/Lehre/Par-Alg/Papers-on-line/ma.ps

Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation.

Autoren: Hu, Xiao Tao, Yufei

Quelle: Journal of the ACM; Feb2024, Vol. 71 Issue 1, p1-44, 44p

Schlagwörter: ALGORITHMS, DATABASES, HYPERGRAPHS, OPEN-ended questions, PARALLEL algorithms

Exact Parallel Plurality Voting Algorithm for Totally Ordered Object Space Fault-Tolerant Systems.

Autoren: Karimi, Abbas Zarafshan, Faraneh Jantan, Adznan et al.

Quelle: Pertanika Journal of Science & Technology; Jan2012, Vol. 20 Issue 1, p89-96, 8p

Schlagwörter: PLURALITY voting, FAULT-tolerant computing, DECISION making, PARALLEL algorithms, ASYMPTOTIC distribution, RELIABILITY in engineering, DISTRIBUTED shared memory

Parallel Weighted Random Sampling.

Autoren: HÜBSCHLE-SCHNEIDER, LORENZ SANDERS, PETER

Quelle: ACM Transactions on Mathematical Software; Sep2022, Vol. 48 Issue 3, p1-40, 40p

Schlagwörter: DISTRIBUTED algorithms, PARALLEL algorithms, DATA structures, STATISTICAL sampling, ALGORITHMS

A Wait-Free Sorting Algorithm.

Autoren: Shavit, N. Upfal, E. Zemach, A.

Quelle: Theory of Computing Systems; Nov/Dec2001, Vol. 34 Issue 6, p519, 26p

Schlagwörter: SORTING (Electronic computers), ELECTRONIC data processing, ALGORITHMS

Breaking the /spl Theta/(nlog/sup 2/ n) barrier for sorting with faults.

Autoren: Leighton, T. Yuan Ma

Quelle: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science; 1993, p734-743, 10p

Independent Spanning Trees on Multidimensional Torus Networks.

Autoren: Shyue-Ming Tang Jinn-Shyong Yang Yue-Li Wang et al.

Quelle: IEEE Transactions on Computers; Jan2010, Vol. 59 Issue 1, p93-102, 10p, 3 Diagrams, 1 Chart

Schlagwörter: SPANNING trees, COMPUTER networks, BROADCASTING industry, FAULT-tolerant computing, PARALLEL algorithms

Fully-scalable fault-tolerant simulations for BSP and CGM.

Autoren: Sung-Ryul Kim Kunsoo Park

Quelle: Proceedings 13th International Parallel Processing Symposium & 10th Symposium on Parallel & Distributed Processing IPPS/SPDP 1999; 1999, p117-124, 8p

CONNECTIVITY ORACLES FOR GRAPHS SUBJECT TO VERTEX FAILURES.

Autoren: RAN DUAN PETTIE, SETH

Quelle: SIAM Journal on Computing; 2020, Vol. 49 Issue 6, p1363-1396, 34p

Schlagwörter: MONTE Carlo method, GRAPH connectivity, UNDIRECTED graphs, DETERMINISTIC processes, DATA structures, BATCH processing, DETERMINISTIC algorithms

Deterministic Computations on a PRAM with Static Processor and Memory Faults.

Autoren: Chlebus, Bogdan S. Gasieniec, Leszek Pelc, Andrzej

Quelle: Fundamenta Informaticae; Jul2003, Vol. 56 Issue 1-2, p285-306, 22p

Schlagwörter: RANDOM access memory, COMPUTER simulation, MACHINERY, COMPUTER storage devices, FRACTIONS

Parallel algorithms for m-out-of-n threshold voting.

Autoren: Parhami, B.

Quelle: Proceedings of 1996 IEEE Second International Conference on Algorithms & Architectures for Parallel Processing, ICA/Sup 3/PP '96; 1996, p225-232, 8p

Robust Parallel Computations through Randomization.

Autoren: Kontogiannis, S. C. Pantziou, G. E. Spirakis, P. G. et al.

Quelle: Theory of Computing Systems; 2000, Vol. 33 Issue 5/6, p427, 38p

Schlagwörter: COMPUTER simulation, COMPUTERS

Editor's foreword special issue on parallel and distributed computing, Part II.

Autoren: Vitter, Jeffrey

Quelle: Algorithmica; Nov1988, Vol. 3 Issue 1-4, p289-291, 3p