首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7篇
  完全免费   3篇
  自动化技术   10篇
  2015年   1篇
  2012年   1篇
  2011年   1篇
  2009年   2篇
  2008年   2篇
  2005年   1篇
  2002年   2篇
排序方式: 共有10条查询结果,搜索用时 109 毫秒
1
1.
讨论离散时间系统中不同服务率的并行服务器信息流的控制问题.建立了一个模糊控制器来决定排队系统信息流分配的最优策略,使得顾客在通信系统中的平均逗留时间最小.仿真结果表明了该模糊控制器的有效性.  相似文献
2.
By the imbedded Markov chain theory and the probability generating function method, this paper discusses the queuing model of the switch node at the router and analyzes the derivative characters of first and second order of discrete asymmetric tri-queuing gate polling system. The average waiting time and the average queuing length are explicitly obtained and these results are verified by simulation.  相似文献
3.
现在的Internet服务模式已经进入以电子交易和多媒体业务为主体服务的时代,为了在Internet上提供端到端的QoS保障,服务器的工作效率以及对各种不同的HTTP请求的响应时间已成为WebQoS问题的研究核心。论文对WebQoS控制组件中分类策略以及工作进程调度策略以离散时间型轮询的方式对其进行了数学上的分析,得出系统各优先级队列的平均排队对长,以及系统中HTTP请求的平均等待时间。  相似文献
4.
针对已有的多业务流多通道并行传输不支持业务流之间优先级的问题,将业务的优先级映射到多个通道,建立了具有优先级保证的多业务流多通道数据传输模型。基于排队论知识将模型抽象成多维Markov链,并使用两阶段的PH分布将多维Markov链近似成一维Markov链,采用矩阵分析方法对模型进行定量分析,推导出系统的平均队长和平均等待时间。通过数值分析与简单多业务流单通道、多优先级业务流单通道、简单多业务流多通道这三种传输模型进行了比较。结果表明,不管业务流达到率如何变化,多优先级业务流多通道并行传输模型中的高优先级数据包均能够获得较高的处理能力,说明了该模型能够支持多通道并行传输中业务流之间的优先控制。  相似文献
5.
In this paper, a supply chain (four-input three-stage queuing network) receives uniformly distributed orders from clients. An input order is represented by two stochastic variables, occurrence time and the quantity of items to be delivered. The objective of this work is to compute the minimum response time, and thus the average number of items (optimum capacity) that can be delivered with this response time. Performance measures such as average queue lengths, average response times, and average waiting times of the jobs in the supply chain, and in the equivalent single-server network are derived, plotted and discussed.  相似文献
6.
In a grid computing environment, a great many users may access the same database simultaneously. To reduce the average waiting time for all users, a grid designer usually replicates the frequently accessed database among nodes based on the load balance heuristic. On the other hand, users may raise identical queries regarding an issue of interest, e.g., stock information, on a database and each of the queries will be directed to any node having a replica of that database. That is, the same answer will be determined by multiple nodes. Consequently, there exist two shortcomings of poor data sharing and duplicate calculations if the database is not replicated and allocated adequately. In this paper, we aim to minimize average waiting time and try to overcome the two shortcomings by performing database allocation over multiple nodes without any replication. The main idea behind the proposed method is to map the original problem to the Euclidean space Rn and to solve the mapped problem in Rn by a gradient-based optimization technique. The theoretical analyses ensure that the proposed method can converge linearly and achieve near-optimal results.  相似文献
7.
In a large-scale multimedia storage system (LMSS) where the user requests for different multimedia objects may have different demands, placement and replication of the objects is an important factor, as it may result in an imbalance in loading across the system. Since replica management and load balancing is a crucial issue in multimedia systems, normally this problem is handled by centralized servers, e.g., metadata servers (MDS) in distributed file systems. Each object-based storage device (OSD) responds to the requests coming from the centralized servers independently and has no communication with other OSDs among the system. In this paper, we design a novel distributed architecture of LMSS, in which the OSDs have some kind of intelligences and can cooperate to achieve a high performance. Such an OSD, named as autonomous object-based storage device (AOSD), can replicate the objects to and balance the requests among other AOSDs, and handle fail-over and recovery autonomously. In the proposed architecture, we move the request balancing from centralized MDS to AOSDs and make the system more scalable, flexible, and robust. Based on the proposed architecture, we propose two different object replication and load balancing algorithms, named as “Minimum Average Waiting Time” (MAWT) and “One of the Best Two Choices” (OBTC), respectively. We validate the performance of the algorithms via rigorous simulations with respect to several influencing factors. Our findings conclusively demonstrate that the proposed architecture minimizes the average waiting time and at the same time carries out load balancing across servers.  相似文献
8.
本文基于Min-min算法和Sufferage算法提出了基于任务调度损失的最小最早完成时间算法(Sufferage Min-min,SMM).该算法将任务调度损失引入Min-min算法,选取最早完成时间较小的k个任务,再优先对其中任务调度损失最大的一个进行调度.SMM算法克服了Min-min算法单纯追求局部最优而缺少全局意识的缺点.测试表明,SMM算法可以做到调度跨度低与平均等待时间小的统一,在综合性能上较Min-min算法有所提高.  相似文献
9.
In this paper, an industrial system is represented as a 2-input, three-stage queuing network. The two input queuing network receives orders from clients, and the orders are waiting to be served. Each order comprises (i) time of occurrence of the orders and (ii) quantity of items to be delivered in each order. The objective of this paper is to compute the minimum response time for the delivery of items to the final destination along the three stages of the network. The average number of items that can be delivered with this minimum response time constitute the optimum capacity of the queuing network. After getting serviced by the last node (a queue and its server) in each stage of the queuing network, a decision is made to route the items to the appropriate node in the next stage which can produce the least response time. Performance measures such as average queue lengths, average response times, and average waiting times of the jobs in the 2-input network are derived and plotted. Closed-form expressions for the equivalent service rate, equivalent average queue lengths, and equivalent response and waiting times of a single queue with a single server representing the 2-input queuing network are also derived and plotted.  相似文献
10.
曹旻  刘文中 《计算机科学》2015,42(6):175-180
针对多类型多访问模式应用的需求,在GDSF算法的基础上,引入平均访问间隔和最近访问间隔两个特性以增强算法的适应性;建立缓存结构模型,通过双关键字索引机制,快速索引缓存对象,降低系统开销;对超过一定大小的文件采取后缀预取策略以增加缓存中数据对象的个数.在课题应用背景下,与传统算法的对比实验表明,该方法能够减少缓存的平均请求等待时间,提高对象命中率和字节命中率,增强了缓存替换算法对多类型多请求模式应用的适应性.  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号