检索结果-内蒙古大学图书馆

4th International Conference on Manufacturing Science and Engineering (ICMSE 2013)

作者： Fu, Chunyan Zhou, Hong Ge, Maosong Qu, Xiao Wang, Yongli JiaMuSi Univ Coll Informat Sci & Elect Technol Jiamusi 154007 Peoples R China Nanjing Univ Sci & Technol Dept Comp Sci & Engn Nanjing 210094 Jiangsu Peoples R China

ISBN: (纸本)9783037856932

In this paper, we extend and rewrite MapReduce dispatcher and its quasi-real-time schedule algorithm to support operation scheduling in time-limited. MapReduce dispatcher has an evaluation of completion time of tasks in dependence of rate of progress of tasks at hand, and allocated resource dynamically to every task when they are running. Experimental investigation shows that, the algorithm increase the resource utilization of the MapReduce system, and the goals of quasi-real-time MapReduce schedule has been achieved.

关键词： MapReduce Scheduling policy schedule algorithm Priority

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Task schedule algorithm for Real-time System employing Trusted Computing Technology 10

A Hybrid Task Schedule Algorithm for Real-time System employ...

引用

10th International Conference on Computational Intelligence and Security CIS 2014

作者： Jiang, TingYu Li, YaHui Dong, Yuan Tsinghua Univ Dept Comp Sci & Technol Aeronaut Comp Tech Res Inst Xian 710068 Peoples R China Aeronaut Comp Tech Res Inst Xian 710068 Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China

ISBN: (纸本)9781479974344

Security has been a serious concern in more and more embedded systems. But restricted by the constrained resources in embedded system, security may damage the system real-time performance, we refer to this challenge as the "security real-time gap". To bridge this gap, trusted computing technology can be a good candidate, however, researches focusing on real-time performance in embedded systems employing trusted computing is still blank. In this paper, we investigate the dynamic scheduling of hybrid tasks with trusted computing constraint, and present a hybrid tasks model to describe the tasks which need trusted computing resources and a strategy to manage the trusted requests. Furthermore, an advanced dynamic hybrid task schedule algorithm based on total bandwidth server (TBS) algorithm is presented in this paper, used for enhancing responsiveness performance of aperiodic tasks. In the evaluation by simulation, the proposed method reduced average response times of the aperiodic task by up to 30.4%.

关键词： hybrid tasks trusted computing real-time trusted-software-stack schedule algorithm

来源：评论

学校读者我要写书评

暂无评论

High-effective dynamical schedule algorithm for wireless broadcast

High-effective dynamical schedule algorithm for wireless bro...

引用

9th International Conference on Advanced Communication Technology (ICACT 2007)

作者： Lin, Shih Yang Wu, Lin Yu Wu, Guang-Ming Ko, Ren-Song Department of Information Mangement Nanhua University Taiwan Dept of CSIE National Chung-Cheng University Taiwan

ISBN: (纸本)9788955191318

In the pull-based wireless network, clients request data items from a server. In order to solve cold and hot data and reduces clients' waiting timer, server considers the hit rate of data items and waiting time of requests for broadcasting. The hit rate of data items and the waiting time of requests always changed along with time elapsed. Therefore, server has to calculate overall weight value of data items and decides maximum weight value of data items before broadcasting. In order to increase performance of server, we propose an effective dynamically schedule algorithm (EDSA) for wireless broadcast. The EDSA uses weight value of data items and maintains them in a maximum heap tree for quickly broadcasting. Furthermore, we present a indexing for accessing a data item's information faster. The experiment results showed that our method has more effectively than a generally algorithm in the dynamic wireless environment. However, it is still have some problems about our EDSA, therefore we propose an Improve-EDSA to correct the problems.

关键词： schedule algorithm index heap tree

来源：评论

学校读者我要写书评

暂无评论

Flimm: Foreground traffic aware data migration manager for distributed storage system

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2024年 160卷 140-153页

作者： Li, Bowen Dong, Xiaoshe Mi, Jue Wang, Yufei Wang, Longxiang Chen, Weiduo Xi An Jiao Tong Univ Sch Comp Sci & Technol 28 Xianning West Rd Xian Peoples R China State Grid Shaanxi Elect Power Co Informat & Commun Co Xian Peoples R China

