搜索资源列表
tingchechang
- 从终端读入汽车到达或离去的数据，每组数据包括两项：①是“到达”还是“离去”；②汽车牌照号码。与每组输入信息相应的输出信息为：如果是到达的车辆，则输出其在停车场中或便道上的位置，并输出停车场中现有汽车车牌号码；如果是离去的车辆，安排在便道中等候的车辆进入停车场，输出停车场中汽车车牌号码。-Car park management data structure of the application stack and queue issues dual stack parking lot paveme
2
- design active queue management for router
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.
CircleBuffer
- 模板类名：CircleBuffer 功 能：环形缓冲区 优 点：相对于队列来说减少了很多对地址的反复操作，增加稳定性。-Template class name: CircleBuffer function: the ring buffer Pros: relative to the queue for reduced many repeated operation of the address, to increase stability.
4
- 针对目前图形处理器(GPU) 上的动态数据处理问题，在分析现有并行单源最短路径(SSSP) 算法的基础上，对 GPU上的Moore SSSP算法进行并行化设计与实现。搜索时，综合应用层次化任务分配、层次化工作队列、层次化 Kernel 调用等策略。在不同类型图数据上进行实验测试，实验结果表明，该算法能有效减少空线程开销、访存开销以及同步时间。-For dynamic data processing on the graphics processor (GPU), the analysis of
Lecture_07-(Queues)
- The queue structure is a simple structure like the stack. The difference from the stack is that the first elements to enter the queue get processed first. That is, service requests get added to the end of the list. That is why, it is also defined
some
- 用c语言编程实现在链队列中实现入队和出对的操作-C programming language in the chain queue into the team and on the operation
zuoyediaodu
- 进程调度是处理机管理的核心内容。本实验要求用C语言编写和调试一个简单的进程调度程序。通过本实验可以加深理解有关进程控制块、进程队列的概念，并体会和了解优先数和时间片轮转调度算法的具体实施办法。-Process scheduling is the core content of the processor management. The experiment called the C language to write and debug a simple process scheduler. T
Dijksta-algorithm
- 提出一种新型的Dijkstra改进算法，具有高效性．其改进分3个方面：采用邻接表作为道路网络拓扑的存储结构；利用二叉堆实现优先队列；根据节点的分布情况将搜索过程分为几个阶段，引入了动态限制搜索区域机制．最后在实际道路网络中的测试及仿真结果表明了改进算法的可行性和优越性． -Dijkstra proposes a new improved algorithm with high efficiency. Improved three aspects: the adjacent table as th
arm-for-ucos-study1
- this is collection of book for u cos to understand the concept of message queue
3
- 对一篇由英文字母、空格、标点符号构成的文档，进行Huffman编码 数据输入： 由文件input.txt给出输入数据。 输入文件示例 input.txt A priority queue is a queue where each element has a priority and the element with the highest priority is at the front of the queue and will be the first elemen
FIFO-algorithm
- 先入先出队列，这是一种传统的按序执行方法，先进入的指令先完成并引退，跟着才执行第二条指令。是一种先进先出的数据缓存器，他与普通存储器的区别是没有外部读写地址线，这样使用起来非常简单，但缺点就是只能顺序写入数据，顺序的读出数据，其数据地址由内部读写指针自动加1完成，不能像普通存储器那样可以由地址线决定读取或写入某个指定的地址-First-in, first-out queue, which is a traditional sequential execution method, first en
DST_LabManual8
- circular array implementation of q-circular array implementation of queue
Ticket-Sale-of-Airplane-System
- 一个飞机售票系统，用QT平台编译，GUI界面，很不错，用队列完成数据保存和操作。-An airplane ticket system, using QT platform compiler, GUI interface, very good, with complete data retention and queue operations.
main
- simulator for m m k queue . with function for lamda
NVME
- • Queues allocated per core via local memory • IOs submitted on optimal queue for CPU • MSIX vectors mapped to NUMA optimized Queue pair ‘All or Nothing’ optimization, each core gets a queue and a vector or driver reverts to singe queue pair
retrial queues
- In this paper, we reconsider a retrial queue with a number of servers and impatient customers. We improve the computation of the rate matrix, the conditional mean number of customers, the unknowns and the estimation of threshold N , which leads to th
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