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

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING 2025年第1期10卷 57-69页

作者： Makanda, Kondwani Hawbani, Ammar Wang, Xingfu Naji, Abdulbary Al-Dubai, Ahmed Zhao, Liang Alsamhi, Saeed Hamood Univ Sci & Technol China Sch Comp Sci & Technol Hefei 230026 Peoples R China Shenyang Aerosp Univ Sch Comp Sci Shenyang 110136 Peoples R China Edinburgh Napier Univ Comp Sch Edinburgh EH10 5DT Scotland Univ Galway Insight Ctr Data Analyt Galway H91 TK33 Ireland IBB Univ Fac Engn Ibb Yemen

Wireless Sensor Networks (WSNs) are used to sense and monitor physical conditions in various services and applications. However, there are a number of challenges in deploying WSNs, especially those pertaining to energy replenishment. Using the current solutions, when a significant number of sensors need to replenish their energy, this would be costly in terms of time, efforts and resources. Thus, this paper aims to solve this problem by efficiently deploying wireless power transfer technologies and scheduling Mobile Charging Vehicles (MCVs) in WRSN. The proposed method deploys multi-criteria decision-making (i.e., Analytical Hierarchy Process (AHP)) to schedule the charging tasks. To the best of our knowledge, this paper is the first to depend solely on AHP in MCVs scheduling. The paper demonstrates the validity of the proposed method by illustrating that the matrices that are created are within the accepted values of consistency ratio. In addition, the paper proposes a method of partitioning the values of our criteria to avoid the problem of different criteria having different measurement units. Unlike existing works, the paper aims to schedule an MCV for charging based on both the distance and residual energy of the sensor. The proposed method exhibits superiority in terms of the average remaining energy available in the system, having the shortest queue length, shorter MCV response time, shorter charging duration, and shorter queue waiting time against the state-of-the-art methods. Our study paves the way for next generation efficient charging and MCV scheduling.

关键词： Wireless sensor networks Batteries Green computing Wireless power transfer Schedules Dynamic scheduling Complexity theory Multi-criteria decision-making analytic hierarchy process pairwise comparison matrix scheduling scheme wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

An enhanced parallel loop self-scheduling scheme for cluster environments

引用

JOURNAL OF SUPERCOMPUTING 2005年第3期34卷 315-335页

作者： Yang, CT Cheng, KW Li, KC Tunghai Univ Dept Comp Sci & Informat Engn High Performance Comp Lab Taichung 40704 Taiwan Providence Univ Dept Comp Sci & Informat Management Parallel & Distributed Proc Ctr Taichung 43301 Taiwan

Approaches for dealing with scheduling and load-balancing in PC-based cluster systems are famous and well known. In such environments, Self-scheduling schemes are suitable for parallel loops with independent iterations. However, while schemes such as FSS, GSS, and TSS fit most computer systems, they cannot provide good load-balancing. Chao-Tung Yang and Shun-Chi Chang proposed a parallel loop scheduling scheme for heterogeneous PC cluster systems in Yang and Chang [13]. Though the proposed scheme allows users to choose parameters before execution initialization, weaknesses in it motivated us to develop further improvements. For instance, using fixed and monotonous parameters can easily lead to invalid scheduling due to use of previously input information. Thus, in this paper we propose a new scheme that fits most widely available computer systems and allows the scheduling parameter to be adjusted dynamically in order to provide higher overall performance.

关键词： self-scheduling scheduling scheme parallel loops PC clusters cluster computing

来源：评论

学校读者我要写书评

暂无评论

An efficient scheduling scheme for assigning transmission opportunity in QoS-guaranteed wireless LAN

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2008年第7期E91A卷 1562-1569页

作者： Tagashira, Shigeaki Yamane, Masahiro Fujita, Satoshi Kyushu Univ Grad Sch Informat Sci & Elect Engn Fukuoka 8190395 Japan Hiroshima Univ Grad Sch Engn Higashihiroshima 7398527 Japan

