Suchergebnisse - "shared‐memory algorithms"

PATSMA: Parameter Auto-tuning for Shared Memory Algorithms

Autoren: Joao B. Fernandes Felipe H. Santos-da-Silva Tiago Barros et al.

Quelle: SoftwareX, Vol 27, Iss , Pp 101789- (2024)

Schlagwörter: Auto-tuning, Runtime, Parameter optimization, CSA, Nelder–Mead, Computer software, QA76.75-76.765

Dateibeschreibung: electronic resource

Relation: http://www.sciencedirect.com/science/article/pii/S2352711024001602; https://doaj.org/toc/2352-7110

Zugangs-URL: https://doaj.org/article/bac443f3838549b7a2379a11aeb59a0d

PATSMA: Parameter Auto-tuning for Shared Memory Algorithms

Autoren: Fernandes, Joao B. da Silva, Felipe H. S. Xavier-de-Souza, Samuel et al.

Index Begriffe: Computer Science - Distributed, Parallel, and Cluster Computing, text

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

Formal Analysis of Distributed Shared Memory Algorithms

Autoren: Muhammad Atif null Mudassar Naseer null Ahmad Salman Khan

Quelle: UMT Artificial Intelligence Review. 2

Contention---free complexity of shared memory algorithms: Contention-free complexity of shared memory algorithms

Autoren: Rajeev Alur Gadi Taubenfeld

Quelle: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94. :61-70

Schlagwörter: Computational Theory and Mathematics, Analysis of algorithms and problem complexity, Parallel algorithms in computer science, shared memory algorithms, Theoretical Computer Science, Information Systems, Computer Science Applications

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/896648
https://doi.org/10.1006/inco.1996.0034
http://www.faculty.idc.ac.il/gadi/MyPapers/1996AT-contention-free.pdf
https://www.faculty.idc.ac.il/gadi/MyPapers/1996AT-contention-free.pdf
https://dblp.uni-trier.de/db/conf/podc/podc94.html#AlurT94
https://core.ac.uk/display/24328180
https://dl.acm.org/doi/10.1145/197917.197953
https://core.ac.uk/display/82037135
http://www.sciencedirect.com/science/article/pii/S0890540196900346
https://dl.acm.org/doi/10.1006/inco.1996.0034
https://www.sciencedirect.com/science/article/pii/S0890540196900346
https://dblp.uni-trier.de/db/journals/iandc/iandc126.html#AlurT96

Contention in shared memory algorithms

Autoren: Cynthia Dwork Orli Waarts Maurice Herlihy

Quelle: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93. :174-183

Schlagwörter: Computer system organization, counting networks, shared-memory algorithms, Parallel algorithms in computer science

Dateibeschreibung: application/xml

Zugangs-URL: https://core.ac.uk/display/108231001
https://doi.acm.org/10.1145/268999.269000
https://dl.acm.org/doi/abs/10.1145/268999.269000
http://portal.acm.org/citation.cfm?doid=268999.269000
https://doi.org/10.1145/268999.269000
https://dblp.uni-trier.de/db/journals/jacm/jacm44.html#DworkHW97
https://core.ac.uk/display/24654053
http://cs.brown.edu/people/mph/DworkHW97a/p779-dwork.pdf
https://dl.acm.org/doi/10.1145/167088.167145
https://dblp.uni-trier.de/db/conf/stoc/stoc1993.html#DworkHW93
https://doi.org/10.1145/167088.167145

Brief Announcement: Fully Anonymous Shared Memory Algorithms

Autoren: Michel Raynal Gadi Taubenfeld

Quelle: Lecture Notes in Computer Science ISBN: 9783030349912

Schlagwörter: 16. Peace & justice

Zugangs-URL: https://dblp.uni-trier.de/db/conf/sss/sss2019.html#RaynalT19
https://link.springer.com/chapter/10.1007%2F978-3-030-34992-9_24
https://rd.springer.com/chapter/10.1007/978-3-030-34992-9_24

On the cost of composing shared-memory algorithms

Autoren: Alistarh Dan Guerraoui Rachid Kuznetsov Petr et al.

Quelle: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures. :298-307

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://infoscience.epfl.ch/record/208739/files/on_the_cost_p298-alistarh.pdf
https://core.ac.uk/display/148013192
https://dl.acm.org/doi/10.1145/2312005.2312057
https://infoscience.epfl.ch/record/208739
https://dblp.uni-trier.de/db/conf/spaa/spaa2012.html#AlistarhGKL12
https://doi.org/10.1145/2312005.2312057

allocate on use space complexity of shared memory algorithms

Autoren: Aspnes, James Haeupler, Bernhard Tong, Alexander et al.

Weitere Verfasser: Aspnes, James Haeupler, Bernhard Tong, Alexander et al.

Schlagwörter: mutual exclusion, Space complexity, memory allocation, ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: https://dblp.uni-trier.de/db/conf/wdag/disc2018.html#AspnesHTW18
http://drops.dagstuhl.de/opus/volltexte/2018/9797/pdf/LIPIcs-DISC-2018-8.pdf/
http://drops.dagstuhl.de/opus/volltexte/2018/9797/
https://drops.dagstuhl.de/opus/volltexte/2018/9797/pdf/LIPIcs-DISC-2018-8.pdf/
http://dblp.uni-trier.de/db/conf/wdag/disc2018.html#AspnesHTW18
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.8

Fully Anonymous Shared Memory Algorithms

