{"id":"https://openalex.org/W93685940","doi":null,"title":"Parallel Processing of Linear Systems Using Asynchronous Iterative Algorithms","display_name":"Parallel Processing of Linear Systems Using Asynchronous Iterative Algorithms","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W93685940","mag":"93685940"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.8560","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.8560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.temple.edu/~szyld/kostas96.ps","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056793849","display_name":"Kostas Blathras","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kostas Blathras","raw_affiliation_strings":["Temple University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Temple University","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047875137","display_name":"Daniel B. Szyld","orcid":"https://orcid.org/0000-0001-8010-0391","observed_orcids":["https://orcid.org/0000-0001-8010-0391"]},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel B. Szyld","raw_affiliation_strings":["Temple University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Temple University","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010039822","display_name":"Yuan Chang Shi","orcid":"https://orcid.org/0000-0003-1209-4406","observed_orcids":["https://orcid.org/0000-0003-1209-4406"]},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuan Shi","raw_affiliation_strings":["Temple University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Temple University","institution_ids":["https://openalex.org/I84392919"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I84392919"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.8208000063896179,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.8208000063896179,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.16300000250339508,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.0017999999690800905,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.5659999847412109},{"id":"https://openalex.org/keywords/linear-systems-of-equations","display_name":"systems of linear equations","score":0.8479999899864197},{"id":"https://openalex.org/keywords/iterative-methods","display_name":"iterative methods","score":0.6880000233650208},{"id":"https://openalex.org/keywords/asynchronous-algorithms","display_name":"asynchronous algorithms","score":0.9179999828338623},{"id":"https://openalex.org/keywords/data-dependencies","display_name":"data dependencies","score":0.8980000019073486},{"id":"https://openalex.org/keywords/data-exchange","display_name":"data exchange","score":0.7960000038146973},{"id":"https://openalex.org/keywords/parallel-code-generation","display_name":"parallel code generation","score":0.6959999799728394},{"id":"https://openalex.org/keywords/parallel-compilers","display_name":"parallel compilers","score":0.9520000219345093}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8535555005073547},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8200095891952515},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6146774888038635},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5956717133522034},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.575688898563385},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4905025362968445},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.4802446663379669},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47358280420303345},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.46215516328811646},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.44943299889564514},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.8560","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.8560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.temple.edu/~szyld/kostas96.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W207685730","https://openalex.org/W1549217911","https://openalex.org/W1574923065","https://openalex.org/W1589943916","https://openalex.org/W1734912584","https://openalex.org/W1963924275","https://openalex.org/W1990848106","https://openalex.org/W1999912658","https://openalex.org/W2007244686","https://openalex.org/W2554811052","https://openalex.org/W2798776286","https://openalex.org/W2911684292","https://openalex.org/W3035235874","https://openalex.org/W3151562337"],"related_works":["https://openalex.org/W7096664511","https://openalex.org/W7045509020","https://openalex.org/W7096414724","https://openalex.org/W1834710643","https://openalex.org/W7045412570","https://openalex.org/W330847498","https://openalex.org/W2113908154","https://openalex.org/W7097799722","https://openalex.org/W2185465678","https://openalex.org/W3008012070"],"abstract_inverted_index":{"Iterative":[0],"algorithms":[1],"for":[2],"solving":[3],"systems":[4],"of":[5],"linear":[6],"equations":[7],"require":[8],"data":[9,17,27],"exchanges":[10,28],"at":[11],"each":[12],"iteration":[13],"step":[14],"due":[15],"to":[16],"dependencies.":[18],"When":[19],"processed":[20],"in":[21,33],"parallel,":[22],"this":[23],"requirement":[24],"forces":[25],"frequent":[26],"among":[29],"parallel":[30,41,46],"sub-tasks":[31],"resulting":[32],"long":[34],"execution.":[35],"These":[36],"dependencies":[37],"also":[38],"prohibit":[39],"effective":[40],"program":[42],"generation":[43],"by":[44],"existing":[45],"compilers.":[47]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}