完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChen, Sheng-Hsiung
dc.contributor.authorHuang, Ting-Lu
dc.date.accessioned2009-06-02T06:38:58Z
dc.date.accessioned2020-05-25T06:40:54Z-
dc.date.available2009-06-02T06:38:58Z
dc.date.available2020-05-25T06:40:54Z-
dc.date.issued2006-10-18T07:52:04Z
dc.date.submitted2004-12-15
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/1888-
dc.description.abstractIn distributed shared memory multiprocessors, remote memory accesses generate processor-to- memory trac which may result in a bottleneck. It is therefore important to design algorithms that minimize the number of remote memory accesses. We establish a lower bound of 3 on remote access time complexity for mutual exclusion algorithms in a model where processes communicate by means of a general read-modify-write primitive. Since a general read-modify-write primitive is a generalization of all atomic primitives that access at most one shared variable, our lower bound holds for any set of such primitives. Furthermore, this lower bound is tight because it matches the upper bound of Huang's al- gorithm proposed in 1999.
dc.description.sponsorship大同大學,台北市
dc.format.extent6p.
dc.format.extent286222 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries2004 ICS會議
dc.subjectmutual exclusion
dc.subjectatomic instructions
dc.subjectshared-memory systems
dc.subjecttime complexity
dc.subjecttight bounds
dc.subject.otherMiscellaneous
dc.titleA Tight Bound on Time Complexity of Mutual Exclusion
分類:2004年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002004000234.pdf279.51 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。