An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM

In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(log2n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used. Compared with the previous PRAM algorithms that consume O(n1+ε) memory cells...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	ETRI journal 1999-06, Vol.21 (2), p.22-30
Hauptverfasser:	Haa, Kyeoung‐Ju, Ku, Kyo‐Min, Park, Hae‐Kyeong, Kim, Young‐Kook, Ryu, Kwan‐Woo
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	30
container_issue	2
container_start_page	22
container_title	ETRI journal
container_volume	21
creator	Haa, Kyeoung‐Ju Ku, Kyo‐Min Park, Hae‐Kyeong Kim, Young‐Kook Ryu, Kwan‐Woo
description	In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(log2n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used. Compared with the previous PRAM algorithms that consume O(n1+ε) memory cells for some positive constant ε > 0, our algorithm consumes less memory cells without increasing the total number of operations.
doi_str_mv	10.4218/etrij.99.0199.0203
format	Article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_26915140</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>26915140</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3052-f99b73f870d16b6c75f0b7c9cc669269a31e3610a3262bcf85367f1a19b2c2a83</originalsourceid><addsrcrecordid>eNqNkV1LwzAUhoMoOKd_wKtciHed-WjT5rKM-gETx5x4GdKYbBlpO5MO2b833QbeenPOITzvy8l7ALjFaJISXDzo3tvNhPMJwkMhiJ6BESGUJjkl7ByMMCFZwlJGL8FVCBsUkTQrRkCVLayMscrqtodz6aVz2sHSrTpv-3UDTedhv9bw3bYrp-HjrlW97Vo47aQPOhw0vT08zX1XO93AOA6KalF9wvmifL0GF0a6oG9OfQw-Hqvl9DmZvT29TMtZoijKSGI4r3Nqihx9YVYzlWcG1bniSjHGCeOSYk0ZRjL-iNTKFBllucES85ooIgs6BvdH363vvndxN9HYoLRzstXdLojogTOcogiSI6h8F4LXRmy9baTfC4zEkKc45Ck4F0OeYsgziu5O7jIo6YyXrbLhT1lkKU0HrDhiP9bp_T-MRbVckHgPQn8B0z2HNw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26915140</pqid></control><display><type>article</type><title>An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Wiley Online Library (Open Access Collection)</source><creator>Haa, Kyeoung‐Ju ; Ku, Kyo‐Min ; Park, Hae‐Kyeong ; Kim, Young‐Kook ; Ryu, Kwan‐Woo</creator><creatorcontrib>Haa, Kyeoung‐Ju ; Ku, Kyo‐Min ; Park, Hae‐Kyeong ; Kim, Young‐Kook ; Ryu, Kwan‐Woo</creatorcontrib><description>In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(log2n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used. Compared with the previous PRAM algorithms that consume O(n1+ε) memory cells for some positive constant ε > 0, our algorithm consumes less memory cells without increasing the total number of operations.</description><identifier>ISSN: 1225-6463</identifier><identifier>EISSN: 2233-7326</identifier><identifier>DOI: 10.4218/etrij.99.0199.0203</identifier><language>eng</language><publisher>Taejon: Electronics and Telecommunications Research Institute</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Theoretical computing</subject><ispartof>ETRI journal, 1999-06, Vol.21 (2), p.22-30</ispartof><rights>1999 ETRI</rights><rights>1999 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.4218%2Fetrij.99.0199.0203$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.4218%2Fetrij.99.0199.0203$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>315,781,785,1434,27928,27929,46413,46837</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1854343$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Haa, Kyeoung‐Ju</creatorcontrib><creatorcontrib>Ku, Kyo‐Min</creatorcontrib><creatorcontrib>Park, Hae‐Kyeong</creatorcontrib><creatorcontrib>Kim, Young‐Kook</creatorcontrib><creatorcontrib>Ryu, Kwan‐Woo</creatorcontrib><title>An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM</title><title>ETRI journal</title><description>In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(log2n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used. Compared with the previous PRAM algorithms that consume O(n1+ε) memory cells for some positive constant ε > 0, our algorithm consumes less memory cells without increasing the total number of operations.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Theoretical computing</subject><issn>1225-6463</issn><issn>2233-7326</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><recordid>eNqNkV1LwzAUhoMoOKd_wKtciHed-WjT5rKM-gETx5x4GdKYbBlpO5MO2b833QbeenPOITzvy8l7ALjFaJISXDzo3tvNhPMJwkMhiJ6BESGUJjkl7ByMMCFZwlJGL8FVCBsUkTQrRkCVLayMscrqtodz6aVz2sHSrTpv-3UDTedhv9bw3bYrp-HjrlW97Vo47aQPOhw0vT08zX1XO93AOA6KalF9wvmifL0GF0a6oG9OfQw-Hqvl9DmZvT29TMtZoijKSGI4r3Nqihx9YVYzlWcG1bniSjHGCeOSYk0ZRjL-iNTKFBllucES85ooIgs6BvdH363vvndxN9HYoLRzstXdLojogTOcogiSI6h8F4LXRmy9baTfC4zEkKc45Ck4F0OeYsgziu5O7jIo6YyXrbLhT1lkKU0HrDhiP9bp_T-MRbVckHgPQn8B0z2HNw</recordid><startdate>199906</startdate><enddate>199906</enddate><creator>Haa, Kyeoung‐Ju</creator><creator>Ku, Kyo‐Min</creator><creator>Park, Hae‐Kyeong</creator><creator>Kim, Young‐Kook</creator><creator>Ryu, Kwan‐Woo</creator><general>Electronics and Telecommunications Research Institute</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>199906</creationdate><title>An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM</title><author>Haa, Kyeoung‐Ju ; Ku, Kyo‐Min ; Park, Hae‐Kyeong ; Kim, Young‐Kook ; Ryu, Kwan‐Woo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3052-f99b73f870d16b6c75f0b7c9cc669269a31e3610a3262bcf85367f1a19b2c2a83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Haa, Kyeoung‐Ju</creatorcontrib><creatorcontrib>Ku, Kyo‐Min</creatorcontrib><creatorcontrib>Park, Hae‐Kyeong</creatorcontrib><creatorcontrib>Kim, Young‐Kook</creatorcontrib><creatorcontrib>Ryu, Kwan‐Woo</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>ETRI journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Haa, Kyeoung‐Ju</au><au>Ku, Kyo‐Min</au><au>Park, Hae‐Kyeong</au><au>Kim, Young‐Kook</au><au>Ryu, Kwan‐Woo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM</atitle><jtitle>ETRI journal</jtitle><date>1999-06</date><risdate>1999</risdate><volume>21</volume><issue>2</issue><spage>22</spage><epage>30</epage><pages>22-30</pages><issn>1225-6463</issn><eissn>2233-7326</eissn><abstract>In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(log2n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used. Compared with the previous PRAM algorithms that consume O(n1+ε) memory cells for some positive constant ε > 0, our algorithm consumes less memory cells without increasing the total number of operations.</abstract><cop>Taejon</cop><pub>Electronics and Telecommunications Research Institute</pub><doi>10.4218/etrij.99.0199.0203</doi><tpages>9</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 1225-6463
ispartof	ETRI journal, 1999-06, Vol.21 (2), p.22-30
issn	1225-6463 2233-7326
language	eng
recordid	cdi_proquest_miscellaneous_26915140
source	Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Wiley Online Library (Open Access Collection)
subjects	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Theoretical computing
title	An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T23%3A41%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Efficient%20Parallel%20Algorithm%20for%20the%20Single%20Function%20Coarsest%20Partition%20Problem%20on%20the%20EREW%20PRAM&rft.jtitle=ETRI%20journal&rft.au=Haa,%20Kyeoung%E2%80%90Ju&rft.date=1999-06&rft.volume=21&rft.issue=2&rft.spage=22&rft.epage=30&rft.pages=22-30&rft.issn=1225-6463&rft.eissn=2233-7326&rft_id=info:doi/10.4218/etrij.99.0199.0203&rft_dat=%3Cproquest_cross%3E26915140%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=26915140&rft_id=info:pmid/&rfr_iscdi=true