Suchergebnisse - "Theory of computation - Parallel computing models"

Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages

Autoren: Din, Crystal Hähnle, Reiner Henrio, Ludovic et al.

Weitere Verfasser: Din, Crystal Hähnle, Reiner Henrio, Ludovic et al.

Quelle: ACM Transactions on Programming Languages and Systems

Schlagwörter: CCS Concepts, Programming logic, Theory of computation → Parallel computing models, • Software and its engineering → Concurrent programming structures, CCS Concepts: Theory of computation → Parallel computing models Programming logic Program semantics • Software and its engineering → Concurrent programming structures, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Program semantics, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-04732946v1
https://hal.science/hal-04732946v1/document
https://doi.org/10.1145/3648439
https://hdl.handle.net/11250/3152463

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable

Autoren: Czerwiński, Wojciech Hofman, Piotr Wojciech Czerwiński and Piotr Hofman et al.

Weitere Verfasser: Czerwiński, Wojciech Hofman, Piotr Wojciech Czerwiński and Piotr Hofman et al.

Quelle: Logical Methods in Computer Science. 21

Schlagwörter: FOS: Computer and information sciences, unambiguity, Computer Science - Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), vector addition systems, determinism, Petri nets, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Logic in Computer Science (cs.LO), bounded ambiguity, Theory of computation → Parallel computing models, language inclusion, 0202 electrical engineering, electronic engineering, information engineering, language equivalence, ddc:004, well-structured transition systems

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2202.08033
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.16

ConDRust: Scalable Deterministic Concurrency from Verifiable Rust Programs (Artifact)

Autoren: Suchert, Felix Zeidler, Lisza Castrillon, Jeronimo et al.

Weitere Verfasser: Suchert, Felix Zeidler, Lisza Castrillon, Jeronimo et al.

Schlagwörter: concurrent programming, Theory of computation → Parallel computing models, ddc:004, verification, Software and its engineering → Parallel programming languages, scalability

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/DARTS.9.2.16

Precision Tuning in Parallel Applications

Autoren: Magnani, Gabriele Denisov, Lev Cattaneo, Daniele et al.

Weitere Verfasser: Magnani, Gabriele Denisov, Lev Cattaneo, Daniele et al.

Schlagwörter: Parallel Programming, Compilers, Theory of computation → Parallel computing models, Precision Tuning, ddc:004, Software and its engineering → Compilers

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.PARMA-DITAM.2022.5
https://drops.dagstuhl.de/opus/volltexte/2022/16121/
https://hdl.handle.net/11311/1217631
https://doi.org/10.4230/oasics.parma-ditam.2022.5

Sublinear-Round Parallel Matroid Intersection

Autoren: Blikstad, Joakim Joakim Blikstad Bojańczyk, Mikołaj et al.

Weitere Verfasser: Blikstad, Joakim Joakim Blikstad Bojańczyk, Mikołaj et al.

Schlagwörter: Theory of computation → Parallel computing models, Mathematics of computing → Matroids and greedoids, Combinatorial Optimization, Parallel Algorithms, Theory of computation → Discrete optimization, Matroid Intersection, ddc:004, Theory of computation → Approximation algorithms analysis

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.25

Improved Lower Bounds for Reachability in Vector Addition Systems

Autoren: Czerwiński, Wojciech Lasota, Sławomir Orlikowski, Łukasz et al.

Weitere Verfasser: Czerwiński, Wojciech Lasota, Sławomir Orlikowski, Łukasz et al.

Schlagwörter: Theory of computation → Parallel computing models, vector addition systems, reachability problem, Petri nets, ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.128

Verification of Flat FIFO Systems

Autoren: Finkel, Alain Praveen, M. FINKEL, Alain et al.

Weitere Verfasser: Finkel, Alain Praveen, M. FINKEL, Alain et al.

Quelle: Logical Methods in Computer Science, Vol Volume 16, Issue 4 (2020)

