实验二：栈和队列.ppt

实验二：栈和队列(一) 打印队列模拟 实验背景 无论是网络上路由器的存储转发还是图的广度优先遍历算法，队列在计算机科学和信息技术中的应用是非常广泛的。 网络上的打印作业的管理应用中要决定用户得到打印服务的优先次序。如果我们按照作业到来的顺序采用先来先服务的策略，那么队列就可以实现这种先来先服务的机制。 实验目标 对队列的理解 对STL中的queue的使用 实验要仿真一个网络打印过程 实验目标 仿真过程要从一个文件中读、处理事件表 Event record（a job）构成 The time (in seconds) The length in pages of the job The name of the computer 从文件中读出后存储在workload(inherited queue) 类 实验目标 实验方案 simulate the passage of time by incrementing a counter A print job “arrives”. pop this event. place it in another queue<event> object. The job waiting in this queue. 工程文件 main.cpp - Includes function main simulator.h - Declaration of class simulator simulator.cpp - Definition of class simulator event.h - Declaration of class event event.cpp - Definition of class event job.h - Declaration of class job 存储结构 job.cpp - Definition of class job arbitrary.run - Data file containing arbitrary print jobs arbitrary.out - Output from a sample solution when run using arbitrary.run bigfirst.run - Data file containing larger jobs first bigfirst.out - Output from a sample solution when run using bigfirst.run void Part::describe(void) declare and implement class fifo. void Part::describe(void) First declare your class fifo in a file named fifo.h. Declare class fifo appropriately to model the following relationship: a fifo is a type of simulator. void Part::describe(void) Next complete the implementation of fifo::simulate. void Part::describe(void) Next This member function should first load the data file using the inherited loadworkload. Then it should implement the simulation as described above. Use the inherited seconds_per_page data member to help determine how long a print job takes to print. Your solution's output should match the output from the sample solutions. void Part::describe(void) latency ：作业到来之后等待开始打印的时间 Aggregate latency ：所有打印作业的总的等待时间 mean latency：作业的平均等待时间 打印作业状态图 fifo::simulate流程 * * job(); job(int number_of_pages, string user); string getuser() const; int getnumpages() const