期刊文献+

一种新型膜计算方法在并行排序中的应用

Applied Research Based on a New Membrane Computing Method in Parallel Sorting
在线阅读 下载PDF
导出
摘要 膜计算作为一种新型的分布式、并行计算理论,是目前计算机科学、数学、生物学和人工智能等多学科交叉的研究热点.本文应用基本膜计算理论并结合泼水算法,提出了一种新型生物催化的膜计算方法解决并行排序问题,该方法充分利用了膜计算最大并行执行的特点,最后通过实例以验证该方法的可行性. As a new class of distributed and parallel computing theory, membrane computing is a hot crossdiscipline topic, which involves computer science, mathematics, biology and artificial intelligent. A new membrane computing method with catalyst promoter is proposed in this paper, in which basic membrane computing as based theory and flooding algorithm is adopted. The method uses maximal parallelism function to solve the parallel sorting problerrL Finally, an example is adopted to verify the feasibility of the new method.
作者 兰丽
出处 《兰州交通大学学报》 CAS 2011年第4期29-32,共4页 Journal of Lanzhou Jiaotong University
基金 国家自然科学基金(50678077)
关键词 膜计算 泼水算法 细胞 并行排序 membrane computing flooding algorithm cell parallel sorting
  • 相关文献

参考文献6

  • 1Paun G. Computing with membranes[J]. Journal of Computer and System Sciences, 2000,61 ( 1 ). 108-143.
  • 2Paun G. , Rozenberg G.. A guide to membrane computing[J]. Theoretical Computer Science, 2002, 287 (1) : 73-80.
  • 3张葛祥,潘林强.自然计算的新分支——膜计算[J].计算机学报,2010,33(2):208-214. 被引量:69
  • 4Nishida T Y. An application of P system: A new algorithm for NP complete optimization problems[C]// Proe of World Multi-Conference on Systemic, Cybernetics and Informaties. Orlando, IIIS, 2004 : 109-112.
  • 5钟诚,陈国良.Multisets排序的最优并行算法[J].计算机研究与发展,2003,40(2):336-341. 被引量:9
  • 6黄春毅,董笑菊,龙环.用P系统解决排序问题[J].上海交通大学学报,2008,42(2):206-208. 被引量:6

二级参考文献15

  • 1董驻鹏,董笑菊,倪佳华.系统生物模型转换研究——从SBML到Stochastic Pi Calculus[J].上海交通大学学报,2005,39(8):1280-1283. 被引量:1
  • 2高庆狮,刘志勇.纵、横、斜——倾斜与振荡法多路归并排序[J].中国科学(E辑),1996,26(6):549-557. 被引量:5
  • 3D E Knuth . The Art of Computer Programming . Vol 3: Sorting and Searching, 2nd ed . Reading, Mass: Addison-Wesley, 1998
  • 4S Rajasekaran, S Sahni . Sorting, selection, and routing on the array with reconfigurable optical buses . IEEE Trans on Parallel and Distributed Systems, 1997, 8(11): 1123~1132
  • 5D Z Chen, W Chen, K Wada et al . Parallel algorithms for partitioning sorted sets and related problem . Algorithmica, 2000, 28(2): 217~241
  • 6S Rajasekaran . An optimal parallel algorithm for sorting multisets . Information Processing Letters, 1998, 67(3): 141~143
  • 7沈鸿 陈国良.并行递归筛选选择算法[J].计算机学报,1988,11(7):523-532.
  • 8H Shen . Optimal parallel multiselection on EREW PRAM . Parallel Computing, 1997, 23(13): 1987~1992
  • 9S G AKL . An optimal algorithm for parallel selection . Information Processing Letters, 1984, 19(1): 47~50
  • 10M Blum, R W Floyd, V R Pratt et al . Time bounds for selection . Journal of Computer and System Sciences, 1973, 7(4): 448~461

共引文献79

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部