{"title":"元胞自动机算法在AGILA高性能计算系统上的并行实现","authors":"Rafael P. Saldaña, Winfer C. Tabares, W. E. Yu","doi":"10.1109/ISPAN.2002.1004271","DOIUrl":null,"url":null,"abstract":"Four basic cellular automata (CA) algorithms are implemented on a Beowulf cluster with 8 processors using MPI and C. The CA algorithms are, namely, (1) Game of Life, (2) Greenburg-Hasting, (3) Cyclic Space, and (4) Hodgepodge Machine. The mathematical and computational aspects of 1D and 2D CA are also considered.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Parallel implementations of cellular automata algorithms on the AGILA high performance computing system\",\"authors\":\"Rafael P. Saldaña, Winfer C. Tabares, W. E. Yu\",\"doi\":\"10.1109/ISPAN.2002.1004271\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Four basic cellular automata (CA) algorithms are implemented on a Beowulf cluster with 8 processors using MPI and C. The CA algorithms are, namely, (1) Game of Life, (2) Greenburg-Hasting, (3) Cyclic Space, and (4) Hodgepodge Machine. The mathematical and computational aspects of 1D and 2D CA are also considered.\",\"PeriodicalId\":255069,\"journal\":{\"name\":\"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.2002.1004271\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2002.1004271","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallel implementations of cellular automata algorithms on the AGILA high performance computing system
Four basic cellular automata (CA) algorithms are implemented on a Beowulf cluster with 8 processors using MPI and C. The CA algorithms are, namely, (1) Game of Life, (2) Greenburg-Hasting, (3) Cyclic Space, and (4) Hodgepodge Machine. The mathematical and computational aspects of 1D and 2D CA are also considered.