{"title":"可重构环面计算机并行算法的可视化","authors":"Judy Brown, Paul Martin, Neil Paku, G. Turner","doi":"10.1109/OZCHI.1998.732209","DOIUrl":null,"url":null,"abstract":"Program visualisation can help make an algorithm understandable. Program visualisation is especially challenging in the area of parallel computations where many processors are executing simultaneously. Algorithms for parallel machines take advantage of the simultaneous activity of processors to perform operations very quickly. As a result, these algorithms can be difficult to understand. We describe a visualisation tool developed specifically for explaining algorithms written for single-instruction, multiple-data (SIMD) computers called torus computers. This tool helps its users to visualise the patterns of activities of the processors in the process of a computation.","PeriodicalId":322019,"journal":{"name":"Proceedings 1998 Australasian Computer Human Interaction Conference. OzCHI'98 (Cat. No.98EX234)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Visualisations of parallel algorithms for reconfigurable torus computers\",\"authors\":\"Judy Brown, Paul Martin, Neil Paku, G. Turner\",\"doi\":\"10.1109/OZCHI.1998.732209\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Program visualisation can help make an algorithm understandable. Program visualisation is especially challenging in the area of parallel computations where many processors are executing simultaneously. Algorithms for parallel machines take advantage of the simultaneous activity of processors to perform operations very quickly. As a result, these algorithms can be difficult to understand. We describe a visualisation tool developed specifically for explaining algorithms written for single-instruction, multiple-data (SIMD) computers called torus computers. This tool helps its users to visualise the patterns of activities of the processors in the process of a computation.\",\"PeriodicalId\":322019,\"journal\":{\"name\":\"Proceedings 1998 Australasian Computer Human Interaction Conference. OzCHI'98 (Cat. No.98EX234)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1998 Australasian Computer Human Interaction Conference. OzCHI'98 (Cat. No.98EX234)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OZCHI.1998.732209\",\"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 1998 Australasian Computer Human Interaction Conference. OzCHI'98 (Cat. No.98EX234)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OZCHI.1998.732209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Visualisations of parallel algorithms for reconfigurable torus computers
Program visualisation can help make an algorithm understandable. Program visualisation is especially challenging in the area of parallel computations where many processors are executing simultaneously. Algorithms for parallel machines take advantage of the simultaneous activity of processors to perform operations very quickly. As a result, these algorithms can be difficult to understand. We describe a visualisation tool developed specifically for explaining algorithms written for single-instruction, multiple-data (SIMD) computers called torus computers. This tool helps its users to visualise the patterns of activities of the processors in the process of a computation.