Location:
Search - queue
Search list
Description: 这是一个关于用消息队列进行通信的小程序源码，makefile是在sco下的，如果在linux下可能要加socket的链接库-This is a message queue on the use of small communications procedures source, makefile in the sco, if under Linux may have to increase the socket libraries
Platform: |
Size: 1747 |
Author: tch |
Hits:
Description: 该代码采用c5400dsp的汇编语言和c语言实现ucos操作系统，并在操作系统之上实现一个消息队列，实现消息的发送于接收。-c5400dsp of assembly language and c CENTER language operating system and the operating system is implemented on top of a message queue, to achieve the sender to receiver.
Platform: |
Size: 117106 |
Author: 杨健 |
Hits:
Description: 进程之间以时间片为单位，进行唤醒，调用，当时间片到后，进程就进入等待队列，而且是按优先级进行调用。-processes with time-unit, awakened, called when time-to the post, the process would enter the waiting queue, but is carried out according to priority calls.
Platform: |
Size: 24065 |
Author: 马难 |
Hits:
Description: WINSOCK程序设计共分为客户端和服务器端程序两部分，要求实现功能：服务器端要能监听客户端连接请求，为客户端的连接请求建立SOCKET队列，处理各个客户端发送的数据，并向响应客户端发送应答信息，更新服务器端的端口号。-Winsock program design consists of client and server-side procedures in two parts, requires the function : server can be monitored to client requests for the client to establish a link SOCKET queue handle all the client to send data to respond to a client sent response information update service Works on the port side.
Platform: |
Size: 45163 |
Author: 和平鸽 |
Hits:
Description: 问题描述： 假设一个商店，它有一个货架和一个仓库，当货架上的商品数量少于一定的数目时，从仓库运一定数量的商品摆到货架上，当仓库里的商品的数量少于一定的数目时，购买商品把仓库填满，商品的出售要按照商品的生产日期来，快要过期的商品要先出售。 解决问题的方法： 用了两个栈和 一个队列，把队列当作仓库，用一个栈作为货架，把另一个栈当作临时的存储箱。当要往货架上添商品时，先把作为货架的栈中的元素全都压到作为存储箱的栈中，再把仓库中的元素压到存储箱中，然后再把存储箱中的所有元素都压到货架上，这样，就能保证快要过期的商品先被出售。-Problem description : Suppose a shop, which has a shelf and a warehouse, when the merchandise on the shelves less than a certain quantity of the number, a certain number from the warehouses of goods on the shelves, when the warehouse volume of goods is less than certain number, purchase goods warehouse filled, the goods according to the sale of commodity production to date, is about to expire first sale of goods. The solution : a two stack and a queue, queue as a warehouse, used as a stack shelves, and another stack as a temporary storage bins. When to go to the shelves Tim commodity, first as a stack shelves of all elements of the pressure storage tank as the stack, then the warehouse down to the storage element box, and then storage box has all the elements of the pressure arrived shelve
Platform: |
Size: 2328 |
Author: 曾德胜 |
Hits:
Description: 基于队列中挂起的任务数自动调整线程数，使用策略来提供灵活性和可扩展性-It can auto-adjust threads basing on queue-hanging up,which also use strategies for flexiblility and extensibility.
Platform: |
Size: 4146 |
Author: 李文 |
Hits:
Description: 通过内存文件映象实现了一个FIFO消息队列，可以工作在所有的windows版本中-a FIFO message queue with memory map,compatible all windows version.
Platform: |
Size: 113086 |
Author: 李文 |
Hits:
Description: psos调用实例，包括了任务创建，队列，分区，多播等的使用-PsOS Call example, including the creation of a task, queue, zoning, such as multicast use
Platform: |
Size: 20486 |
Author: aa |
Hits:
Description: 通信网理论，排队论基础，包括单服务台以及多服务台排队-telecommunication network theory
concept of queue theory
include 1 server and N server
Platform: |
Size: 237974 |
Author: 老板 |
Hits:
Description: 程序用C++模拟了操作系统中的三种最典型的简单的静态进程调度算法；先由用户动态输入生成模拟进程，使用了26种可供用户选择的典型语句（包括循环、选择结构），可处理整型、布尔型与字符型三种数据与表达式计算；程序编制时主要采用的编程技术是：用语句链表记录进程语句，并用PCB链表,就绪队列链表,阻塞队列链表,执行队列链表,结束队列链表等数据表示进程处理过程中的相互关系，由于静态数据结构不适合处理数据量大小不定的数据，而动态队列结构适合于处理数据量大小可变数据的处理，因此在程序中采用动态链表对这些数据进行处理；使用信号量、P.V.操作实现进程的同步与互斥，模拟进程在操作系统中的运行-procedures C to simulate the operating system, the three most typical process simple static scheduling algorithm; First generation user input dynamic modeling process, the use of the 26 options are available to users of typical statement (including the circle, choose structure), can handle integer, boolean and three character expression data and calculation; the main procedures for the preparation of the programming technology : Listless statement recorded statement process, and PCB Chain, ready Queue List, blocking Queue List, the Executive Queue List, ending Queue List data processing, said the process of mutual relations, due to static state data structure is not suitable for handling data on the size of the volatile data, and dynamic queue structure suitable for data processing variabl
Platform: |
Size: 31045 |
Author: 石大浪 |
Hits:
Description: public class Server extends Thread { Client client int counter public Server(Client _client) { this.client = _client this.counter = 0 } public void run() { while (counter < 10) { this.client.queue.addElement(new Integer(counter)) counter++ } throw new RuntimeException(\"counter >= 10\") } public static void main(String[] args) { Client c = new Client() Server s = new Server(c) c.start() s.start() } } class Client extends Thread { Vector queue public Client() { this.queue = new Vector() } public void run() { while (true) { if (! (queue.size() == 0)) { processNextElement() } } } private void processNextElement() { Object next = queue.elementAt(0) queue.removeElementAt(0) System.out.println(next)-public class Server extends Thread { Client client int counter public Server(Client _client) { this.client = _client this.counter = 0 } public void run() { while (counter lt; 10) { this.client.queue.addElement(new Integer(counter)) counter++ } throw new RuntimeException(\"counter gt;= 10\") } public static void main(String[] args) { Client c = new Client() Server s = new Server(c) c.start() s.start() } } class Client extends Thread { Vector queue public Client() { this.queue = new Vector() } public void run() { while (true) { if (! (queue.size() == 0)) { processNextElement() } } } private void processNextElement() { Obje
Platform: |
Size: 1105 |
Author: 阿乌鸟 |
Hits:
Description: ex4.14 图元识别问题« 问题描述：在数字化图像处理中常将一幅图像表示为一个m´ m 的像素矩阵。其中每个像素的值为0或1。值为0的像素表示图像的背景，而值为1 的像素表示图像中某个图元上的一个点，通常称其为图元像素。当一个像素在另一个像素的上方、下方、左侧或右侧时，称这2个像素为相邻像素。一幅图像中的相邻像素属于同一图元，而不相邻的像素属于不同图元。图元识别问题就是对给定图像的图元像素进行标记，使得同一图元的图元像素有相同的标记，而不同图元的图元像素其标记也不同。试用抽象数据类型队列设计解图元识别问题的算法，并分析算法的计算复杂性。« 数据输入：由文件input.txt给出输入数据。第一行有1 个正整数m，表示给定m´ m的像素矩阵。接下来的m行中，每行m个数，表示m个像素，值为0 的像素表示图像的背景，而值为1的像素表示图像中某个图元上的一个点。« 结果输出:将计算出的不同图元的个数输出到文件output.txt。输入文件示例 输出文件示例input.txt output.txt70 0 1 0 0 0 00 0 1 1 0 0 00 0 0 0 1 0 00 0 0 1 1 0 01 0 0 0 1 0 01 1 1 0 0 0 01 1 1 0 0 0 03-ex4.14 map identification laquo yuan; Problem description : the digital image processing of an image often expressed as a macute; M pixel matrix. Each pixel value is 0 or 1. The value of 0 pixel image, said background, and the value of a pixel image, said a map of a million, usually called map million pixels. When a pixel in another pixels above, below, left or right, said that two adjacent pixels of the pixel. An image of the pixels belonging to the same map yuan, instead of adjacent pixels belonging to different map yuan. Figure yuan identification of problems is right for the given image pixel map marking yuan, making the same map billion yuan pixel map of the same markings and different map billion yuan pixel map of their marks are different. Trial queue abstract data type design solut
Platform: |
Size: 58735 |
Author: 林天 |
Hits:
Description: VC++ 封装了队列类 /// /// /// ///// //this a example for using Queue ///////////////////////////////////////// #include \"Queue.h\" //define queue data struct struct QueueData { char data[20] int nId } //define queue typedef TQueue<QueueData> TMyQueue //put data into queue { QueueData data memset(&data, 0, sizeof(data)) strcpy(data.data, \"hello!\") data.nId = 0 m_pMyQueue.TryPut(data) } //try put data into queue { QueueData data memset(&data, 0, sizeof(data)) strcpy(data.data, \"hello!\") data.nId = 0 if(m_pMyQueue.TryPut(data) != 0) { MessageBox(\"put queue error\") } else { MessageBox(\"put queue success\") } } //get data from queue { QueueData data memset(&data, 0, sizeof(data)) m_pMyQueue.Get(data) MessageBox(data.data) } //try get data from queue { QueueData data memset(&data, 0, sizeof(data)) m_pMyQueue.TryGet(data) MessageBox(data.data) }-cohort of VC Packaging category ///////////////////////////////////////// / / this is a example for using Queue ///////////////////////////////////////// # include "Queue . h "/ / define queue data struct QueueData struct (char data [20] int nId) / / define queue typedef TQueuelt; QueueDatagt; TMyQueue / / put data into QueueData data queue (memset (data, 0, sizeof (data)) htpasswd (data.data, "hello!") data.nId m_pMyQueue.TryPut = 0 (data)) / / try put data into QueueData data queue (memset (data, 0, sizeof (data)) htpasswd (data. data, "hello!") data.nId = 0 if (m_pMyQueue.TryPut (data)! = 0) (MessageBox ( "put queue error")) else (MessageBox ( "put queue success"))) / / get data from QueueData data queue (memset (data, 0, sizeof (data))
Platform: |
Size: 34517 |
Author: zj |
Hits:
Description: 利用栈和队列实现停车场的管理，包括车的进出及计费。-use stack and queue to achieve the management of car parks, including vehicle access and billing.
Platform: |
Size: 2260 |
Author: cuckoo |
Hits:
Description: 基本算法思想 OPT：该算法的基本思想是用二维数组page2[40][2] 的第一列存储装入内存的页面，而第二列用作标记位计数器。每当发生缺页时，就从内存中调出一页，首先将内存中的页面一一与要调入内存中的页面之后的页面比较，如果两个页面不相等，则内存中相应的页面的标记位计数器加一，直至到有相等的页面，则该页面的比较停止，再重复以上操作，直至内存中的页面全部比较完。然后找出内存中页面的标记位最大的页面，而该页就是要置换出来的页。 FIFO: 该算法的基本思想是用队列queue存储内存中的页面，队列的特点是先进先出，与该算法是一致的，所以每当发生缺页时，就从队头删除一页，即队头指针加一，而从队尾加入缺页，队尾指针加一。 LRU: 该算法的基本思想是用二维数组page2[40][2] 的第一列存储装入内存的页面，而第二列用作标记位计数器。每当使用页面时，该页面的标记位计数器加一。发生缺页时，就从内存中页面标记最小的一页，调出该页，并且该页后面的页面在数组中的位置前移，而缺页就放在数组后面。-basic algorithm thinking OPT : The basic idea of the algorithm is a two-dimensional array page2 [40] [2], the first storage pages loaded into memory, and the second for the markers out counter. Whenever there are missing pages, from memory a redeployment, the first memory pages on January 1 and transferred to the memory page after page, two pages, if not equal, then the corresponding memory pages marked increase a bit counter, until the equivalent of a page, the page more stop and then to repeat the operation, until the memory of all the pages compared End. Then find memory pages marking the largest-page, the page is to the replacement page. FIFO : The basic idea of the algorithm is used queue queue storage memory pages, and the queue is FIFO features, and the algorithm is the same, so whe
Platform: |
Size: 26423 |
Author: 何泽荣 |
Hits:
Description: unix/linux环境下，对消息队列操作，参数的设置，经过严格检验的函数版本-unix / linux environment, the right message queue operation, parameter settings after the test function version
Platform: |
Size: 1057 |
Author: 吴友生 |
Hits:
Description: 在本次设计中，通过对新乡市自学考试和考生信息管理方式的调查，利用ASP、Dreamweaver、Fireworks等网站开发软件创建了新乡市自学考试网站，实现了网上报考、成绩和座号查询的功能。 新乡市自学考试网站开通的网上报考是自学考试报名方式的一项重大改革，也是新乡市自学考试网站的关键技术和难点。网上报考系统使考生省去了来回奔波、到现场排队填写报名卡等手续，它充分发挥网络的优势，使考生的报考时间更充裕，网上报考比社会报名点更早开始，更迟截止。无论考生身在何处都可以轻松报考，完全没有时空的限制。当考生在报考期间内想修改在线报考的结果， 随时重新登陆系统，即可以重新选择报考的科目，提高了信息采集的及时性、准确性。自学考试网站方便了考生的报考、查询，了解自学考试政策、自学考试办公室最新通知，便于自学考试政策的执行。 自学考试网站的创建使新乡市的自学考试管理方式又上升了一个层次，适应了社会发展的需求。-in the design, Xinxiang City of self-examination and information management candidates to the survey, the use of ASP, Dreamweaver, Fireworks such as web site development and software to create a self-examination of Xinxiang City website, sit through the Internet, achievements and seat inquiry functions. Self-examination of Xinxiang City website launched on the Internet is self-sit the examination form of a major reform, as well as self-examination Xinxiang City website the key technical and difficult. Online system allows candidates to sit eliminating the back and forth, to the scene to fill in the queue card application procedures, give full play to the advantages of network, so that the candidates took time more abundant than sit online community for points earlier, it began later than t
Platform: |
Size: 2314175 |
Author: 啊啊 |
Hits:
Description: 用java实现数据结构中的栈和队列，是一个applet程序，可以通过实际操作来演示数据结构的栈的具体实现方式。-Realize the stack and queue in the structure of the data with java. It s a applet programe which can demonstrate realizing the way concretly of the stack of the structure of the data through practical operation .
Platform: |
Size: 18343 |
Author: 吴强 |
Hits:
Description: 用java实现数据结构中的栈和队列，是一个applet程序，可以通过实际操作来演示数据结构的栈的具体实现方式。-An applet program, use java to achieve stack and queue in data structure. It can be used to demonstrate the implement of the stack.
Platform: |
Size: 10636 |
Author: 吴强 |
Hits:
Description: 用java实现数据结构中的栈和队列，是一个applet程序，可以通过实际操作来演示数据结构的栈的具体实现方式。-An applet program, which use java to implement the stack and queue data structure. It can be used to demonstrate the implement of stack.
Platform: |
Size: 5807 |
Author: 吴强 |
Hits:
«
1
2
...
45
46
47
48
49
50»