ANALYSIS OF THE MULTIGROUP METHOD FOR MANIPULATING MULTIPLE STACKS
| dc.citation.epage | 57 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 43 | en_US |
| dc.citation.volume | 25 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | CHIEN, BC | en_US |
| dc.contributor.author | CHEN, RJ | en_US |
| dc.contributor.author | YANG, WP | en_US |
| dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
| dc.contributor.department | Institute of Computer Science and Engineering | en_US |
| dc.date.accessioned | 2014-12-08T15:04:39Z | |
| dc.date.available | 2014-12-08T15:04:39Z | |
| dc.date.issued | 1993-02-01 | en_US |
| dc.description.abstract | The multiple stacks problem is that a number of stacks have to be manipulated in a finite continuous memory, simultaneously. Many applications need the support of multiple stacks, e.g., the parallel computing with shared memory. There are two approaches mentioned in [1] for manipulating multiple stacks. In this paper, we present and analyze the Multigroup method which combines the concept of coexisting. By the concept of coexisting, storage sharing in a linear data structure is possible. We show that the new method has better performance than the two previous approaches, and improves the extra manipulating time. | en_US |
| dc.identifier.issn | 0898-1221 | en_US |
| dc.identifier.journal | COMPUTERS & MATHEMATICS WITH APPLICATIONS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3146 | |
| dc.identifier.wosnumber | WOS:A1993KG93600005 | |
| dc.language.iso | en_US | en_US |
| dc.title | ANALYSIS OF THE MULTIGROUP METHOD FOR MANIPULATING MULTIPLE STACKS | en_US |
| dc.type | Article | en_US |