The IEEE 802.11e standard defines several important techniques that guarantee the quality of service (QoS) of multimedia communications in wireless LAN applications. A key technique introduced in the standard is an efficient media access control based on the Hybrid Coordination Function (HCF), which assigns an appropriate transmission opportunity (TXOP) to each flow for satisfying several requirements on the flow, such as delay bound and communication bandwidth. Although the simple scheduler designed in HCF could provide an efficient tool to guarantee the QoS in wireless LAN applications, it has a serious drawback, wherein a useless bandwidth assignment frequently occurs. Such assignments occur primarily due to a limitation of the scheme, wherein all the flows share the same service interval (SI). In this paper, we propose a new scheduling scheme that associates each flow with its own SI according to the hardness of the required SI. The effect of this approach is experimentally evaluated by simulation, the results of which indicate that the number of admitted flows and network resource utilization increase due to the proposed scheme.

关键词： QoS IEEE 802.11e scheduling scheme transmission opportunity

来源：评论

学校读者我要写书评

暂无评论

Towards an efficient static scheduling scheme for delivering queries to heterogeneous clusters in the similarity search problem

引用

JOURNAL OF SUPERCOMPUTING 2014年第2期70卷 527-540页

作者： Uribe-Paredes, Roberto Cazorla, Diego Arias, Enrique Sanchez, Jose L. Univ Magallanes Dept Comp Engn Punta Arenas 01855 Chile Univ Castilla La Mancha Comp Syst Dept Albacete Spain

Medium and large clusters incorporating hybrid CPU/graphics processing unit (GPU) nodes are present in many datacenters today. They can accelerate many different kinds of applications and appropriately manage applications dealing with a high volume of data. This is the case of the similarity problem because large databases are managed and very quick responses are required to hundreds or thousands of queries per second. However, the design and usage of heterogeneous computing platforms poses big challenges as system size, energy saving, task mapping, scheduling, among others, must be efficiently handled. In this paper we focus on the scheduling issue for distributing the incoming queries to all the processing components in the cluster nodes. Our algorithms exploit the computational resources, simultaneously processing queries on CPU cores and on the GPUs. Thus, we address the problem of how to distribute the queries over the whole system in order to obtain the best performance, under the assumption of defining a heuristic that automatically provides the best distribution. Experimental results show the benefits in terms of execution time and energy saving of using an appropriate scheduling scheme.

关键词： Similarity search Metric spaces Range queries GPU platforms Multicore platforms scheduling scheme

来源：评论

学校读者我要写书评

暂无评论

A Channel-Aware scheduling scheme for (m,k)-Firm Streams in Wireless Multimedia Sensor Networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第10期E95B卷 3312-3315页

作者： Zhao, Changxiao Xiong, Huagang Beihang Univ Elect & Informat Engn Dept Beijing Peoples R China

In this letter, we propose a channel-aware scheduling algorithm to support real-time applications in wireless multimedia sensor networks. Multimedia streams are sensitive to real-time delivery but can tolerate some packet loss. Therefore, this specific application is modelled as an (m,k)-firm stream. To satisfy the real-time requirements, a scheduling scheme that provides packet partitioning and real-time delivery is proposed. Packet partitioning combines static assignment and dynamic adjustment while considering the channel state. The scheme is designed to minimize the number of mandatory packets delivered in a bad channel state to avoid dynamic failure. In addition, automatic repeat request technology is introduced to enhance the reliability of real-time delivery. Simulations and analyses show that the proposed scheme has a good ability to withstand a bad channel status.

关键词： (m, k)-firm stream real-time scheduling scheme

来源：评论

学校读者我要写书评

暂无评论

A High-Utilization scheduling scheme of Stream Programs on Clustered VLIW Stream Architectures

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2014年第4期25卷 840-850页

