Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHIEN, BCen_US
dc.contributor.authorCHEN, RJen_US
dc.contributor.authorYANG, WPen_US
dc.date.accessioned2014-12-08T15:04:39Z-
dc.date.available2014-12-08T15:04:39Z-
dc.date.issued1993-02-01en_US
dc.identifier.issn0898-1221en_US
dc.identifier.urihttp://hdl.handle.net/11536/3146-
dc.description.abstractThe 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.language.isoen_USen_US
dc.titleANALYSIS OF THE MULTIGROUP METHOD FOR MANIPULATING MULTIPLE STACKSen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & MATHEMATICS WITH APPLICATIONSen_US
dc.citation.volume25en_US
dc.citation.issue3en_US
dc.citation.spage43en_US
dc.citation.epage57en_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:A1993KG93600005-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. A1993KG93600005.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.