搜索资源列表
mmc_analysis
- 单列多服务台排队系统需求分析 用户在系统主界面输入服务台数、顾客总数、仿真时间、等初始数据，经过后台系统处理相关数据并进行分析计算，得出顾客排队的最大队长、平均队长、系统中平均实体数、顾客平均等待时间、顾客最大等待时间、服务台的空期和忙期各占百分比以及每个顾客在系统中花费的时间等等。-Single multi-server queuing system requirements analysis the main user interface to enter in the system h
m-queue-simulation
- m queue simulation and methods
red-queue
- simulation of red in ns2
droptail-queue
- simulation scr ipt for droptail queue in ns2
jincheng
- 进程调度模拟程序:假设有10个进程需要在CPU上执行,分别用:先进先出调度算法 基于优先数的调度算法 最短执行时间调度算法 确定这10个进程在CPU上的执行过程.要求每次进程调度时在屏幕上显示:当前执行进程 就绪队列 等待队列-Process scheduling simulation program: Suppose there are 10 process requires the CPU to perform, respectively: FIFO scheduling algori
Stocasticqueue
- queue simulation for matlab
omnetUserManual
- OMNeT++中文手册协议模拟 OMNEST 是OMNeT++的一个商业版本，OMNeT++只在学术和非盈利性活动免费，在进行商业性 研究时需要从Global 公司获得OMNEST 许可证。-OMNeT++ Chinese manual agreement simulation • simulation queue network • simulation multiprocessor and other distributed hardware
airplane
- 机场航空管制模拟 使用队列或优先队列实现；要求可以变换起飞和着陆频率来模拟一天中的飞行高峰期和空闲期；要求可以改变着陆和起飞时间以模拟不同的效果。-Airport air traffic control simulation using a queue or priority queue implementation requirements can transform takeoff and landing frequency to simulate flying day peak peri
22.01
- 编写并调试一个模拟的进程调度程序，采用“轮转法”调度算法对五个进程进行调度。 轮转法可以是简单轮转法、可变时间片轮转法，或多队列轮转法。 简单轮转法的基本思想是：所有就绪进程按 FCFS排成一个队列，总是把处理机分配给队首的进程，各进程占用CPU的时间片相同。如果运行进程用完它的时间片后还为完成，就把它送回到就绪队列的末尾，把处理机重新分配给队首的进程，直至所有的进程运行完毕。-Write and debug a simulation of the process schedul
shejiwendang
- 银行业务模拟问题描述：客户业务分为两种：第一种是申请从银行得到一笔资金，即取款或借款。第二种是向银行投入一笔资金，即存款或还款。银行有两个服务窗口，相应的有两个队列。客户到达银行后先排第一个队。处理每个客户业务时，如果属于第一种，且申请额超出银行现存资金总额而得不到满足，则立即排入第二队等候，直至满足时才离开银行，否则业务处理完后立即离开银行。每接待完一个第二种业务的客户，则顺序检查和处理（如果可能）第二个队列的客户，对能满足的申请者予以满足，不能满足者重新排到第二个队列的队尾。通过模拟方法求出
bank
- 小型ATM模拟，通过消息队列实现客户端与服务器之间的通信，通过文件读写操作存储数据-Small ATM simulation, through the message queue communication between client and server, the data is stored via file read and write operations
ns2aodv
- NS (Version 2) is an open source network simulation tool. It is an object oriented, discrete event driven simulator written in C++ and Otcl. The primary use of NS is in network researches to simulate various types of wired/wireless local and wide are
example1b
- Tcl scr ipt for ns which simulates a simple topology learn how to set up nodes and links, how to send data from one node to another, how to monitor a queue and how to start nam from your simulation scr ipt to visualize your simulation.
Dijksta-algorithm
- 提出一种新型的Dijkstra改进算法，具有高效性．其改进分3个方面：采用邻接表作为道路网络拓扑的存储结构；利用二叉堆实现优先队列；根据节点的分布情况将搜索过程分为几个阶段，引入了动态限制搜索区域机制．最后在实际道路网络中的测试及仿真结果表明了改进算法的可行性和优越性． -Dijkstra proposes a new improved algorithm with high efficiency. Improved three aspects: the adjacent table as th
(Queue)
- queue using c.we can simulation a queue using c programming.
Code
- SIMULATION OF NETWORK TOPOLOGY USING NS2 Consider the network where T1-T6 are transmitters and R1-R6 are receivers. R1 receives from T1, R2 receives from T2 and so on. B1,B2 and B3 act as bottleneck nodes and also provide for routing of packets
Heaps
- Many applications require that we process records with keys in order, but not necessarily in full sorted order. Often we collect a set of items and process the one with the current minimum value. e.g. jobs sent to a printer, Operating system j
queuesNew
- A queue is a list from which items are deleted from one end (front) and into which items are inserted at the other end (rear, or back) It is like line of people waiting to purchase tickets: Queue is referred to as a first-in-first-out (FIFO) data
MM1_Tutorial1
- MM1_Tutorial Objective This laboratory is important for understanding OPNET system and user interface. The lab contains a step-by-step example that shows how to use OPNET to construct an M/M/1 queue design and analysis. Overview The task i