作者： Jiang, Guoyue Li, Zhaolin Wang, Fang Wei, Shaojun Tsinghua Univ Inst Microelect Beijing 100084 Peoples R China Tsinghua Univ Res Inst Informat Technol Beijing 100084 Peoples R China

Stream architectures have emerged as a mainstream solution for computation-intensive applications due to their rich arithmetic units. This paper proposes a multithreading technique based on a scheduling scheme of stream programs on clustered VLIW stream architecture, which aims at optimal arithmetic unit utilization without increasing energy consumption. Its principle is to exploit more kernel-level parallelism for further optimal compilation by constructing homogeneous multiple threads on stream programs. Three phases are proposed in the scheduling scheme. First, threads in stream programs are replicated for constructing homogeneous multiple threads. Second, time step assignment for homogeneous multithreaded stream programs is utilized to obtain efficient kernel combination. Third, stream segmentation is presented to optimize both memory transfers and startup overheads of kernels. A set of benchmarks are exploited to evaluate the effectiveness of the proposed technique. Experimental results show that, with exploiting kernel-level software pipeline, the proposed technique improves the performance by 20.9 percent averagely with the energy decreasing by 7.6 percent. Utilizations of adders and multipliers are up to average 77.4 and 75.8 percent, increasing 17.0 and 13.3 percent, respectively. Moreover, the proposed technique performs an average of 12.5 percent improvement over CSMT4 with the energy decreasing by 12.0 percent.

关键词： Stream architecture stream program scheduling scheme homogeneous multiple threads arithmetic unit utilization

来源：评论

学校读者我要写书评

暂无评论

A scheduling scheme for wireless sensor networks based on social insect colonies

引用

IET COMMUNICATIONS 2009年第5期3卷 714-722页

作者： Cheng, C. -T. Tse, C. K. Lau, F. C. M. Hong Kong Polytech Univ Elect & Informat Engn Dept Hong Kong Hong Kong Peoples R China

Sensor networks employ a large amount of wireless sensor nodes to provide sensing power with high redundancy. Such redundancy makes sensor networks robust under changing environments. However, without proper scheduling, the surplus sensing power will cost tremendous energy consumption to the wireless sensor nodes. A scheduling scheme based on social insect colonies is proposed here. The proposed scheme is a kind of adaptive 'periodic on-off' scheduling scheme that uses only local information for making scheduling decisions. The scheme is evaluated in terms of averaged detection delay, target 3-coverage hit-rate and energy consumption per successful target detection. Simulation results show that, when comparing with other generic scheduling schemes, the proposed scheme can reduce energy consumption from a minimum of 7.49% to a maximum of 90.81% and improve the target hit-rate from a minimum of 15.7% to a maximum of 58.9%. Optimisation of the network lifetime and other performances is possible by adjusting some parameters.

关键词： wireless sensor network target detection object detection optimisation energy consumption social insect colony network lifetime optimisation Wireless sensor networks Optimisation techniques scheduling scheme wireless sensor networks scheduling

来源：评论

学校读者我要写书评

暂无评论

Three-stage scheduling scheme for hybrid energy storage systems to track scheduled feed-in PV power

引用

SOLAR ENERGY 2019年 188卷 1054-1067页

作者： Liang, Zhirui Song, Zhengxiang Wang, Jianhua Wang, Xian Zhang, Guogang Xi An Jiao Tong Univ State Key Lab Elect Insulat & Power Equipment 28 West Xianning Rd Xian 710049 Shaanxi Peoples R China

