J. Bower, M. Nelson, M. Wilson, G. Fox, W. Furmanski
{"title":"Piriform (Olfactory) cortex model on the hypercube","authors":"J. Bower, M. Nelson, M. Wilson, G. Fox, W. Furmanski","doi":"10.1145/63047.63052","DOIUrl":null,"url":null,"abstract":"We present a concurrent hypercube implementation of a neurophysiological model for the piriform (olfactory) cortex.\nThe project was undertaken as the first step towards constructing a general neural network simulator on the hypercube, suitable both for applied and biological nets.\nThe method presented here is expected to be useful for a class of complex and computationally expensive network models with long range connectivity and non-homogeneous activity patterns. The hypercube communication for the fully interconnected case is efficiently realized by the fold algorithm, constructed previously for problems in concurrent matrix algebra whereas the patchy activity is successfully load balanced by the scattered decomposition. We discuss also briefly other communication strategies, relevant for sparse and variable connectivities.\nSample numerical results presented here were derived on the NCUBE hypercube at Caltech.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Hypercube Concurrent Computers and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/63047.63052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
We present a concurrent hypercube implementation of a neurophysiological model for the piriform (olfactory) cortex.
The project was undertaken as the first step towards constructing a general neural network simulator on the hypercube, suitable both for applied and biological nets.
The method presented here is expected to be useful for a class of complex and computationally expensive network models with long range connectivity and non-homogeneous activity patterns. The hypercube communication for the fully interconnected case is efficiently realized by the fold algorithm, constructed previously for problems in concurrent matrix algebra whereas the patchy activity is successfully load balanced by the scattered decomposition. We discuss also briefly other communication strategies, relevant for sparse and variable connectivities.
Sample numerical results presented here were derived on the NCUBE hypercube at Caltech.