FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2945014724> ?p ?o ?g. }

• W2945014724 abstract "A P system is a parallel and distributed computational model inspired by the structure and interactions of living cells [55]. Chapter 1 first relates mainstream concepts of distributed computing to distributed features proposed for P systems. Chapter 2 introduces xP systems, which are extended versions of simple P systems proposed in our joint work [51, 3, 52, 22, 50]. This thesis investigates the adequacy of xP systems for modelling fundamental synchronous and asynchronous distributed algorithms and aims to construct xP specifications, i.e. directly executable formal specifications of algorithms in xP systems, which: (1) achieve the same runtime complexities as corresponding distributed algorithms and (2) are comparable in program size with high-level pseudocodes of corresponding distributed algorithms. Chapter 3 presents xP specifications of several fundamental traversal algorithms: Echo, distributed depth-first search (DFS), distributed breadth-first search (BFS) and neighbour discovery algorithms, based on our joint work [3]. As new contributions in this thesis, we address the common problem in distributed algorithms, termination detection problem, and provide xP specifications of several well-known termination detection algorithms and their applications. Chapter 4 discusses a series of distributed synchronous DFS and BFS-based edge- and node-disjoint paths algorithms. Consider a digraph with n nodes and m arcs, where f is the maximum number of disjoint paths and d is the outdegree of the source node. Dinneen et al.'s [18] algorithms based on the classical DFS run in O(mf); using Cidon's DFS and Theorem 4.5, our improved algorithms [52] run in O(nf); using a different idea, our two other DFS-based algorithms [22] run in O(nd) and O(nf). The first BFS-based P system solutions in our joint work [51, 52] run in O(nf); an improved version as my own work [65] also runs in O(nf). Following my own work [64], Chapter 5 presents a solution for one of the most challenging distributed computing problems: minimum spanning tree (MST) problem. We discuss the SynchGHS algorithm [42] and our synchronisation barriers. Given a weighted graph with n nodes, our xP solution runs in O(n log n) and it is the first MST solution in P systems." @default.
• W2945014724 created "2019-05-29" @default.
• W2945014724 creator A5025573189 @default.
• W2945014724 date "2014-01-01" @default.
• W2945014724 modified "2023-09-23" @default.
• W2945014724 title "P Systems as Formal Models for Distributed Algorithms" @default.
• W2945014724 hasPublicationYear "2014" @default.
• W2945014724 type Work @default.
• W2945014724 sameAs 2945014724 @default.
• W2945014724 citedByCount "0" @default.
• W2945014724 crossrefType "dissertation" @default.
• W2945014724 hasAuthorship W2945014724A5025573189 @default.
• W2945014724 hasConcept C11413529 @default.
• W2945014724 hasConcept C118615104 @default.
• W2945014724 hasConcept C120314980 @default.
• W2945014724 hasConcept C127413603 @default.
• W2945014724 hasConcept C130120984 @default.
• W2945014724 hasConcept C138843760 @default.
• W2945014724 hasConcept C140745168 @default.
• W2945014724 hasConcept C151319957 @default.
• W2945014724 hasConcept C152043487 @default.
• W2945014724 hasConcept C31258907 @default.
• W2945014724 hasConcept C33923547 @default.
• W2945014724 hasConcept C38652104 @default.
• W2945014724 hasConcept C41008148 @default.
• W2945014724 hasConcept C45340560 @default.
• W2945014724 hasConcept C62611344 @default.
• W2945014724 hasConcept C66938386 @default.
• W2945014724 hasConcept C80444323 @default.
• W2945014724 hasConceptScore W2945014724C11413529 @default.
• W2945014724 hasConceptScore W2945014724C118615104 @default.
• W2945014724 hasConceptScore W2945014724C120314980 @default.
• W2945014724 hasConceptScore W2945014724C127413603 @default.
• W2945014724 hasConceptScore W2945014724C130120984 @default.
• W2945014724 hasConceptScore W2945014724C138843760 @default.
• W2945014724 hasConceptScore W2945014724C140745168 @default.
• W2945014724 hasConceptScore W2945014724C151319957 @default.
• W2945014724 hasConceptScore W2945014724C152043487 @default.
• W2945014724 hasConceptScore W2945014724C31258907 @default.
• W2945014724 hasConceptScore W2945014724C33923547 @default.
• W2945014724 hasConceptScore W2945014724C38652104 @default.
• W2945014724 hasConceptScore W2945014724C41008148 @default.
• W2945014724 hasConceptScore W2945014724C45340560 @default.
• W2945014724 hasConceptScore W2945014724C62611344 @default.
• W2945014724 hasConceptScore W2945014724C66938386 @default.
• W2945014724 hasConceptScore W2945014724C80444323 @default.
• W2945014724 hasLocation W29450147241 @default.
• W2945014724 hasOpenAccess W2945014724 @default.
• W2945014724 hasPrimaryLocation W29450147241 @default.
• W2945014724 hasRelatedWork W1520844286 @default.
• W2945014724 hasRelatedWork W168018322 @default.
• W2945014724 hasRelatedWork W1942094667 @default.
• W2945014724 hasRelatedWork W1974154846 @default.
• W2945014724 hasRelatedWork W2108393160 @default.
• W2945014724 hasRelatedWork W2154111453 @default.
• W2945014724 hasRelatedWork W2243690116 @default.
• W2945014724 hasRelatedWork W2505011268 @default.
• W2945014724 hasRelatedWork W2561472232 @default.
• W2945014724 hasRelatedWork W2590926957 @default.
• W2945014724 hasRelatedWork W2591665237 @default.
• W2945014724 hasRelatedWork W2766827546 @default.
• W2945014724 hasRelatedWork W2947670263 @default.
• W2945014724 hasRelatedWork W2950030182 @default.
• W2945014724 hasRelatedWork W2964193429 @default.
• W2945014724 hasRelatedWork W29653294 @default.
• W2945014724 hasRelatedWork W2998830375 @default.
• W2945014724 hasRelatedWork W3088926573 @default.
• W2945014724 hasRelatedWork W3173953560 @default.
• W2945014724 hasRelatedWork W2012583049 @default.
• W2945014724 isParatext "false" @default.
• W2945014724 isRetracted "false" @default.
• W2945014724 magId "2945014724" @default.
• W2945014724 workType "dissertation" @default.