Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs

A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not too intensive and the path distribution is mainly concentrated on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how large the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity.     

异构多核系统中跨时钟域的解决方法

随着集成电路的集成度与性能的不断发展,芯片的功耗问题已经变的十分严重,功耗带来的挑战日益突出。异构多核动态调频架构是目前研究低功耗的主流方向。SOC系统当中同一时刻只有一个处理器能够控制总线,其它处理器则处理等待状态,异构多核动态调频架构能够通过降低不控制总线的处理器频率来达到降低功耗的目的。异构多核领域的处理器和总线跨时钟域解决方案,此方案在国内属于首次提出,可以运用在异构多核动态调频(DFS)架构当中。目前手持终端设备越来越强调功耗的重要性,因此异构多核领域的处理器和总线跨时钟域解决方案将有非常好的应用前景。该方案通过在处理器和AMBA总线之间添加FIFO以及一些复杂的算法,达到消除亚稳态和正常通信的目的。最终,通过仿真发现任意调节处理器的工作频率都能满足传输协议。证明该方案能在异构多核动态调频架构中运用。     

Logarithmic asymptotics for a single-server processing distinguishable sources

We consider a single-server first-in-first-out queue fed by a finite number of distinct sources of jobs. For a large class of short-range dependent and light-tailed distributed job processes, using functional large deviation techniques we prove a large deviation principle and logarithmic asymptotics for the joint waiting time and queue lengths distribution. We identify the paths that are most likely to lead to the rare events of large waiting times and long queue lengths. A number of examples are presented to illustrate salient features of the results.      

Moment relationships for queues with Poisson input

This paper presents new relationships between the higher-order moments of the FIFO and LIFO disciplines. These relationships hold over a class of queueing models that includeM/G/1 queues with exceptional first service,M/G/1 queues with server vacations, andM/G/1 priority models. The results also generalize to a class of service disciplines that includes FIFO and LIFO as special cases.     

Exact solution of a simple finite infinite source interaction model

Networks of queues with finite and infinite source customers have been used to study the interaction between the batch jobs and interactive jobs in computer systems. Earlier Kaufman ([1], PP-345-348) developed accurate approximations for a simple nonproduct form network of this type. In this paper we offer exact solutions for the same model with one finite source customer. We study both FIFO and LIFO disciplines at the contention node. The results are derived for the case where the finite source think time and service time distributions are generalized hyperexponential.     

Homogeneous Customers Renege from Invisible Queues at Random Times under Deteriorating Waiting Conditions

We consider a memoryless first-come first-served queue in which customers' waiting costs are increasing and convex with time. Hence, customers may opt to renege if service has not commenced after waiting for some time. We assume a homogeneous population of customers and we look for their symmetric Nash equilibrium reneging strategy. Besides the model parameters, customers are aware only, if they are in service or not, and they recall for how long they are have been waiting. They are informed of nothing else. We show that under some assumptions on customers' utility function, Nash equilibrium prescribes reneging after random times. We give a closed form expression for the resulting distribution. In particular, its support is an interval (in which it has a density) and it has at most two atoms (at the edges of the interval). Moreover, this equilibrium is unique. Finally, we indicate a case in which Nash equilibrium prescribes a deterministic reneging time.     

基于Linux的FPGA+ARM高速数据采集系统设计

对于高速A/D的采集,采用I/O读取方式, ARM9最大能够采集500KSPS的A/D,因此ARM不能实现对更高速度数据读取;为达到更高速,提出了FPGA+ARM的双核架构的高速数据采集的方法,FPGA能够采集2MSPS的A/D,并采用ARM的DMA完成与FPGA的FIFO通信,以及使用Linux的内存映射技术来提高应用层与内核层数据传输效率,完成数据采集。该系统设计了FPGA+ARM接口电路,开发了Linux下的DMA驱动程序。经试验测试,系统具有高速采集的性能。     

高速CCD图像数据存储技术

介绍了一种高速CCD图像数据的实时存储方法利用FIFO缓存器使CCD输出的高速数据流和低速存储介质二者的速度匹配,将多路高速大容量图像数据实时记录到了存储介质中,为后期的图像恢复和图像处理提供了原始数据该图像数据存储的方法对各种数据采集以及存储系统的设计具有很好的参考意义.     

Second moment relationships for waiting times in queueing systems with poisson input

For theM/G/1 queue there are well-known and simple relationships among the second moments of waiting time under the first-in-first-out, last-in-first-out, and random-order-of-service disciplines. This paper points out that these relationships hold in considerably more general settings. In particular, it is shown that these relationships hold forM/G/1 queues with exceptional first service,M/G/1 queues with server vacations, andM/G/1 queues with static priorities.     

无人机异步图像数据采集系统设计

针对无人机遥感要求高空间分辨率、高光谱分辨率和高时间分辨率且体积小、重量轻,采用离轴三反消像散光学系统满足其大视场轻量化设计要求.提出各相机异步工作,采用单片现场可编程门阵列(FPGA)实现各异步相机数据整合并以同一参考时钟同步实时输出.介绍了整个异步图像数据采集系统的结构,采用FPGA内部的异步先进先出(first in first out, FIFO)实现两路不同时钟域数据按接收端时钟同步输出,在Xilinx ISE7.1环境下用Modelsim6.1进行了时序仿真,并进行了实际测试.实验结果表明:系统稳定可靠,整个成像系统焦距f=70 mm,相对孔径D/f=1/6,视场角2w=65°.采用两组线阵CCD相机工作,总重量仅6 kg.