FRINK Linked Data Fragments server

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

• W2912265896 abstract "The P-RAM model of computation has proved to be a very useful theoretical model for exploiting and extracting inherent parallelism in problems and thus for designing parallel algorithms. Therefore, it becomes very important to examine whether results obtained for such a model can be translated onto machines considered to be more realistic in the face of current technological constraints. In this thesis, we show how the implementation of many techniques and algorithms designed for the P-RAM can be achieved on the feasible SIMD class of computers. The first investigation concerns classes of problems solvable on the P-RAM model using the recursive techniques of compression, tree contraction and 'divide and conquer'. For such problems, specific methods are emphasised to achieve efficient implementations on some SIMD architectures. Problems such as list ranking, polynomial and expression evaluation are shown to have efficient solutions on the 2—dimensional mesh-connected computer. The balanced binary tree technique is widely employed to solve many problems in the P-RAM model. By proposing an implicit embedding of the binary tree of size n on a (√n x√n) mesh-connected computer (contrary to using the usual H-tree approach which requires a mesh of size ≈ (2√n x 2√n), we show that many of the problems solvable using this technique can be efficiently implementable on this architecture. Two efficient O (√n) algorithms for solving the bracket matching problem are presented. Consequently, the problems of expression evaluation (where the expression is given in an array form), evaluating algebraic expressions with a carrier of constant bounded size and parsing expressions of both bracket and input driven languages are all shown to have efficient solutions on the 2—dimensional mesh-connected computer. Dealing with non-tree structured computations we show that the Eulerian tour problem for a given graph with m edges and maximum vertex degree d can be solved in O(d√n) parallel time on the 2 —dimensional mesh-connected computer. A way to increase the processor utilisation on the 2-dimensional mesh-connected computer is also presented. The method suggested consists of pipelining sets of iteratively solvable problems each of which at each step of its execution uses only a fraction of available PE's." @default.
• W2912265896 created "2019-02-21" @default.
• W2912265896 creator A5074857902 @default.
• W2912265896 date "1992-01-01" @default.
• W2912265896 modified "2023-09-28" @default.
• W2912265896 title "On the implementation of P-RAM algorithms on feasible SIMD computers" @default.
• W2912265896 cites W1492973327 @default.
• W2912265896 cites W1574303240 @default.
• W2912265896 cites W1594100290 @default.
• W2912265896 cites W1608852523 @default.
• W2912265896 cites W1971869874 @default.
• W2912265896 cites W1972897119 @default.
• W2912265896 cites W1976284552 @default.
• W2912265896 cites W1977119258 @default.
• W2912265896 cites W1977477009 @default.
• W2912265896 cites W1978583881 @default.
• W2912265896 cites W1991349080 @default.
• W2912265896 cites W1999667176 @default.
• W2912265896 cites W2004354110 @default.
• W2912265896 cites W2011591414 @default.
• W2912265896 cites W2012216209 @default.
• W2912265896 cites W2012383375 @default.
• W2912265896 cites W2015439916 @default.
• W2912265896 cites W2027003016 @default.
• W2912265896 cites W2049337025 @default.
• W2912265896 cites W2055717497 @default.
• W2912265896 cites W2064687921 @default.
• W2912265896 cites W2069489095 @default.
• W2912265896 cites W2074276908 @default.
• W2912265896 cites W2074456731 @default.
• W2912265896 cites W2083419902 @default.
• W2912265896 cites W2084386794 @default.
• W2912265896 cites W2097755092 @default.
• W2912265896 cites W2109560070 @default.
• W2912265896 cites W2122056736 @default.
• W2912265896 cites W2144927306 @default.
• W2912265896 cites W2155209532 @default.
• W2912265896 cites W2157211828 @default.
• W2912265896 cites W2159159598 @default.
• W2912265896 cites W2433940709 @default.
• W2912265896 hasPublicationYear "1992" @default.
• W2912265896 type Work @default.
• W2912265896 sameAs 2912265896 @default.
• W2912265896 citedByCount "0" @default.
• W2912265896 crossrefType "dissertation" @default.
• W2912265896 hasAuthorship W2912265896A5074857902 @default.
• W2912265896 hasConcept C11413529 @default.
• W2912265896 hasConcept C150552126 @default.
• W2912265896 hasConcept C173608175 @default.
• W2912265896 hasConcept C197855036 @default.
• W2912265896 hasConcept C41008148 @default.
• W2912265896 hasConcept C45374587 @default.
• W2912265896 hasConcept C80444323 @default.
• W2912265896 hasConceptScore W2912265896C11413529 @default.
• W2912265896 hasConceptScore W2912265896C150552126 @default.
• W2912265896 hasConceptScore W2912265896C173608175 @default.
• W2912265896 hasConceptScore W2912265896C197855036 @default.
• W2912265896 hasConceptScore W2912265896C41008148 @default.
• W2912265896 hasConceptScore W2912265896C45374587 @default.
• W2912265896 hasConceptScore W2912265896C80444323 @default.
• W2912265896 hasLocation W29122658961 @default.
• W2912265896 hasOpenAccess W2912265896 @default.
• W2912265896 hasPrimaryLocation W29122658961 @default.
• W2912265896 hasRelatedWork W1520844286 @default.
• W2912265896 hasRelatedWork W1589719404 @default.
• W2912265896 hasRelatedWork W1986195981 @default.
• W2912265896 hasRelatedWork W2024574812 @default.
• W2912265896 hasRelatedWork W2040248630 @default.
• W2912265896 hasRelatedWork W2045697730 @default.
• W2912265896 hasRelatedWork W2079267511 @default.
• W2912265896 hasRelatedWork W2097004206 @default.
• W2912265896 hasRelatedWork W2137435405 @default.
• W2912265896 hasRelatedWork W2207774642 @default.
• W2912265896 hasRelatedWork W2248333685 @default.
• W2912265896 hasRelatedWork W2329842527 @default.
• W2912265896 hasRelatedWork W2465807516 @default.
• W2912265896 hasRelatedWork W2752627372 @default.
• W2912265896 hasRelatedWork W2913969607 @default.
• W2912265896 hasRelatedWork W298431351 @default.
• W2912265896 hasRelatedWork W2986004760 @default.
• W2912265896 hasRelatedWork W3015152879 @default.
• W2912265896 hasRelatedWork W424467131 @default.
• W2912265896 hasRelatedWork W1922335415 @default.
• W2912265896 isParatext "false" @default.
• W2912265896 isRetracted "false" @default.
• W2912265896 magId "2912265896" @default.
• W2912265896 workType "dissertation" @default.