Currently, decentralized distributed storage system is widely used in various scenarios, because decentralized data placement algorithms observably improve scalability and robustness of distributed storage system. However, storage system applied with decentralized data placement algorithm suffers from uncontrollable data migration during expanding the clusters, which lead to dramatic fluctuation of performance. To maintain reliability and stability of storage system, administrators are under great pressure to migrate data during expansion or contraction. Not only the urgent time constraints to expansion but also low interference to foreground application are required during data migration period. It is a difficult challenge for in-experienced administrators to tackle. To address this challenge, this paper introduces Flimm, a fast and low-interference data migration manager that is aware of storage resource utilization and performs data migration with low interference to foreground applications. Flimm mitigates interference by scheduling a subset of migration tasks with careful consideration. Moreover, Flimm adapts to varying foreground application workloads through adaptive migration speed control, providing administrators with convenient and secure parameters for tuning. In our experiments, Flimm demonstrated a 1.2x acceleration in migration speed and achieved a 20% reduction in interference.

关键词： Distributed storage system Data migration schedule algorithm Interference model Portable system

来源：评论

学校读者我要写书评

暂无评论

Race to idle or not: balancing the memory sleep time with DVS for energy minimization

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2018年第3期35卷 860-894页

作者： Fu, Chenchen Chau, Vincent Li, Minming Xue, Chun Jason City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China Shenzhen Inst Adv Technol Shenzhen Peoples R China

Reducing energy consumption is a critical problem in most of the computing systems today. Among all the computing system components, processor and memory are two significant energy consumers. Dynamic voltage scaling is typically applied to reduce processor energy while sleep mode is usually injected to trim memory's leakage energy. However, in the memory architecture with multiple cores sharing memory, in order to optimize the system-wide energy, these two classic techniques are difficult to be directly combined due to the complicated interactions. In this work, we explore the coordination of the multiple cores and the memory, and present systematic analysis for minimizing the system-wide energy based on different system models and task models. For tasks with common release time, optimal schemes are presented for the systems both with and without considering the static power of the cores. For agreeable deadline tasks, different dynamic programming-based optimal solutions are proposed for negligible and non-negligible static power of cores. For the general task model, this paper proposes a heuristic online algorithm. Furthermore, the scheme is extended to handle the problem when the transition overhead between the active and sleep modes is considered. The optimality of the proposed schemes for common release time and agreeable deadline tasks are proved. The validity of the proposed heuristic scheme is evaluated through experiments. Experimental results confirm the superiority of the heuristic scheme in terms of the energy saving improvement compared to the most related existing work.

关键词： schedule algorithm Multi-core processor Dynamic voltage scaling (DVS) Energy efficiency Main memory

来源：评论

学校读者我要写书评

暂无评论

LT-MAC: A Location-based TDMA MAC Protocol for Small-scale Underwater Sensor Networks 5

LT-MAC: A Location-based TDMA MAC Protocol for Small-scale U...

引用

IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (CYBER)

作者： Mao, Jia Chen, Shumin Liu, Yangxi Yu, Juntao Xu, Yuanxin Zhejiang Univ Inst Informat & Commun Engn Hangzhou Zhejiang Peoples R China Zhejiang Sci Tech Univ Fac Informat & Elect Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9781479987306

Because of the high attenuation, sound is mainly used as the communication medium in underwater sensor networks instead of light or microwave. MAC protocols designed for radio networks aren't suitable for acoustic channels which feature long propagation delay and limited bandwidth. In this paper, we propose a location-based MAC protocol, called LT-MAC. LT-MAC dynamically determines each node's sending time according to the variable offered load, and assigns the time slot to each node based on the minimum waiting time rule. In addition, the protocol combines sending and acknowledgement to overcome low throughput and long end-to-end delay problems. By theoretical analysis and simulation, we show that LT-MAC is a comparatively good solution for single-hop and small-scale underwater sensor networks.

关键词： Under-Water Acoustic Sensor Networks (UW-ASNs) MAC Protocol schedule algorithm Time Division Multiple Access (TDMA) Network Simulation

来源：评论

学校读者我要写书评

暂无评论

Migration between software and hardware task on preemptive multitasking CPU/FPGA hybrid architecture

Migration between software and hardware task on preemptive m...

引用

14th IEEE International Conference on High Performance Computing and Communications (HPCC) / IEEE 9th International Conference on Embedded Software and Systems (ICESS)

作者： Xun Wang Feng, Degui Chen Tian-zhou Hu Tong-sen Zhejiang Univ Technol Coll Comp Sci Hangzhou 310027 Zhejiang Peoples R China