Schlagwörter: termination, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Logic, counters, flat systems, [MATH] Mathematics [math], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Computational Complexity (cs.CC), 01 natural sciences, computer science - logic in computer science, [SCCO.COMP] Cognitive science/Computer science, 0202 electrical engineering, electronic engineering, information engineering, Infinite state systems, BC1-199, FIFO, QA75.5-76.95, Logic in Computer Science (cs.LO), theory of computation - parallel computing models, Computer Science - Computational Complexity, Theory of computation - Parallel computing models, Electronic computers. Computer science, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], computer science - computational complexity, ddc:004, complexity, reachability

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1908.07282
https://lmcs.episciences.org/5999
https://doi.org/10.23638/lmcs-16(4:4)2020
https://hal.science/hal-04285325v1
https://doi.org/10.23638/lmcs-16(4:4)2020
https://hal.science/hal-02267453v1/document
https://hal.science/hal-02267453v1
https://doaj.org/article/2f04ec861fbf489a9fa1d88014193e29
https://hal.archives-ouvertes.fr/hal-02267453
http://dblp.uni-trier.de/db/conf/concur/concur2019.html#FinkelP19
https://drops.dagstuhl.de/opus/volltexte/2019/10914/
https://dblp.uni-trier.de/db/journals/corr/corr1908.html#abs-1908-07282
https://hal.archives-ouvertes.fr/hal-02267453/document
https://drops.dagstuhl.de/opus/volltexte/2019/10914/pdf/LIPIcs-CONCUR-2019-12.pdf/
https://ui.adsabs.harvard.edu/abs/2019arXiv190807282F/abstract
https://arxiv.org/abs/1908.07282
https://arxiv.org/pdf/1908.07282v5
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.12

enInvolved VASS Zoo (Invited Talk)

Autoren: Czerwiński, Wojciech Klin, Bartek Lasota, Sławomir et al.

Weitere Verfasser: Czerwiński, Wojciech Klin, Bartek Lasota, Sławomir et al.

Schlagwörter: vector addition systems, Theory of computation → Parallel computing models, reachability problem, examples, low dimensions

Parallelizing Rendering on Devices with Multi-Core CPUs - Implementation Suggestion for Education

Autoren: Porath, Ron

Schlagwörter: Theory of computation → Parallel computing models, Software and its engineering → Data flow architectures, CCS Concepts: Software and its engineering → Data flow architectures

Schedule Synthesis for Synchronous Dataflow Models with Lower and Upper Timing Bounds.

Autoren: van Wanrooij, Joep Basten, Twan Geilen, Marc

Quelle: ACM Transactions on Embedded Computing Systems; 2025 Suppl 5, Vol. 24, p1-28, 28p

Schlagwörter: SCHEDULING, PRODUCTION scheduling, DATA flow computing, DEADLINES, MANUFACTURING processes, MATHEMATICAL optimization, COMPUTER performance

Rasco: Resource Allocation and Scheduling Co-design for DAG Applications on Multicore.

Autoren: Eisenklam, Abigail Gifford, Robert Bondar, Georgiy A et al.

Quelle: ACM Transactions on Embedded Computing Systems; 2025 Suppl 5, Vol. 24, p1-27, 27p

Schlagwörter: RESOURCE allocation, SCHEDULING, COMPUTER performance, DIRECTED acyclic graphs, REAL-time computing, MULTICORE processors

Efficient Federated Learning Using Dynamic Update and Adaptive Pruning with Momentum on Shared Server Data.

Autoren: Liu, Ji Jia, Juncheng Zhang, Hong et al.

Quelle: ACM Transactions on Intelligent Systems & Technology; Dec2024, Vol. 15 Issue 6, p1-28, 28p

Schlagwörter: FEDERATED learning, MACHINE learning, ALGORITHMS, HETEROGENEITY, COST

