Matches in SemOpenAlex for { <https://semopenalex.org/work/W177517177> ?p ?o ?g. }
Showing items 1 to 71 of
71
with 100 items per page.
- W177517177 endingPage "43" @default.
- W177517177 startingPage "38" @default.
- W177517177 abstract "Abstract In this paper, we propose to extend the Peril-Lparallel pseudo-code language. The extensions addedto the Peril-L are essential to express non-trivial paral-lel algorithms. We demonstrate the effectiveness of theextended Peril-L by showing the parallel algorithmsfor the Jacobi method for solving differential equationsand the dynamic programming method for finding theoptimal binary search tree. 1 Introduction To write parallel programs for parallel comput-ers, people need to design parallel algorithms or par-allelize sequential algorithms before they can imple-ment them in parallel programming languages. Fortraditional sequential computing, algorithm designershave been using the well-established pseudo-code orpidgin-code languages [1] to describe rigorous algo-rithms without details of the implementation in pro-gramming languages. The algorithms in pseudo-codecan also be used to analyze and predict the perfor-mance accurately, because all the pseudo-code lan-guages are based on the accurate RAM (Random Ac-cess Machine) model for all sequential computers.The situation is quite different in the parallelcomputing world. While many parallel programminglanguages(Fortran 95, HP Fortran, OpenMP and MPIlibraries, Pthread library, etc.) have been developed,there was virtually no parallel pseudo-code languageproposed or developed until recently. Most parallelalgorithms for scalable parallel computers, have beendescribed by using the combination of diagrams, illus-trations and texts as demonstrated by many parallelalgorithms and programming texts such as [2]. Therewere parallel algorithms expressed in the pseudo-codebased on the PRAM (Parallel Random Access Ma-chine) machine model. However, these algorithms areeither impractical (due to the assumption of unlimitednumber of processors) or inaccurate in performanceprediction (due to the assumption of shared memoryand uniform memory access in the PRAM model).The practical and scalable parallel machines suchas IBM BlueGene [3] and SiCortex SC5832 [4] do nothave shared memory. They all can be modeled bythe CTA (Candidate Type Architecture) model, whereeach processor consists of one or several CPUs, thememory and the network interface. All processors areconnected by an interconnection network. All memo-ries are local to its CPUs and there is no global sharedmemory.To the best of our knowledge, the first pseudo-code language to describe scalable parallel algorithmsfor CTA machines is Peril-L" @default.
- W177517177 created "2016-06-24" @default.
- W177517177 creator A5013607020 @default.
- W177517177 date "2008-01-01" @default.
- W177517177 modified "2023-09-27" @default.
- W177517177 title "Extending Parallel Pseudo-Code Language Peril-L." @default.
- W177517177 cites W1532296632 @default.
- W177517177 cites W1534870518 @default.
- W177517177 cites W2061388644 @default.
- W177517177 hasPublicationYear "2008" @default.
- W177517177 type Work @default.
- W177517177 sameAs 177517177 @default.
- W177517177 citedByCount "1" @default.
- W177517177 countsByYear W1775171772012 @default.
- W177517177 crossrefType "journal-article" @default.
- W177517177 hasAuthorship W177517177A5013607020 @default.
- W177517177 hasConcept C111919701 @default.
- W177517177 hasConcept C11413529 @default.
- W177517177 hasConcept C120373497 @default.
- W177517177 hasConcept C137364921 @default.
- W177517177 hasConcept C173608175 @default.
- W177517177 hasConcept C177264268 @default.
- W177517177 hasConcept C199360897 @default.
- W177517177 hasConcept C2776760102 @default.
- W177517177 hasConcept C2778241615 @default.
- W177517177 hasConcept C34165917 @default.
- W177517177 hasConcept C41008148 @default.
- W177517177 hasConcept C48044578 @default.
- W177517177 hasConcept C80444323 @default.
- W177517177 hasConceptScore W177517177C111919701 @default.
- W177517177 hasConceptScore W177517177C11413529 @default.
- W177517177 hasConceptScore W177517177C120373497 @default.
- W177517177 hasConceptScore W177517177C137364921 @default.
- W177517177 hasConceptScore W177517177C173608175 @default.
- W177517177 hasConceptScore W177517177C177264268 @default.
- W177517177 hasConceptScore W177517177C199360897 @default.
- W177517177 hasConceptScore W177517177C2776760102 @default.
- W177517177 hasConceptScore W177517177C2778241615 @default.
- W177517177 hasConceptScore W177517177C34165917 @default.
- W177517177 hasConceptScore W177517177C41008148 @default.
- W177517177 hasConceptScore W177517177C48044578 @default.
- W177517177 hasConceptScore W177517177C80444323 @default.
- W177517177 hasLocation W1775171771 @default.
- W177517177 hasOpenAccess W177517177 @default.
- W177517177 hasPrimaryLocation W1775171771 @default.
- W177517177 hasRelatedWork W1490458935 @default.
- W177517177 hasRelatedWork W1499526118 @default.
- W177517177 hasRelatedWork W1602880378 @default.
- W177517177 hasRelatedWork W1976174647 @default.
- W177517177 hasRelatedWork W1992598731 @default.
- W177517177 hasRelatedWork W1998545058 @default.
- W177517177 hasRelatedWork W2004779434 @default.
- W177517177 hasRelatedWork W2061614369 @default.
- W177517177 hasRelatedWork W2110334894 @default.
- W177517177 hasRelatedWork W2112708371 @default.
- W177517177 hasRelatedWork W2126579105 @default.
- W177517177 hasRelatedWork W2146597883 @default.
- W177517177 hasRelatedWork W23599445 @default.
- W177517177 hasRelatedWork W2732269861 @default.
- W177517177 hasRelatedWork W3001388538 @default.
- W177517177 hasRelatedWork W3045297440 @default.
- W177517177 hasRelatedWork W3124362173 @default.
- W177517177 hasRelatedWork W3157540786 @default.
- W177517177 hasRelatedWork W79248910 @default.
- W177517177 hasRelatedWork W963733059 @default.
- W177517177 isParatext "false" @default.
- W177517177 isRetracted "false" @default.
- W177517177 magId "177517177" @default.
- W177517177 workType "article" @default.