期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
资源分配系统禁止状态的避免研究 被引量:1
1
作者 王安荣 段江涛 +1 位作者 李志武 贾建援 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2005年第5期742-747,共6页
基于对有界、被P不变式覆盖且P不变式被初始标记的Petri网的结构分析,提出一种避免资源分配系统禁止状态的方法.该方法首先离线计算出资源分配系统Petri网模型中的死标识、坏标识和危险标识等特殊标识,进而在线保证系统不到达死标识和... 基于对有界、被P不变式覆盖且P不变式被初始标记的Petri网的结构分析,提出一种避免资源分配系统禁止状态的方法.该方法首先离线计算出资源分配系统Petri网模型中的死标识、坏标识和危险标识等特殊标识,进而在线保证系统不到达死标识和坏标识对应的禁止状态.该方法与其他方法相比,它使系统的许可行为最大化且无需计算网系统的整个可达图,更适合比较庞大的资源分配系统. 展开更多
关键词 PETRI网 避免禁止状态 资源分配系统 危险标识
在线阅读 下载PDF
基于Petri网的顺序资源分配系统活性的一个性质
2
作者 岳昊 《计算机科学》 CSCD 北大核心 2011年第4期267-271,共5页
具有多资源需求和柔性加工路径的顺序资源分配系统(Sequential Resource Allocation Systems with MultipleResource Acquisitions and Flexible Routings,C/D-RAS)是一类较复杂的、更为一般的资源分配系统。考察了两个与C/D-RAS密切相... 具有多资源需求和柔性加工路径的顺序资源分配系统(Sequential Resource Allocation Systems with MultipleResource Acquisitions and Flexible Routings,C/D-RAS)是一类较复杂的、更为一般的资源分配系统。考察了两个与C/D-RAS密切相关的活性问题。借助这两个C/D-RAS的Petri网模型来定义标识S3PGR2网对((N1,M01),(N2,M02)),由标识S3PGR2网中资源种类、数量的守恒性和变迁使能的一个充分必要条件,证明(N1,M01)和(N2,M02)的合法变迁发生序列是一致的,据此得出的最终结论是(N1,M01)和(N2,M02)具有相同的活性。最后,简要提及本结论的应用。 展开更多
关键词 PETRI网 资源分配系统 活性
在线阅读 下载PDF
基于构件技术的信息管理系统的设计与实现
3
作者 师忠凯 《现代电子技术》 北大核心 2017年第9期58-60,65,共4页
现有的信息管理系统工作方式较为单一,工作效率低且用户对系统的功能需求度不高。为了解决该问题,设计基于构件技术的信息管理系统。该系统由任务日志处理、登录管理两个前台构件主功能模块和信息资源监控、用户任务管理、信息超负荷管... 现有的信息管理系统工作方式较为单一,工作效率低且用户对系统的功能需求度不高。为了解决该问题,设计基于构件技术的信息管理系统。该系统由任务日志处理、登录管理两个前台构件主功能模块和信息资源监控、用户任务管理、信息超负荷管理三个后台构件主功能模块组成,其中后台构件对前台构件的信息进行接收,完成构件配置,并介绍了五大功能模块的子模块及其工作内容,设计出前台构件的工作原理,并使用JGroups群组通信工具定义后台构件的信息结构标准格式,给出信息管理程序代码,实现了有效的信息管理。实验结果表明,设计的系统资源分配效果好,满足了网络用户对系统功能的高度需求。 展开更多
关键词 构件技术 信息管理系统 JGroups 系统资源分配
在线阅读 下载PDF
Adaptive resource allocation for multi-user multi-server power-line communication OFDM systems
4
作者 徐志强 翟明岳 +1 位作者 崔翔 赵宇明 《Journal of Central South University》 SCIE EI CAS 2011年第2期479-489,共11页
The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (... The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (RT) user,minimal rate for each non-real time (NRT) user,maximal bits and power for each subcarrier in each orthogonal frequency division multiplexing (OFDM) symbol. An algorithm of resource dynamic allocation in the first OFDM symbol of each frame and resource optimal adjustment in the latter OFDM symbol of each frame was proposed. In the first OFDM symbol of every frame,resource is firstly assigned for RT users so as to minimize their total used power until satisfying their fixed rates; secondly the remainder resource of power and subcarriers are assigned for NRT users so as to minimize their total used power until satisfying their minimal rates also; lastly the remainder resource is again assigned for NRT users according to the proportional fairness strategy so as to maximize their total assigning rate. In the latter OFDM symbol of each frame,bits are swapped and power is adjusted for every user based on the resource allocation results of anterior OFDM symbol. The algorithm is tested in the typical power-line channel scenarios and the simulation results indicate that the proposed algorithm has better performances than the classical multi-user resource allocation algorithms and it realizes the multiple aims of multi-user multi-server resource allocation for power-line communication systems. 展开更多
关键词 power-line communications adaptive orthogonal frequency division multiplexing resource allocation user priority swapadjustment
在线阅读 下载PDF
A utility-optimal backoff algorithm for wireless sensor networks
5
作者 廖盛斌 杨宗凯 +1 位作者 程文青 刘威 《Journal of Central South University》 SCIE EI CAS 2009年第4期635-639,共5页
A novel backoff algorithm in CSMA/CA-based medium access control (MAC) protocols for clustered sensor networks was proposed. The algorithm requires that all sensor nodes have the same value of contention window (CW) i... A novel backoff algorithm in CSMA/CA-based medium access control (MAC) protocols for clustered sensor networks was proposed. The algorithm requires that all sensor nodes have the same value of contention window (CW) in a cluster, which is revealed by formulating resource allocation as a network utility maximization problem. Then, by maximizing the total network utility with constrains of minimizing collision probability, the optimal value of CW (Wopt) can be computed according to the number of sensor nodes. The new backoff algorithm uses the common optimal value Wopt and leads to fewer collisions than binary exponential backoff algorithm. The simulation results show that the proposed algorithm outperforms standard 802.11 DCF and S-MAC in average collision times, packet delay, total energy consumption, and system throughput. 展开更多
关键词 wireless sensor networks network utility maximization backoff algorithm collision probability
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部