Tracking feed-in schedules (FISs) of photovoltaic (PV) systems using energy storage systems is a feasible method for making PV power as flexible as traditional power. Traditionally, the battery energy storage system (BESS) is used to track the FISs, but it can only confine the feed-in PV power in an error band rather than tracking the FISs precisely because of its limited capacity. To improve FIS tracking precision, a three-stage scheduling scheme is proposed, which employs the hybrid energy storage system (HESS) composed of batteries and electrolyzers. In the first stage, i.e., day-ahead scheduling, the FIS is designed by dividing 24-h-ahead forecast PV power into two parts, where the stable part is supplied to the power grid and the fluctuating part is absorbed by the HESS. In the second stage, i.e., 15-min-ahead scheduling, the FIS is cyclically modified according to 15-min-ahead forecast PV power to prevent the HESS from overload. In the third stage, i.e., real-time scheduling, the actual feed-in PV power and the real-time input power of the HESS are calculated based on the real-time PV output power and the state of charge of the HESS. Furthermore, this scheme is compared with another scheme that tracks the FISs with BESS, and its superiority is demonstrated from both technical and economic perspectives.

关键词： Hybrid energy storage system (HESS) Feed-in schedule (FIS) tracking scheduling scheme PV system Battery Hydrogen

来源：评论

学校读者我要写书评

暂无评论

Latency-Aware scheduling scheme for Deterministic Signaling in F5G

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2023年第9期41卷 2587-2600页

作者： Li, Xin Zhao, Yongli Deng, Yu Li, Yajie Li, Zhuotong Rahman, Sabidur Zhang, Jie Beijing Univ Posts & Telecommun Beijing 100876 Peoples R China China Mobile Commun Grp Co Ltd Beijing 100876 Peoples R China AT&T Labs San Ramon CA 94582 USA

At present, the development of optical transport and access network has entered the fifth-generation fixed network (F5G) era. Services carried by optical transport network of F5G have stringent requirements for network performance. Optical transport networks can provide services with deterministic bandwidth and delay after lightpaths are established. The time to establish a lightpath may determine whether the service can be successfully transmitted. Lightpath establishment delay includes signaling delay and device configuration delay. Signaling delay is not deterministic as signaling is implemented based on non-deterministic packet switching in data communication network (DCN). Thus, realizing the deterministic signaling is a key research problem. Deterministic signaling means to complete signaling transmission at a given time, which can be divided into hard real-time signaling and soft real-time signaling. In this paper, we propose a latency-aware scheduling scheme for deterministic signaling in F5G. Simulative results show that i) for hard real-time signaling scheduling, the proposed latency-aware scheduling (LAS) scheme reduces scheduling failure rate by 11.25%, improves resource utilization rate by 3.56%;ii) for hard real-time signaling and soft real-time signaling scheduling, the proposed scheme reduces scheduling failure rate by 6.57%, improves resource utilization rate by 3.34% and reduces end-to-end latency by 1.01 s.

关键词： Deterministic signaling F5G latency-aware scheduling scheme

来源：评论

学校读者我要写书评

暂无评论

Quality of service class mapping and scheduling scheme for converged LTE-WiFi in the next generation networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS 2019年第3期23卷 352-379页

作者： Saeed, Amer T. Esmailpour, Amir Univ New Haven Dept Elect & Comp Engn West Haven CT 06516 USA

In this paper, a novel quality of service (QoS) class mapping and scheduling scheme for the LTE-WiFi converged network is proposed to ensure that end-to-end QoS support is provisioned seamlessly. A mapping among QoS classes of LTE and WiFi is performed first, then scheduling scheme is outlined. For scheduling scheme, traffic is separated into real-time (RT) and non-real-time (NRT) components, then a two-stage complex queuing strategy is performed. In the first stage, deficit weighted round robin queuing (DWRRQ) and class-based weighted fair queuing (CBWFQ) are used for RT and NRT applications respectively to segregate and forward traffic according to resource requirements. Whereas in the second stage, rate-control priority queuing (RCPQ) is used for all types of traffic to give each class appropriate priority level. Performance evaluation of the converged network was done based on different metrics such as jitter, end-to-end delay, throughput, and packet loss ratio. Simulation results show significant improvements for RT with slight degradation on NRT applications after using the new scheduling scheme.

关键词： quality of service QoS long-term evolution LTE wireless fidelity WiFi converged next generation networks NGNs scheduling scheme

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：