Matches in SemOpenAlex for { <https://semopenalex.org/work/W2465924071> ?p ?o ?g. }
Showing items 1 to 61 of
61
with 100 items per page.
- W2465924071 endingPage "193" @default.
- W2465924071 startingPage "193" @default.
- W2465924071 abstract "The compilation of large program modules can take a significant amount of CPU time and thereby degrade computer systems performance. Previously suggested parallel compilation techniques like functional decomposition have produced limited speedup advantages. We propose a new partitioning scheme for parallel compilation which is based on decomposition of the grammar of the language into multiple subsets. The compilation process is speeded up by partitioning the source program into n segments, based on the grammar, and spawning n subcompilation processes, each residing on a separate processor. Given this partitioning, along with modifications to the corresponding scanners, the subcompilers run in parallel providing speedup for the compilation process. We carry out a performance analysis of the parsing, code generation and merging phases of the proposed parallel compilation technique. We derive an expression for the theoretical speedup in parallel compilation in terms of the number of subcompilers for the language and the basic shift, reduce, code generation and merging times. The accuracy of our analytical model for speedup is verified by experimentation of the proposed grammar partitioning technique on several Pascal programs.In order to obtain the complete target code in parallel compilation, the subcompilation processes communicate with one another in a distributed system with the help of a set of rules, called protocols, which govern their interaction. It is important to verify that the protocols themselves are free of errors like deadlock, unspecified reception and channel overflow. As an illustration of communicating parallel program verification, we consider the problem of protocol verification utilizing the concept of viewpoints in multiple theories. We use an inheritance mechanism in the reachability analysis technique to pass information about process states and channel messages from the parent theory to the descendent theories in an efficient manner. For a n-process communication protocol, the viewpoint representation in multiple theories consumes storage of O(1/$nsp2$) compared to the traditional system state matrix representation." @default.
- W2465924071 created "2016-07-22" @default.
- W2465924071 creator A5039249276 @default.
- W2465924071 date "1990-01-01" @default.
- W2465924071 modified "2023-09-22" @default.
- W2465924071 title "A methodology for parallel compilation and protocol analysis on distributed systems" @default.
- W2465924071 hasPublicationYear "1990" @default.
- W2465924071 type Work @default.
- W2465924071 sameAs 2465924071 @default.
- W2465924071 citedByCount "0" @default.
- W2465924071 crossrefType "journal-article" @default.
- W2465924071 hasAuthorship W2465924071A5039249276 @default.
- W2465924071 hasConcept C111919701 @default.
- W2465924071 hasConcept C133162039 @default.
- W2465924071 hasConcept C173608175 @default.
- W2465924071 hasConcept C177264268 @default.
- W2465924071 hasConcept C199360897 @default.
- W2465924071 hasConcept C26517878 @default.
- W2465924071 hasConcept C41008148 @default.
- W2465924071 hasConcept C68339613 @default.
- W2465924071 hasConcept C75608658 @default.
- W2465924071 hasConcept C80444323 @default.
- W2465924071 hasConceptScore W2465924071C111919701 @default.
- W2465924071 hasConceptScore W2465924071C133162039 @default.
- W2465924071 hasConceptScore W2465924071C173608175 @default.
- W2465924071 hasConceptScore W2465924071C177264268 @default.
- W2465924071 hasConceptScore W2465924071C199360897 @default.
- W2465924071 hasConceptScore W2465924071C26517878 @default.
- W2465924071 hasConceptScore W2465924071C41008148 @default.
- W2465924071 hasConceptScore W2465924071C68339613 @default.
- W2465924071 hasConceptScore W2465924071C75608658 @default.
- W2465924071 hasConceptScore W2465924071C80444323 @default.
- W2465924071 hasLocation W24659240711 @default.
- W2465924071 hasOpenAccess W2465924071 @default.
- W2465924071 hasPrimaryLocation W24659240711 @default.
- W2465924071 hasRelatedWork W1508485636 @default.
- W2465924071 hasRelatedWork W1559772379 @default.
- W2465924071 hasRelatedWork W1601796095 @default.
- W2465924071 hasRelatedWork W1871382714 @default.
- W2465924071 hasRelatedWork W1936400588 @default.
- W2465924071 hasRelatedWork W1964964259 @default.
- W2465924071 hasRelatedWork W1966291212 @default.
- W2465924071 hasRelatedWork W1996941313 @default.
- W2465924071 hasRelatedWork W2093718638 @default.
- W2465924071 hasRelatedWork W2097118641 @default.
- W2465924071 hasRelatedWork W2112818910 @default.
- W2465924071 hasRelatedWork W2136718706 @default.
- W2465924071 hasRelatedWork W2224432945 @default.
- W2465924071 hasRelatedWork W2468282356 @default.
- W2465924071 hasRelatedWork W2468310880 @default.
- W2465924071 hasRelatedWork W2490972876 @default.
- W2465924071 hasRelatedWork W2516273888 @default.
- W2465924071 hasRelatedWork W2540915878 @default.
- W2465924071 hasRelatedWork W2805518706 @default.
- W2465924071 hasRelatedWork W30268926 @default.
- W2465924071 isParatext "false" @default.
- W2465924071 isRetracted "false" @default.
- W2465924071 magId "2465924071" @default.
- W2465924071 workType "article" @default.