期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

ATLAS语言实现中的设备分配算法研究 被引量：1

Device Allocation Algorithm of ATLAS Language Implementation
在线阅读 下载PDF
导出
摘要 ATLAS是一种专业领域测试语言,其特有的设备分配给该语言的实现带来一定困难.本文提出了一种基于剥夺的启发式双重回溯搜索静态设备分配算法;并针对实际应用中ATE的特点,给出了两个实用的启发函数指导设备分配过程.通过若干实例表明,该算法能够以较高的效率实现静态设备分配. As a test language of special domain,ATLAS（Abbreviated Test Language for All Systems）is difficult to be implemented for its proper device allocation.This paper proposes a kind of static device allocation algorithm based on the privative heuristic duple-back-tracing searching.Furthermore,according to the character of practical ATE（Automatic Test Equipment）,two practicable heuristic functions are provided to guide the process of device allocation.Finally some instances are shown to indicate the algorithm can implement the static device allocation with better efficiency.
作者 郭德贵 刘磊 金英 程斌
机构地区 吉林大学计算机科学与技术学院
出处 《电子学报》 EI CAS CSCD 北大核心 2007年第11期2205-2210,共6页 Acta Electronica Sinica
基金 吉林省科技发展计划项目基金(No.20050527) 博士学科点专项科研基金(No.20060183044)
关键词 设备分配 启发函数 双重回溯搜索算法 设备分配请求 device allocation heuristic function duple-back-tracing searching algorithm device allocation request
分类号 TP31 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献15

  • 1IEEE Std 771-1998, IEEE Guide to The Use of The ATLAS Specification[ S].
  • 2IEEE Std 716-1995,IEEE Standard Test Language for All Systems- Common/Abbreviated Test Language for All Systems (C/ATLAS) [S].
  • 3IEEF. SCC-20-1997, ATLAS-2000 Test Language Requirements Document[ S].
  • 4M R Garey, D S Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness [ M ]. W H Freeman & Co New York, 1979.
  • 5N Robertson, P D Seymour. Graph minors-XIII: The disjoint paths problem[ J] .Journal of Combinatorial Theory B, 1995,63 (1) :65-110.
  • 6Y Shiloach. A polynomial solution in the undirected two paths problem[ J] .Journal of the ACM, 1980,27(3) :445-456.
  • 7D S Hochbaum. An exact sublinear algorithm for the max flow, vertex-disjoint paths and communication problems on random graphs[J]. Operations Research, 1992,40(5):923-935.
  • 8A Z Broder, A M Frieze, S Suen, E Upfal. An efficient algorithm for the vertex-disjoint paths problem in random graphs [A]. Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms[ C] .Society for Industrial and Applied Mathematics Philadelphia, 1996.261-268.
  • 9E Shamir, E Upfal. A parallel fast construction of disjoint paths in networks[ A ] : Foundations of computation theory[ C]:. New York: Elsevier North-Holland, 1985. 141-153.
  • 10Stavros G Kolliopoulos, Clifford Stein. Approximating disjointpath problems using packing integer programs[ J]. Mathematical Programming,Springer Berlin/Heidelberg,2004,99( 1 ) :63-87.

二级参考文献12

  • 1Thomas H Cormen,Charles E Leiserson Ronald L Rivest,Clifford Stein.Introduction To Algorithms(second edition)[M].Mass achusettes:MIT Press,2001.
  • 2UCLA Parallel Computing Laboratory and Wireless Adaptive Mobility Laboratory.GloMoSim:A Scalable Simulation Environment for Wireless and Wired Network Systems[EB/OL].http://pcl.cs.ucla.edu/projects/glomosim.htm.
  • 3S Corson,J Macker.Mobile Ad Hoc networking(MANET):Routing Protocol performanceissues and evaluation considerations[EB/OL].http://www.ietf.org/rfc/rfc2501.txt,RFC2501,1999-01.
  • 4S J Lee,M Gerla.Split multipath routing with maximally disjoint paths in Ad hoc networks[A].Proceed of IEEE ICC2001[C].Washington:IEEE Compute Society,2001.3201-3205.
  • 5Kai Wu,Janelle Harms.Performance study of a multipath routing method for wireless mobile Ad hoc Networks[A].Cincinnati,Ohio Aug:Proceedings of IEEE/ACM 9th International Symposium on Modeling, Analysis and simulation(MASCOTS 01)[C].New York:ACM Press,2001
  • 6A Nasipuri,R Castaneda,S DAS.Performance of multipath routing for on-demand protocols in mobile Ad Hoc networks[J].ACM/Kluwer Mobile Networks and Applications(MONET) Journal,2001,6(4):339-349.
  • 7P Papadimitratos,Z J Hass,E G Sirer.Path set selection in mobile Ad hoc networks[A].Lausanne,Switzerland:ACM Mobihoc 2002[C].New York:ACM Press,2002.
  • 8J Broch,D A Maltz,D B Johnson,Y Hu,J Jetcheva.A performance comparison of multi-hop wireless Ad Hoc network routing protocols[A].ACM/IEEE Int.Conf.On Mobile comprting and networkig[C].New York:ACM Press,1998.85-97.
  • 9D Johnson,D A Maltz.The dynamic source routint protocol for mobile ad hoc wireless networks[EB/OL].http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-09.txt,IEFT mobile Ad Hoc Networks Working Group,Internet Draft,work in progress,2003,04-15.
  • 10C E Perkins,E M Royer.Ad-hoc on demand distance vector routing[A].IEEE Workshop on Mobile Computing Systems and Applications[C]. Washington:IEEE Computer Society,Feb 1999.

共引文献24

同被引文献3

引证文献1

电子学报
2007年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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