Sauge: How to use the parallelism of sequential programs
Identifieur interne : 000674 ( Istex/Corpus ); précédent : 000673; suivant : 000675Sauge: How to use the parallelism of sequential programs
Auteurs : P. LecouffeSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Well structured programs written in sequential high level languages are considered in this paper. Techniques of graph analysis are used to exhibit and measure the parallelism in these programs. Graph analysis is made on modified data dependency graphs. Several kinds of parallelism are considered, and particularly pipelining. A control scheme for a parallel computer, taking into account all the parallelism exhibited by the graph analysis and even dynamic pipelining, is then proposed. The control scheme is based on single assigment and guarded commands, associated with a data-driven mechanism.
Url:
DOI: 10.1007/BFb0105121
Links to Exploration step
ISTEX:1D963722A5142168D1D8C0E4A2F80BE07396A6D3Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Sauge: How to use the parallelism of sequential programs</title><author><name sortKey="Lecouffe, P" sort="Lecouffe, P" uniqKey="Lecouffe P" first="P." last="Lecouffe">P. Lecouffe</name><affiliation><mods:affiliation>Département Informatique I.U.T. "A" de Lille-I, B.P. 179, 59653, Villeneuve D’ascq Cédex, France</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1D963722A5142168D1D8C0E4A2F80BE07396A6D3</idno><date when="1981" year="1981">1981</date><idno type="doi">10.1007/BFb0105121</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-4PW2VWLH-Q/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000674</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000674</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Sauge: How to use the parallelism of sequential programs</title><author><name sortKey="Lecouffe, P" sort="Lecouffe, P" uniqKey="Lecouffe P" first="P." last="Lecouffe">P. Lecouffe</name><affiliation><mods:affiliation>Département Informatique I.U.T. "A" de Lille-I, B.P. 179, 59653, Villeneuve D’ascq Cédex, France</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Well structured programs written in sequential high level languages are considered in this paper. Techniques of graph analysis are used to exhibit and measure the parallelism in these programs. Graph analysis is made on modified data dependency graphs. Several kinds of parallelism are considered, and particularly pipelining. A control scheme for a parallel computer, taking into account all the parallelism exhibited by the graph analysis and even dynamic pipelining, is then proposed. The control scheme is based on single assigment and guarded commands, associated with a data-driven mechanism.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>P. Lecouffe</name><affiliations><json:string>Département Informatique I.U.T. "A" de Lille-I, B.P. 179, 59653, Villeneuve D’ascq Cédex, France</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-4PW2VWLH-Q</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: Well structured programs written in sequential high level languages are considered in this paper. Techniques of graph analysis are used to exhibit and measure the parallelism in these programs. Graph analysis is made on modified data dependency graphs. Several kinds of parallelism are considered, and particularly pipelining. A control scheme for a parallel computer, taking into account all the parallelism exhibited by the graph analysis and even dynamic pipelining, is then proposed. The control scheme is based on single assigment and guarded commands, associated with a data-driven mechanism.</abstract><qualityIndicators><score>7.352</score><pdfWordCount>4284</pdfWordCount><pdfCharCount>18455</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>14</pdfPageCount><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>89</abstractWordCount><abstractCharCount>608</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Sauge: How to use the parallelism of sequential programs</title><chapterId><json:string>16</json:string><json:string>Chap16</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1981</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>G. Goos</name></json:item><json:item><name>J. Hartmanis</name></json:item></editor></serie><host><title>Conpar 81</title><language><json:string>unknown</json:string></language><copyrightDate>1981</copyrightDate><doi><json:string>10.1007/BFb0105105</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-38715-2</json:string></eisbn><bookId><json:string>3-540-10827-0</json:string></bookId><isbn><json:string>978-3-540-10827-6</json:string></isbn><volume>111</volume><pages><first>231</first><last>244</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>W. Brauer</name></json:item><json:item><name>P. Brinch Hansen</name></json:item><json:item><name>D. Gries</name></json:item><json:item><name>C. Moler</name></json:item><json:item><name>G. Seegmüller</name></json:item><json:item><name>J. Stoer</name></json:item><json:item><name>N. Wirth</name></json:item><json:item><name>Prof. Dr. rer. nat. Wolfgang Händler</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science, general</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-4PW2VWLH-Q</json:string></ark><publicationDate>1981</publicationDate><copyrightDate>1981</copyrightDate><doi><json:string>10.1007/BFb0105121</json:string></doi><id>1D963722A5142168D1D8C0E4A2F80BE07396A6D3</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-4PW2VWLH-Q/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-4PW2VWLH-Q/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-4PW2VWLH-Q/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Sauge: How to use the parallelism of sequential programs</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1981">1981</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Sauge: How to use the parallelism of sequential programs</title><author><persName><forename type="first">P.</forename><surname>Lecouffe</surname></persName><affiliation><orgName type="institution">Département Informatique I.U.T. "A" de Lille-I</orgName><address><postBox>B.P. 179</postBox><postCode>59653</postCode><settlement>Villeneuve D’ascq Cédex</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">1D963722A5142168D1D8C0E4A2F80BE07396A6D3</idno><idno type="ark">ark:/67375/HCB-4PW2VWLH-Q</idno><idno type="DOI">10.1007/BFb0105121</idno></analytic><monogr><title level="m" type="main">Conpar 81</title><title level="m" type="sub">Conference on Analysing Problem Classes and Programming for Parallel Computing Nürnberg, June 10–12, 1981 Proceedings</title><idno type="DOI">10.1007/BFb0105105</idno><idno type="book-id">3-540-10827-0</idno><idno type="ISBN">978-3-540-10827-6</idno><idno type="eISBN">978-3-540-38715-2</idno><idno type="chapter-id">Chap16</idno><editor><persName><forename type="first">W.</forename><surname>Brauer</surname></persName></editor><editor><persName><forename type="first">P.</forename><forename type="first">Brinch</forename><surname>Hansen</surname></persName></editor><editor><persName><forename type="first">D.</forename><surname>Gries</surname></persName></editor><editor><persName><forename type="first">C.</forename><surname>Moler</surname></persName></editor><editor><persName><forename type="first">G.</forename><surname>Seegmüller</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Stoer</surname></persName></editor><editor><persName><forename type="first">N.</forename><surname>Wirth</surname></persName></editor><editor><persName><forename type="first">Wolfgang</forename><surname>Händler</surname></persName></editor><imprint><biblScope unit="vol">111</biblScope><biblScope unit="page" from="231">231</biblScope><biblScope unit="page" to="244">244</biblScope><biblScope unit="chapter-count">35</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><editor><persName><forename type="first">G.</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Hartmanis</surname></persName></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>Well structured programs written in sequential high level languages are considered in this paper. Techniques of graph analysis are used to exhibit and measure the parallelism in these programs. Graph analysis is made on modified data dependency graphs. Several kinds of parallelism are considered, and particularly pipelining.</p><p>A control scheme for a parallel computer, taking into account all the parallelism exhibited by the graph analysis and even dynamic pipelining, is then proposed. The control scheme is based on single assigment and guarded commands, associated with a data-driven mechanism.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I00001</label><item><term type="Secondary" subtype="priority-1">Computer Science, general</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-4PW2VWLH-Q/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" BookProductType="Proceedings" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-10827-0</BookID><BookTitle>Conpar 81</BookTitle><BookSubTitle>Conference on Analysing Problem Classes and Programming for Parallel Computing Nürnberg, June 10–12, 1981 Proceedings</BookSubTitle><BookVolumeNumber>111</BookVolumeNumber><BookDOI>10.1007/BFb0105105</BookDOI><BookTitleID>1841</BookTitleID><BookPrintISBN>978-3-540-10827-6</BookPrintISBN><BookElectronicISBN>978-3-540-38715-2</BookElectronicISBN><BookChapterCount>35</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1981</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I00001" Priority="1" Type="Secondary">Computer Science, general</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>W.</GivenName><FamilyName>Brauer</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>P.</GivenName><GivenName>Brinch</GivenName><FamilyName>Hansen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Gries</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Moler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Seegmüller</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Stoer</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>N.</GivenName><FamilyName>Wirth</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><Prefix>Prof. Dr. rer. nat.</Prefix><GivenName>Wolfgang</GivenName><FamilyName>Händler</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap16" Language="En"><ChapterInfo ChapterType="ReviewPaper" ContainsESM="No" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>16</ChapterID><ChapterDOI>10.1007/BFb0105121</ChapterDOI><ChapterSequenceNumber>16</ChapterSequenceNumber><ChapterTitle Language="En">Sauge: How to use the parallelism of sequential programs</ChapterTitle><ChapterCategory>Systematic Design, Development, And Verification Of Parallel Algorithms</ChapterCategory><ChapterFirstPage>231</ChapterFirstPage><ChapterLastPage>244</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1981</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2007</Year><Month>4</Month><Day>29</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3-540-10827-0</BookID><BookTitle>Conpar 81</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>P.</GivenName><FamilyName>Lecouffe</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgName>Département Informatique I.U.T. "A" de Lille-I</OrgName><OrgAddress><Postbox>B.P. 179</Postbox><Postcode>59653</Postcode><City>Villeneuve D’ascq Cédex</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Well structured programs written in sequential high level languages are considered in this paper. Techniques of graph analysis are used to exhibit and measure the parallelism in these programs. Graph analysis is made on modified data dependency graphs. Several kinds of parallelism are considered, and particularly pipelining.</Para><Para>A control scheme for a parallel computer, taking into account all the parallelism exhibited by the graph analysis and even dynamic pipelining, is then proposed. The control scheme is based on single assigment and guarded commands, associated with a data-driven mechanism.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Sauge: How to use the parallelism of sequential programs</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Sauge: How to use the parallelism of sequential programs</title></titleInfo><name type="personal"><namePart type="given">P.</namePart><namePart type="family">Lecouffe</namePart><affiliation>Département Informatique I.U.T. "A" de Lille-I, B.P. 179, 59653, Villeneuve D’ascq Cédex, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="ReviewPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">1981</dateIssued><copyrightDate encoding="w3cdtf">1981</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: Well structured programs written in sequential high level languages are considered in this paper. Techniques of graph analysis are used to exhibit and measure the parallelism in these programs. Graph analysis is made on modified data dependency graphs. Several kinds of parallelism are considered, and particularly pipelining. A control scheme for a parallel computer, taking into account all the parallelism exhibited by the graph analysis and even dynamic pipelining, is then proposed. The control scheme is based on single assigment and guarded commands, associated with a data-driven mechanism.</abstract><relatedItem type="host"><titleInfo><title>Conpar 81</title><subTitle>Conference on Analysing Problem Classes and Programming for Parallel Computing Nürnberg, June 10–12, 1981 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">W.</namePart><namePart type="family">Brauer</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">P.</namePart><namePart type="given">Brinch</namePart><namePart type="family">Hansen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Gries</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Moler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Seegmüller</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Stoer</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">N.</namePart><namePart type="family">Wirth</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="termsOfAddress">Prof. Dr. rer. nat.</namePart><namePart type="given">Wolfgang</namePart><namePart type="family">Händler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1981</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I00001">Computer Science, general</topic></subject><identifier type="DOI">10.1007/BFb0105105</identifier><identifier type="ISBN">978-3-540-10827-6</identifier><identifier type="eISBN">978-3-540-38715-2</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">1841</identifier><identifier type="BookID">3-540-10827-0</identifier><identifier type="BookChapterCount">35</identifier><identifier type="BookVolumeNumber">111</identifier><part><date>1981</date><detail type="volume"><number>111</number><caption>vol.</caption></detail><extent unit="pages"><start>231</start><end>244</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1981</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1981</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1981</recordOrigin></recordInfo></relatedItem><identifier type="istex">1D963722A5142168D1D8C0E4A2F80BE07396A6D3</identifier><identifier type="ark">ark:/67375/HCB-4PW2VWLH-Q</identifier><identifier type="DOI">10.1007/BFb0105121</identifier><identifier type="ChapterID">16</identifier><identifier type="ChapterID">Chap16</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1981</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag, 1981</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-4PW2VWLH-Q/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000674 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000674 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:1D963722A5142168D1D8C0E4A2F80BE07396A6D3
|texte= Sauge: How to use the parallelism of sequential programs
}}
| This area was generated with Dilib version V0.6.33. |  |