检索结果-南通市图书馆

Wireless scheduling algorithms with O（1） Overhead for M-hop Interference Model

在线全文

学校读者我要写书评

暂无评论

Wireless Scheduling Algorithms with O（1） Overhead for M-ho...

Reviews and prospects in satellite range scheduling problem

2008 IEEE International Conference on Communications(ICC 2008)

作者： Yung Yi Mung Chiang the Department of Electrical Engineering Princeton University

We develop a family of distributed wireless scheduling algorithms that requires only O（1） complexity for M-hop interference model,for any finite *** recent technology advances and heterogeneity in wireless networks lead to various interference ***,a scheduling algorithm geared into a specific interference model （typically one-hop or two-hop in literature） may be limited in its *** this paper,we tackle this problem,and develop a family of scheduling algorithms （which guarantees throughput and delay performance） for M-hop interference *** achieve such a goal,we use the concept of vertex augmentation,and for a given M,the family of parameterized algorithms are proposed and the tradeoffs among throughput,complexity,and delay are studied.

关键词： scheduling algorithm Interference Throughput Delay Distributed algorithms Bidirectional control Communications Society Wireless networks Greedy algorithms Physical layer

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Autonomous Intelligent Systems 2023年第1期3卷 19-33页

作者： Shuwei Li Qingyun Yu Hao Ding College of Electronics and Information Engineering Tongji UniversityShanghai201804China ORIGITECH GmbH Langer Anger 7-9Heidelberg69115Germany

With the increasing number of space satellites,the demand for satellite communication(including maneuvering,command uploading and data downloading)has also grown ***,the actual communication resources of ground station are relatively limited,which leads to an oversubscribed *** to make use of limited ground station resources to complete satellite communication requests more fully and efficiently in the strict visible time is the focus of satellite range scheduling *** paper reviews and looks forward to the research on Satellite Range scheduling Problem(SRSP).Firstly,SRSP is defined as the scheduling problem of establishing communication between satellites and ground stations,and the classification and development of SRSP are ***,this paper analyzes three common problem description models,and establishes a mathematical model based on the analysis of optimization objectives and ***,this paper classifies and summarizes the common solving methods of SRSP,and analyzes their characteristics and application ***,combined with the work in this paper,the future research direction of SRSP is envisioned.

关键词： Satellite range scheduling Communication resource scheduling scheduling algorithm Research overview

A scheduling strategy for finite element analysis on the computational grid

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2005年第3期11卷 268-273页

作者： Weng Chuliang（翁楚良） Lu Xinda Yue Ying Department of Conlputer Science and Engineering Shanghai Jiaotong University Shanghai 200030 P.R. China CAD Engineering Center Southwest Jiaotong University Chengdu 610031 P.R. China

The computational grid provides a promising platform for the deployment of various high-performance computing applications. A grid system consists of heterogeneous resource domains, while the computational tasks of finite element analysis may differ in demand of computing power. The cost-effective utilization of resources in the grid can be obtained through scheduling tasks to optimal resource domains. Firstly, a cost-effective scheduling strategy is presented for finite element applications. Secondly, aiming at the conjugate gradient solver stemming from finite element analysis, a performance evaluation formula is presented for determining optimal resouree domains, which is derived from phase parallel model and takes the heterogeneous characteristic of resource domains into account. Finally, experimental results show that the presented formula delivers a good estimation of the actual execution time, and indicate that the presented formula can be used to determine optimal resource domains in the grid environment.

关键词： computational grid scheduling algorithm performance evaluation conjugate gradient method

Exploration on the Load Balancing Technique for Platform of Internet of Things

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Systems Science & Engineering 2021年第9期38卷 339-350页

作者： Donglei Lu Dongjie Zhu Yundong Sun Haiwen Du Xiaofang Li Rongning Qu Yansong Wang Ning Cao Helen Min Zhou School of Artificial Intelligence Wuxi Vocational College of Science and TechnologyWuxi214028China School of Computer Science and Technology Harbin Institute of TechnologyWeihai264209China School of Astronautics Harbin Institute of TechnologyHarbin150001China Department of Mathematics Harbin Institute of TechnologyWeihai264209China School of Engineering Manukau Institute of TechnologyAuckland2241New Zealand

In recent years,the Internet of Things technology has developed rapidly,and smart Internet of Things devices have also been widely popularized.A large amount of data is generated every *** we are in the era of big data in the Internet of *** rapid growth of massive data has brought great challenges to storage technology,which cannot be well coped with by traditional storage *** demand for massive data storage has given birth to cloud storage *** balancing technology plays an important role in improving the performance and resource utilization of cloud storage ***,it is of great practical significance to study how to improve the performance and resource utilization of cloud storage systems through load balancing *** the basis of studying the read strategy of Swift,this article proposes a reread strategy based on load balancing of storage resources to solve the problem of unbalanced read load between interruptions caused by random data copying in *** storage asynchronously tracks the I/O conversion to select the storage with the smallest load for asynchronous *** experimental results indicate that the proposed strategy can achieve a better load balancing state in terms of storage I/O utilization and CPU utilization than the random read strategy index of Swift.

关键词： The Internet of Things cloud storage Swift load balancing scheduling algorithm

Efficient Mechanisms to Improve TCP Performance over OBS Networks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

China Communications 2010年第2期7卷 87-91页

作者： Hong Xiaobin, Zhou Jun, Wu Jian, Guo Hongxiang, Zuo Yong, Xu Kun, Lin Jintong Key Laboratory of Information Photonics and Optical Communications, Ministry of Education Institute of Optical Communications and Optoelectronics, Beijing University of Posts and Telecommunications, Beijing 100876, China Key Laboratory of Information Photonics and Optical Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing 100876 China