Autoren: Raynal, Michel Taubenfeld, Gadi

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Distributed, Parallel, and Cluster Computing (cs.DC), 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/1909.05576

Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

Autoren: David A. Bader Guojing Cong

Quelle: Journal of Parallel and Distributed Computing. 66:1366-1378

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 15. Life on land, 16. Peace & justice, 7. Clean energy, 01 natural sciences, 3. Good health

Zugangs-URL: http://www.cs.unm.edu/~treport/tr/03-12/MST-bader.pdf
http://www.cs.unm.edu/~treport/tr/03-12/MST-bader.pdf
http://ieeexplore.ieee.org/document/1302953/
https://www.computer.org/portal/web/csdl/doi/10.1109/IPDPS.2004.1302953
https://dblp.uni-trier.de/db/conf/ipps/ipdps2004-c.html#BaderC04a
https://ieeexplore.ieee.org/document/1302953/
https://www.computer.org/csdl/proceedings-article/ipdps/2004/213210039a/12OmNwLOYUD

An analysis of distributed shared memory algorithms

Autoren: Miron Livny R.E. Kessler

Quelle: [1989] Proceedings. The 9th International Conference on Distributed Computing Systems. :498-505

Schlagwörter: 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://minds.wisconsin.edu/bitstream/1793/59080/1/TR825.pdf
https://dblp.uni-trier.de/db/conf/icdcs/icdcs89.html#KesslerL89
https://ieeexplore.ieee.org/document/37982/
https://minds.wisconsin.edu/bitstream/1793/59080/1/TR825.pdf
https://minds.wisconsin.edu/handle/1793/59080

Fault tolerant distributed shared memory algorithms

Autoren: Michael Stumm Songnian Zhou

Quelle: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990. :719-724

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://ieeexplore.ieee.org/document/143633/
https://dblp.uni-trier.de/db/conf/spdp/spdp90.html#StummZ90

Virtual Shared Memory: Algorithms and Complexity: Virtual shared memory: Algorithms and complexity

Autoren: Andrew Chin W. F. McColl

Quelle: Information and Computation. 113:199-219

Schlagwörter: Computational Theory and Mathematics, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, parallel computers, parallel algorithms, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 02 engineering and technology, Theoretical Computer Science, Information Systems, Computer Science Applications

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/638552
https://doi.org/10.1006/inco.1994.1069
https://dblp.uni-trier.de/db/journals/iandc/iandc113.html#ChinM94
https://www.sciencedirect.com/science/article/abs/pii/S0890540184710698
https://core.ac.uk/display/82617919

An analysis of dag-consistent distributed shared-memory algorithms

Autoren: Matteo Frigo Charles E. Leiserson Keith H. Randall et al.

Quelle: Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures - SPAA '96. :297-308

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: http://supertech.csail.mit.edu/papers/spaa96.pdf
https://dl.acm.org/doi/10.1145/237502.237574
http://supertech.csail.mit.edu/papers/spaa96.pdf
https://core.ac.uk/display/24289038
https://doi.org/10.1145/237502.237574
https://dblp.uni-trier.de/db/conf/spaa/spaa96.html#BlumofeFJLR96

A GPU scalable Out-of-Core volume rendering for 3D temporal multivariate data

Autoren: Thebault, Antoine Prevost, Stéphanie Lucas, Laurent et al.

Weitere Verfasser: Thebault, Antoine Prevost, Stéphanie Lucas, Laurent et al.

Schlagwörter: Software design engineering, data structures, out of core, [INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], volume rendering, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-GR] Computer Science [cs]/Graphics [cs.GR], Ray tracing, Shared memory algorithms, [INFO] Computer Science [cs]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-05141613v1

Towards a Theory of Randomized Shared Memory Algorithms

Autoren: Philipp Woelfel

Quelle: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. :156-156

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://dblp.uni-trier.de/db/conf/podc/podc2019.html#Woelfel19
https://dl.acm.org/doi/10.1145/3293611.3338838

Shared-Memory Algorithms

Autoren: Chryssis Georgiou Alexander A. Shvartsman

Quelle: Synthesis Lectures on Distributed Computing Theory ISBN: 9783031008771

uBlade: Efficient Batch Processing for Uncertainty Graph Queries

Autoren: Siyuan Yao Yuchen Li Shixuan Sun et al.

Quelle: Proceedings of the ACM on Management of Data. 2:1-24

Schlagwörter: Uncertain graphs, 0301 basic medicine, 03 medical and health sciences, Databases and Information Systems, Computer Sciences, Parallel programming, 0202 electrical engineering, electronic engineering, information engineering, network reliability, Shared memory algorithms, 02 engineering and technology, Graph algorithms, Computing methodologies

Dateibeschreibung: application/pdf

More Shared-memory Algorithms

Quelle: Series in Computer Science ISBN: 0306459701

A Conflict-Resilient Lock-Free Linearizable Calendar Queue

Autoren: Romolo Marotta Mauro Ianni Alessandro Pellegrini et al.

Weitere Verfasser: Romolo Marotta Mauro Ianni Alessandro Pellegrini et al.

Quelle: ACM Transactions on Parallel Computing. 11:1-32

Schlagwörter: Pending event set, Settore ING-INF/05, Data structures design and analysis, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Settore IINF-05/A - Sistemi di elaborazione delle informazioni, Non-blocking priority queue, Shared memory algorithms, 02 engineering and technology, Concurrent algorithms

Dateibeschreibung: application/pdf