{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:26:05Z","timestamp":1742394365184,"version":"3.38.0"},"reference-count":13,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of Supercomputer Applications and High Performance Computing"],"published-print":{"date-parts":[[1997,3]]},"abstract":"<jats:p> In applications such as landscape ecology, computer mod eling is used to assess habitat fragmentation and its ecological implications. Maps (two-dimensional grids) of habitat clusters or patches are analyzed to determine the number, location, and sizes of clusters. Recently, improved sequential and parallel implementations of the Hoshen- Kopelman cluster identification algorithm have been designed. These implementations use a finite state ma chine to reduce redundant integer comparisons during the cluster identification process. The sequential implementa tion for large maps performs cluster identification by par titioning the map along row boundaries and merging the results of the partitions. The parallel implementation on a 32-processor Thinking Machines CM-5 provides an effi cient mechanism for performing cluster identification in parallel. Although the sequential implementation achieved promising speed improvements ranging from 1.39 to 2.00 over an existing Hoshen-Kopelman implementation, the parallel implementation achieved a minimum speedup of 5.41 over the improved sequential implementation, exe cuted on a Sun SPARCstation 10. <\/jats:p>","DOI":"10.1177\/109434209701100103","type":"journal-article","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T01:17:47Z","timestamp":1173057467000},"page":"34-48","source":"Crossref","is-referenced-by-count":12,"title":["Parallelization of the Hoshen-Kopelman Algorithm Using a Finite State Machine"],"prefix":"10.1177","volume":"11","author":[{"given":"Jeffrey M.","family":"Constantin","sequence":"first","affiliation":[{"name":"DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF TENNESSEE,\rKNOXVILLE, TN 37996-1301"}]},{"given":"Michael W.","family":"Berry","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF TENNESSEE,\rKNOXVILLE, TN 37996-1301"}]},{"given":"Bradley T.","family":"Vander Zanden","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF TENNESSEE,\rKNOXVILLE, TN 37996-1301"}]}],"member":"179","published-online":{"date-parts":[[1997,3,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1109\/99.326668"},{"volume-title":"Data-parallel implementations of map analysis and animal movement for landscape ecology models","year":"1993","author":"Comiskey, E.J.","key":"atypb2"},{"volume-title":"A parallel implementation of the Hoshen-Kopelman algorithm using a finite state machine. Master's Thesis","year":"1995","author":"Constantin, J.M.","key":"atypb3"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.1994.313174"},{"volume-title":"Simulating fire patterns in heterogeneous landscapes: The analysis and interpretation of landscape heterogeneity","year":"1995","author":"Hargrove, W.","key":"atypb5"},{"volume-title":"Introduction to automata theory, languages, and computation","year":"1979","author":"Hopcroft, J.","key":"atypb6"},{"key":"atypb7","first-page":"14","author":"Hoshen, J.","year":"1976","journal-title":"Phys. Rev."},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1126\/science.231.4740.814"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01010423"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.4324\/9780203211595"},{"volume-title":"Connection machine CM-5 technical summary","year":"1993","author":"Thinking Machines Corporation.","key":"atypb11"},{"volume-title":"Connection machine CM-5, user's guide","year":"1993","author":"Thinking Machines Corporation.","key":"atypb12"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1002\/3527602798"}],"container-title":["The International Journal of Supercomputer Applications and High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/109434209701100103","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/109434209701100103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T22:43:07Z","timestamp":1741041787000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/109434209701100103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["10.1177\/109434209701100103"],"URL":"https:\/\/doi.org\/10.1177\/109434209701100103","relation":{},"ISSN":["1078-3482"],"issn-type":[{"type":"print","value":"1078-3482"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}