ISBN: (纸本)9780769547497

As the CPU/FPGA hybrid architecture becomes one of the most important forms, the research of the schedule on hybrid tasks is a hot-spot. The schedule approaches of hybrid tasks can be classified into two categories. One is about non-preemptive multitasking, the other is preemptive multitasking. For the second one, as it requires architecture support, the existing researches are fewer. This paper presents an architecture which supports preemptive multitasking, an algorithm to select the appropriate migration point and a new schedule algorithm based migration and also introduces naming service to deal with communication problems after tasks migrated. Experimental results show that the algorithm based migration increases acceptance rate for hardware tasks to 12.94%. The architecture proposed can support the preempting well, and improve the performance.

关键词： preemptive migration point schedule algorithm

来源：评论

学校读者我要写书评

暂无评论

Research of On-board Optical/Electric Switching of Broadband Multimedia Satellite

Research of On-board Optical/Electric Switching of Broadband...

引用

4th IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN)

作者： Li Rui-xin Zhao Shang-hong Yao Zhoushi Zheng Wei Li Yong-jun Qian Yuan AFEU Telecommun Engn Inst Xian 710077 Shanxi Peoples R China Xian Inst Radio Technol AH-71000 Xian Peoples R China

ISBN: (纸本)9781849195072

On-board switching has been the development trend of satellite communication. There is electronic bottleneck in the development of on-board ATM switch, so the optical switch is the inevitable direction of future broadband multimedia satellite. The paper brings forward a scheme about on-board mixed optical/electronic switching of GEO, analyses the switching mode of the scheme, discusses the key techniques.

关键词： on-board optical switch optical burst switch data burst packet schedule algorithm assembly algorithm

来源：评论

学校读者我要写书评

暂无评论

A Kind of Function Block Application Model for Distributed Intelligent Control Network Based on WorldFIP

A Kind of Function Block Application Model for Distributed I...

引用

20th Chinese Control and Decision Conference

作者： Liang, Geng N China Elect Power Univ Automat Dept Beijing 102206 Peoples R China

ISBN: (纸本)9781424417339

Products and systems developed based on WorldFIP technology are all above control level. No fully distributed intelligent control system based on field intelligent nodes is implemented. Function Block Application (FBA) is the kernel part in implementation of distributed intelligent control network. Concept of user layer is not proposed in WorldFIP communication model and the specification of user layer is not presented so far. Based on independently developed WorldFIP distributed intelligent control network developed, a practical and general-purposed FBA model is proposed. Data storage segmentation model orienting field intelligent nodes are expounded in detail. Concept of user layer in WorldFIP communication model is proposed and data model for user layer is defined. The schedule algorithms for the proposed FBA model are presented in detail. Guided by the proposed FBA model, design and implementation of distributed intelligent system based on Function Block and FBA was achieved. The proposed FBA model is easy in implementation and with good real time property, good real-time property in control and transplantability. Operational practice of the distributed intelligent control network shows effectiveness of the proposed model.

关键词： WorldFIP fieldbus Function Block Application schedule algorithm network intelligent node

来源：评论

学校读者我要写书评

暂无评论

A Scheduling algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2009年第unknown期2009卷 804621-804621页

作者： Toyserkani, Arash T. Rydstrom, Mats Strom, Erik G. Svensson, Arne Chalmers Univ Technol Dept Signals & Syst S-41296 Gothenburg Sweden

We consider clustered wireless networks, where transceivers in a cluster use a time-slotted mechanism (TDMA) to access a wireless channel that is shared among several clusters. An approximate expression for the packet-loss probability is derived for networks with one or more mutually interfering clusters in Rayleigh fading environments, and the approximation is shown to be good for relevant scenarios. We then present a scheduling algorithm, based on Lagrangian duality, that exploits the derived packet-loss model in an attempt to minimize the average packet-loss probability in the network. Computer simulations of the proposed scheduling algorithm show that a significant increase in network throughput can be achieved compared to uncoordinated scheduling. Empirical trials also indicate that the proposed optimization algorithm almost always converges to an optimal schedule with a reasonable number of iterations. Thus, the proposed algorithm can also be used for bench-marking suboptimal scheduling algorithms. Copyright (C) 2009 Arash T. Toyserkani et al.

关键词： Medium Access Control Cluster Head schedule algorithm Dual Variable Network Throughput

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：