Transmission Control Protocol (TCP) performance over Optical Burst Switching (OBS) is experimentally investigated on an OBS network testbed, concluding that burst losses will lead to a significant drop in the available TCP bandwidth. Two mechanisms are introduced to improve TCP performance. One is concerning the burst assembly optimization and another is based on the novel assembly and scheduling mechanism to reduce the burst losses.

关键词： OBS ACK TCP burst loss probability scheduling algorithm

A Simple Method to Solve the Network Congestion for Spitial Architcture

在线全文

学校读者我要写书评

暂无评论

Journal of Shanghai Jiaotong university(Science) 2017年第1期22卷 72-76页

作者：张超喻明艳杨兵 Microelectronic Center Harbin Institute of TechnologyHarbin 150001China

scheduling algorithm always plays an important role in the spatial architecture for the contradiction between the finite network bandwidth and the abundant execution resources. This article provides a simple method to solve the contention for network resource in one of the spatial architecture, i.e. the tera-op, reliable, intelligently adaptive processing system(TRIPS) processor. The method improves the performance of network by increasing the bypass bandwidth which can transmit the data in the internal of every execution unit, and converting the proportion of remote communication by the deep scheduling algorithm. The deeply optimized algorithm is realized to verify the validity of the method, and the performance increase 9% for floating point spec2000 benchmark is got.

关键词： scheduling algorithm spatial architecture processor network contention TP 302.7 A

Utility-Based Joint scheduling Approach Supporting Multiple Services for Co MP-SUMIMO in LTE-A System

在线全文

学校读者我要写书评

暂无评论

ZTE Communications 2015年第1期13卷 60-66页

作者： Borui Ren Gang Liu Bin Hou Beijing University of Posts and Telecommunications

In this paper, we study utilitybased resource allocation for users supporting multiple services in a LTEA system with coordinated multipoint transmission for singleuser multiinput multioutput （CoMPSUMIMO）. We designed Joint Transmission Power Control （JTPC） for the selected clusters for minimizing power consumption in LTEA systems. The objective of JTPC is to calculate the optimal transmission power for each scheduled user and subcarrier. Moreover, based on the convex optimization theory, we propose the dynamic sector selection method in which the average sector throughput and celledge users （UEs） rates are performed to achieve the optimal solution. Simulation results show that the system performance achieved by using the proposed suboptimal algorithm is close to that achieved by the dual decomposition method.

关键词： CoMP-SU-MIMO muhiple services scheduling algorithm

A scheduling Method Of Maintenance Work Based On Dynamic Priority

在线全文

学校读者我要写书评

暂无评论

A Scheduling Method Of Maintenance Work Based On Dynamic Pri...

Exploiting Virtual Elasticity of Production Systems to Respect OTD—Part 3: Basic Considerations for Modelling CPPS Characterized by Non-Ergodic Order Entry and Non-Deterministic Product-Mix for Fully Flexible Addressable Workstations

2010 The 3rd International Conference on Computational Intelligence and Industrial Application (PACIIA2010)

作者： Ying-wu Peng Dept.of Weaponry Engineering Naval University of Engineering WuHan HuBei Province China De-jun Mao Dept.of Weaponry Engineering Naval University of Engineering WuHan HuBei Province China Wei-yi Chen Dept.of Weaponry Engineering Naval University of Engineering WuHan HuBei Province China Rui Wang Dept.of Weaponry Engineering Naval University of Engineering WuHan HuBei Province China

The scheduling problem of maintenance work on the equipment support station influences the support efficiency,especially for a station which repairs a large number of failed items from more than one subordinate operating *** influence of the mean time to repair （MTTR） on system availability was analyzed for maintenance stations,then the factors which determine the maintenance priority of a failed item were modeled,including the demand of the subordinate station,time and maintenance resource to repair the *** a scheduling algorithm of maintenance work on equipment support station based on dynamic maintenance priority was *** algorithm was used in an case,and the result shows that comparing to FIFO （first in,first out） method and resource fitting method,the algorithm improves the support efficiency by much while cutting down the demand for maintenance resources.

关键词： equipment support dynamic priority maintenance scheduling algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

American Journal of Operations Research 2022年第2期12卷 19-63页

作者： Bruno G. Rüttimann Martin T. Stöckli Eidgenö ssische Technische Hochschule Zürich IWF Zurich Switzerland Inspire AG Zurich Switzerland

The recently experienced hype concerning the so-called “4th Industrial Revolution” of production systems has prompted several papers of various subtopics regarding Cyber-Phdysical Production Systems (CPPS). However, important aspects such as the modelling of CPPS to understand the theory regarding the performance of highly non-ergodic and non-deterministic flexible manufacturing systems in terms of Exit Rate (ER), Manufacturing Lead Time (MLT), and On-Time Delivery (OTD) have not yet been examined systematically and even less modeled analytically. To develop the topic, in this paper, the prerequisites for modelling such systems are defined in order to be able to derive an explicit and dedicated production mathematics-based understanding of CPPS and its dynamics: switching from explorative simulation to rational modelling of the manufacturing “physics” led to an own and specific manufacturing theory. The findings have led to enouncing, among others, the Theorem of Non-Ergodicity as well as the Batch Cycle Time Deviation Function giving important insights to model digital twin-based CPPS for complying with the mandatory OTD.

关键词： On-Time-Delivery Production System Industry 4.0 CPPS IoT Stochastic Arrival Rate Non-Ergodic Process Virtual Elasticity Production Capacity Nominal Mean Exit Rate Theorem of Non-Ergodicity Non-Deterministic Product-Mix TFL AGV scheduling algorithm Digital Twin