{"id":"https://openalex.org/W2100750367","doi":"https://doi.org/10.1109/ispan.2002.1004261","title":"Automatic processor lower bound formulas for array computations","display_name":"Automatic processor lower bound formulas for array computations","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2100750367","doi":"https://doi.org/10.1109/ispan.2002.1004261","mag":"2100750367"},"language":"en","primary_location":{"id":"doi:10.1109/ispan.2002.1004261","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2002.1004261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5048690917","display_name":"P. Cappello","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Cappello","raw_affiliation_strings":["Department of Computer Science, University of California,\uc2a0Santa Barbara, Santa Barbara, CA, USA","Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California,\uc2a0Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026125535","display_name":"\u00d6mer E\u011feci\u0307o\u011flu","orcid":"https://orcid.org/0000-0002-6070-761X"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"O. Egecioglu","raw_affiliation_strings":["Department of Computer Science, University of California,\uc2a0Santa Barbara, Santa Barbara, CA, USA","Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California,\uc2a0Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18238591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"59","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9984999895095825,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9973999857902527,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/gaussian-elimination","display_name":"Gaussian elimination","score":0.6369394659996033},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6368435621261597},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5578659772872925},{"id":"https://openalex.org/keywords/diophantine-equation","display_name":"Diophantine equation","score":0.5430880784988403},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4833599925041199},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4762016534805298},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44241252541542053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42182183265686035},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4145382046699524},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36620384454727173},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35005244612693787},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.2733951210975647}],"concepts":[{"id":"https://openalex.org/C126312332","wikidata":"https://www.wikidata.org/wiki/Q2658","display_name":"Gaussian elimination","level":3,"score":0.6369394659996033},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6368435621261597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5578659772872925},{"id":"https://openalex.org/C206530611","wikidata":"https://www.wikidata.org/wiki/Q905896","display_name":"Diophantine equation","level":2,"score":0.5430880784988403},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4833599925041199},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4762016534805298},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44241252541542053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42182183265686035},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4145382046699524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36620384454727173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35005244612693787},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.2733951210975647},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ispan.2002.1004261","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2002.1004261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.5467","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.5467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsb.edu/~omer/DOWNLOADABLE/ISPAN_automatic02.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W114716186","https://openalex.org/W1486321646","https://openalex.org/W1523764530","https://openalex.org/W1664541497","https://openalex.org/W1917546930","https://openalex.org/W1995246641","https://openalex.org/W2002252837","https://openalex.org/W2006970099","https://openalex.org/W2027739182","https://openalex.org/W2064130185","https://openalex.org/W2064213899","https://openalex.org/W2070700392","https://openalex.org/W2079092669","https://openalex.org/W2097670944","https://openalex.org/W2111889988","https://openalex.org/W2122804176","https://openalex.org/W2136862249","https://openalex.org/W2144894753","https://openalex.org/W2149801340","https://openalex.org/W2160066065","https://openalex.org/W2483442653","https://openalex.org/W4234407207","https://openalex.org/W4254501292","https://openalex.org/W4301706555","https://openalex.org/W6628856197"],"related_works":["https://openalex.org/W2025770640","https://openalex.org/W4401317798","https://openalex.org/W4298335810","https://openalex.org/W2462246956","https://openalex.org/W2379447811","https://openalex.org/W2029234250","https://openalex.org/W1553843799","https://openalex.org/W2894446991","https://openalex.org/W1755263897","https://openalex.org/W2351522589"],"abstract_inverted_index":{"In":[0],"the":[1,10,36,42,55,70,97,114,146],"directed":[2],"acyclic":[3],"graph":[4],"(dag)":[5],"model":[6],"of":[7,23,38,47,57,72,81,113],"algorithms,":[8],"consider":[9],"following":[11],"problem":[12,50],"for":[13,17,62,92,96,123,141],"precedence-constrained":[14],"multiprocessor":[15],"schedules":[16,27,122],"array":[18],"computations:":[19],"Given":[20],"a":[21,32,45,79,94,105],"sequence":[22],"dags":[24],"and":[25,117,129,136],"linear":[26,83],"parameterized":[28],"by":[29,41,145],"n,":[30],"compute":[31],"lower":[33,143],"bound":[34],"on":[35],"number":[37,56,71],"processors":[39],"required":[40],"schedule":[43],"as":[44,104],"function":[46,87],"n.":[48],"This":[49,108],"is":[51,69,110],"formulated":[52],"so":[53],"that":[54,59],"tasks":[58],"are":[60,89,148],"scheduled":[61],"execution":[63],"during":[64],"any":[65],"fixed":[66],"time":[67],"step":[68],"non-negative":[73],"integer":[74],"solutions":[75],"d/sub":[76],"n/":[77],"to":[78,120],"set":[80],"parametric":[82],"Diophantine":[84],"equations.":[85],"Generating":[86],"methods":[88],"then":[90],"used":[91],"constructing":[93],"formula":[95],"numbers":[98],"dn.":[99],"We":[100],"implemented":[101],"this":[102],"algorithm":[103,147],"Mathematica":[106],"program.":[107],"paper":[109],"an":[111],"overview":[112],"techniques":[115],"involved":[116],"their":[118],"applications":[119],"well-known":[121],"Matrix-Vector":[124],"Product,":[125,128],"Triangular":[126],"Matrix":[127],"Gaussian":[130],"Elimination":[131],"dags.":[132],"Some":[133],"example":[134],"runs":[135],"automatically":[137],"produced":[138],"symbolic":[139],"formulas":[140],"processor":[142],"bounds":[144],"given.":[149]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}