A New Algorithm to Prove that the Short-job-first Algorithm Has the Least Mean Waiting Time

LZUFE-KMS > 教务处

	A New Algorithm to Prove that the Short-job-first Algorithm Has the Least Mean Waiting Time
	Wang Jikui; Liang Junrong; Wang Huiyong
	2010
会议名称	2ND INTERNATIONAL SYMPOSIUM ON COMPUTER NETWORK AND MULTIMEDIA TECHNOLOGY (CNMT 2010), VOLS 1 AND 2
会议录名称	IEEE
页码	734-735
会议日期	DEC 24-26, 2010
会议地点	Wuhan, PEOPLES R CHINA
出版地	345 E 47TH ST, NEW YORK, NY 10017 USA
出版者	IEEE
摘要	The short-job-first algorithm has massive applications in real life. In this paper, we analyze and revise the exchange sorting algorithm of the internal sorting category. Then we propose a new algorithm to prove that the short-job-first algorithm has the least mean waiting time.
关键词	short-job-first mean waiting time exchange sorting bubble sorting
URL	查看原文
收录类别	CPCI ; CPCI-S
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Hardware & Architecture
WOS记录号	WOS:000295921100180
原始文献类型	Proceedings Paper
引用统计	被引频次[WOS]：0 [WOS记录] [WOS相关记录]
文献类型	会议论文
条目标识符	http://ir.lzufe.edu.cn/handle/39EH0E1M/9860
专题	教务处信息工程与人工智能学院信息中心
作者单位	Lanzhou Univ Finance & Econ, Sch Informat Engn, Lan Zhou, Peoples R China
推荐引用方式 GB/T 7714	Wang Jikui,Liang Junrong,Wang Huiyong. A New Algorithm to Prove that the Short-job-first Algorithm Has the Least Mean Waiting Time[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA:IEEE,2010:734-735.