PARALiA: A Performance Aware Runtime for Auto-tuning Linear Algebra on Heterogeneous Systems.

Autoren: ANASTASIADIS, PETROS PAPADOPOULOU, NIKELA GOUMAS, GEORGIOS et al.

Quelle: ACM Transactions on Architecture & Code Optimization; Dec2023, Vol. 20 Issue 4, p1-25, 25p

A Survey on Parallelism and Determinism.

Autoren: GONNORD, LAURE HENRIO, LUDOVIC MOREL, LIONEL et al.

Quelle: ACM Computing Surveys; Oct2023, Vol. 55 Issue 10, p1-28, 28p

Schlagwörter: PROGRAMMING languages, PERSPECTIVE taking, PARALLEL programming

RDF: A Reconfigurable Dataflow Model of Computation.

Autoren: FRADET, PASCAL GIRAULT, ALAIN KRISHNASWAMY, RUBY et al.

Quelle: ACM Transactions on Embedded Computing Systems; Jan2023, Vol. 22 Issue 1, p1-30, 30p

Schlagwörter: DIGITAL signal processing, AUTOMATIC control systems, FIRST in, first out (Queuing theory)

The Serverless Computing Survey: A Technical Primer for Design Architecture.

Autoren: ZIJUN LI LINSONG GUO JIAGAN CHENG et al.

Quelle: ACM Computing Surveys; 2022 Suppl 10, Vol. 54, p1-34, 34p

Schlagwörter: ARCHITECTURAL design, COMMUNICATION infrastructure, COMMUNITIES, SCALABILITY

Source-to-Source Automatic Differentiation of OpenMP Parallel Loops.

Autoren: HÜCKELHEIM, JAN HASCOËT, LAURENT Hückelheim, Jan et al.

Quelle: ACM Transactions on Mathematical Software; Jan2022, Vol. 48 Issue 1, p1-32, 32p

Schlagwörter: AUTOMATIC differentiation, WORK sharing, MACHINE learning, MULTICORE processors, PARALLEL programming, BOTTLENECKS (Manufacturing)

Holistic Resource Allocation Under Federated Scheduling for Parallel Real-time Tasks.

Autoren: LANSHUN NIE CHENGHAO FAN SHUANG LIN et al.

Quelle: ACM Transactions on Embedded Computing Systems; Jan2022, Vol. 21 Issue 1, p1-29, 29p

Schlagwörter: RESOURCE allocation, CACHE memory, TASKS, EDGE computing, SCHEDULING, SYSTEMS development

Firma/Körperschaft: INTEL Corp.

Verification of Flat FIFO Systems

Autoren: Finkel, Alain Praveen, M. Laboratoire Spécification et Vérification Cachan (LSV) et al.

Weitere Verfasser: Finkel, Alain Praveen, M. Laboratoire Spécification et Vérification Cachan (LSV) et al.

Quelle: CONCUR 2019 ; https://hal.science/hal-02267453 ; CONCUR 2019, Aug 2019, AMSTERDAM, Netherlands

Schlagwörter: reachability, FIFO, termination, Infinite state systems, complexity, flat systems, counters, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, [SCCO.COMP]Cognitive science/Computer science, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geographisches Schlagwort: AMSTERDAM, Netherlands

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1908.07282; ARXIV: 1908.07282

Verfügbarkeit: https://hal.science/hal-02267453
https://hal.science/hal-02267453v1/document
https://hal.science/hal-02267453v1/file/flat.pdf

Isolation Modeling and Analysis Based on Mobility.

Autoren: JIAN-MIN JIANG HUIBIAO ZHU QIN LI et al.

Quelle: ACM Transactions on Software Engineering & Methodology; Feb2019, Vol. 28 Issue 2, p1-31, 31p

Schlagwörter: COMPUTER scheduling, MOBILE communication systems, CALCULUS, COMPUTER science, TIME-sharing computer systems