{"id":"https://openalex.org/W1996725964","doi":"https://doi.org/10.1145/1462586.1462592","title":"Compute Bound and I/O Bound Cellular Automata Simulations on FPGA Logic","display_name":"Compute Bound and I/O Bound Cellular Automata Simulations on FPGA Logic","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1996725964","doi":"https://doi.org/10.1145/1462586.1462592","mag":"1996725964"},"language":"en","primary_location":{"id":"doi:10.1145/1462586.1462592","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1462586.1462592","pdf_url":null,"source":{"id":"https://openalex.org/S112809824","display_name":"ACM Transactions on Reconfigurable Technology and Systems","issn_l":"1936-7406","issn":["1936-7406","1936-7414"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Reconfigurable Technology and Systems","raw_type":"journal-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/A5078834899","display_name":"S. Murtaza","orcid":"https://orcid.org/0000-0002-1590-3814"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"S. Murtaza","raw_affiliation_strings":["University of Amsterdam","University of Amsterdam#N#"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam","institution_ids":["https://openalex.org/I887064364"]},{"raw_affiliation_string":"University of Amsterdam#N#","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083188322","display_name":"Alfons G. Hoekstra","orcid":"https://orcid.org/0000-0002-3955-2449"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"A. G. Hoekstra","raw_affiliation_strings":["University of Amsterdam","University of Amsterdam#N#"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam","institution_ids":["https://openalex.org/I887064364"]},{"raw_affiliation_string":"University of Amsterdam#N#","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016657852","display_name":"P.M.A. Sloot","orcid":"https://orcid.org/0000-0002-3848-5395"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"P. M. A. Sloot","raw_affiliation_strings":["University of Amsterdam","University of Amsterdam#N#"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam","institution_ids":["https://openalex.org/I887064364"]},{"raw_affiliation_string":"University of Amsterdam#N#","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078834899"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":1.7712,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.83906038,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":"4","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":1.0,"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/T12162","display_name":"Cellular Automata and Applications","score":1.0,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9951000213623047,"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"}},{"id":"https://openalex.org/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.9560999870300293,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8132931590080261},{"id":"https://openalex.org/keywords/cellular-automaton","display_name":"Cellular automaton","score":0.7776925563812256},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.7506895065307617},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6194444894790649},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.523014485836029},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.516258716583252},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45845240354537964},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45029282569885254},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.44992977380752563},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4244422912597656},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.22103315591812134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11662104725837708},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10452967882156372}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8132931590080261},{"id":"https://openalex.org/C35527583","wikidata":"https://www.wikidata.org/wiki/Q189156","display_name":"Cellular automaton","level":2,"score":0.7776925563812256},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.7506895065307617},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6194444894790649},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.523014485836029},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.516258716583252},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45845240354537964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45029282569885254},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.44992977380752563},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4244422912597656},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.22103315591812134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11662104725837708},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10452967882156372},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1462586.1462592","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1462586.1462592","pdf_url":null,"source":{"id":"https://openalex.org/S112809824","display_name":"ACM Transactions on Reconfigurable Technology and Systems","issn_l":"1936-7406","issn":["1936-7406","1936-7414"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Reconfigurable Technology and Systems","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/f42d81fc-9442-4910-915a-042a1fff6680","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/compute-bound-and-io-bound-cellular-automata-simulations-on-fpga-logic(f42d81fc-9442-4910-915a-042a1fff6680).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Murtaza, S, Hoekstra, A G & Sloot, P M A 2009, 'Compute bound and I/O bound Cellular Automata simulations on FPGA logic', ACM Transactions on Reconfigurable Technology and Systems, vol. 1, no. 4, pp. 23. < http://doi.acm.org/10.1145/1462586.1462592 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/f42d81fc-9442-4910-915a-042a1fff6680","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/compute-bound-and-io-bound-cellular-automata-simulations-on-fpga-logic(f42d81fc-9442-4910-915a-042a1fff6680).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Murtaza, S, Hoekstra, A G & Sloot, P M A 2009, 'Compute bound and I/O bound Cellular Automata simulations on FPGA logic', ACM Transactions on Reconfigurable Technology and Systems, vol. 1, no. 4, pp. 23. < http://doi.acm.org/10.1145/1462586.1462592 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/84324","is_oa":false,"landing_page_url":"https://hdl.handle.net/10356/84324","pdf_url":null,"source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1503979119","https://openalex.org/W1524706847","https://openalex.org/W1559632398","https://openalex.org/W1571442171","https://openalex.org/W1622427330","https://openalex.org/W1970643500","https://openalex.org/W1999914547","https://openalex.org/W2002058571","https://openalex.org/W2017279115","https://openalex.org/W2043516784","https://openalex.org/W2065246777","https://openalex.org/W2096594729","https://openalex.org/W2132035824","https://openalex.org/W2139777359","https://openalex.org/W2141011635","https://openalex.org/W2167675045","https://openalex.org/W2263695121","https://openalex.org/W2561675875","https://openalex.org/W2568897204","https://openalex.org/W2612506596","https://openalex.org/W2625983909","https://openalex.org/W2911708692","https://openalex.org/W3021091730","https://openalex.org/W4301321901"],"related_works":["https://openalex.org/W2132035824","https://openalex.org/W1655879455","https://openalex.org/W4212789420","https://openalex.org/W1497700319","https://openalex.org/W566744560","https://openalex.org/W2356885299","https://openalex.org/W2103029213","https://openalex.org/W2621257092","https://openalex.org/W2102567747","https://openalex.org/W2029525085"],"abstract_inverted_index":{"FPGA-based":[0],"computation":[1],"engines":[2],"have":[3],"been":[4],"used":[5],"as":[6,121],"Cellular":[7,36,50,74,159,177,209],"Automata":[8,37,51,75,160,178,210],"accelerators":[9],"in":[10,94],"the":[11,19,33,58,68,73,87,90,131,141,145,150,158,163,173,190,195],"scientific":[12],"community":[13],"for":[14,138,189,202],"some":[15],"time":[16],"now.":[17],"With":[18],"recent":[20],"availability":[21],"of":[22,35,89,96,140,175],"more":[23],"advanced":[24],"FPGA":[25,62,70,165,182],"logic":[26],"it":[27],"becomes":[28],"necessary":[29],"to":[30,38,45,57,84,115,171,185],"better":[31],"understand":[32,86],"mapping":[34,48,151,196],"these":[39],"systems.":[40],"There":[41],"are":[42,101,154,218],"many":[43],"trade-offs":[44,65],"consider":[46],"when":[47],"a":[49,113,117,122],"algorithm":[52,93,120,161],"from":[53],"an":[54,126],"abstract":[55],"system":[56],"physical":[59],"implementation":[60],"using":[61],"logic.":[63],"The":[64,79,198],"include":[66],"both":[67,156,203],"available":[69],"resources":[71],"and":[72,153,162,184,205],"algorithm's":[76],"execution":[77,98],"time.":[78],"most":[80],"important":[81],"aspect":[82],"is":[83,200],"fully":[85],"behavior":[88],"specified":[91,118],"CA":[92,119],"terms":[95],"its":[97],"times":[99],"which":[100],"either":[102],"compute":[103,123,204],"bound":[104,124,207],"or":[105,125],"I/O":[106,127,206],"bound.":[107,128],"In":[108],"this":[109],"article,":[110],"we":[111],"present":[112],"methodology":[114,132,169],"categorize":[116],"We":[129,212],"take":[130],"further":[133],"by":[134,157],"presenting":[135],"rigorous":[136],"analysis":[137],"each":[139],"two":[142],"cases":[143],"identifying":[144],"various":[146,191],"parameters":[147,192],"that":[148,193,214],"control":[149,194],"process":[152],"defined":[155],"given":[164],"hardware":[166,183],"specifications.":[167],"This":[168],"helps":[170],"predict":[172],"performance":[174],"running":[176],"algorithms":[179],"on":[180],"specific":[181],"determine":[186],"optimal":[187],"values":[188],"process.":[197],"model":[199,216],"validated":[201],"two-dimensional":[208],"algorithms.":[211],"find":[213],"our":[215],"predictions":[217],"accurate":[219],"within":[220],"7%.":[221]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}