摘要
随着数据库访问中间件技术的发展,对中间件的实时性要求越来越高,即如何更高效地对越来越多的任务需求进行调度处理,是数据库访问中间件亟需解决的问题。本文以省级财政厅的数据库访问中间件项目为研究背景,以现有的实时调度算法为原型,提出了一种基于任务聚集的最小松弛度调度算法TALLF,该算法使数据库访问中间件能够在大量用户并发的情况下,依然保持较高的性能。
With the development of database-access middleware technology, higher real-time of it is more important. How to make the task scheduling work more efficiently is the problem. In this paper, the provincial Department of Finance's database-access middleware is the project background and the existing real-time scheduling algorithm is the prototype, then a task-based aggregation of minimum laxity scheduling algorithm TALLF is proposed. Under a large number of concurrent users, this algorithm maintains a high performance.
出处
《清远职业技术学院学报》
2011年第6期37-40,共4页
Journal of Qingyuan Polytechnic
基金
国家自然科学基金资助项目(61072109)