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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

10,034 篇 会议
716 篇 期刊文献
9 篇 学位论文
5 册 图书

馆藏范围

10,764 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,393 篇 工学
- 1,176 篇 计算机科学与技术...
- 883 篇 电气工程
- 679 篇 信息与通信工程
- 296 篇 软件工程
- 277 篇 电子科学与技术（可...
- 221 篇 控制科学与工程
- 200 篇 仪器科学与技术
- 151 篇 机械工程
- 60 篇 交通运输工程
- 24 篇 材料科学与工程（可...
- 23 篇 网络空间安全
- 22 篇 石油与天然气工程
- 17 篇 光学工程
- 16 篇 动力工程及工程热...
- 16 篇 航空宇航科学与技...
- 7 篇 土木工程
- 6 篇 测绘科学与技术
- 4 篇 化学工程与技术
252 篇 管理学
- 247 篇 管理科学与工程(可...
- 6 篇 工商管理
- 6 篇 图书情报与档案管...
172 篇 理学
- 67 篇 系统科学
- 58 篇 物理学
- 30 篇 数学
- 15 篇 化学
- 9 篇 生物学
48 篇 文学
- 48 篇 新闻传播学
16 篇 医学
- 12 篇 临床医学
9 篇 经济学
- 7 篇 应用经济学
9 篇 军事学
- 9 篇 军队指挥学
5 篇 教育学
1 篇 法学

主题

10,764 篇 scheduling algor...
4,069 篇 processor schedu...
2,048 篇 delay
1,652 篇 throughput
1,569 篇 algorithm design...
1,380 篇 computer science
1,311 篇 resource managem...
1,305 篇 real time system...
1,298 篇 quality of servi...
1,176 篇 bandwidth
1,091 篇 traffic control
970 篇 job shop schedul...
949 篇 dynamic scheduli...
787 篇 costs
742 篇 telecommunicatio...
698 篇 switches
681 篇 optimal scheduli...
588 篇 application soft...
587 篇 heuristic algori...
526 篇 hardware

机构

40 篇 department of el...
32 篇 department of co...
30 篇 department of co...
30 篇 department of co...
30 篇 department of el...
30 篇 department of co...
29 篇 department of el...
29 篇 scuola superiore...
26 篇 department of co...
24 篇 department of co...
24 篇 school of electr...
23 篇 department of co...
22 篇 department of co...
22 篇 department of co...
22 篇 mitre corporatio...
22 篇 beijing universi...
21 篇 institute of com...
19 篇 department of el...
19 篇 bell laboratorie...
18 篇 department of el...

作者

30 篇 m. hamdi
26 篇 tei-wei kuo
25 篇 e. leonardi
21 篇 e.h.-m. sha
19 篇 sanjoy baruah
19 篇 f. neri
19 篇 klaus i. pederse...
18 篇 k.g. shin
18 篇 james h. anderso...
17 篇 p. giaccone
17 篇 maode ma
17 篇 v.o.k. li
16 篇 jian-jia chen
16 篇 n.k. jha
16 篇 kwei-jay lin
16 篇 d. mosse
15 篇 j.a. stankovic
15 篇 i. ahmad
15 篇 j.w.s. liu
15 篇 r. srikant

语言

10,619 篇 英文
87 篇 其他
58 篇 中文

检索条件"主题词=scheduling algorithm"

共 10764 条记录，以下是131-140 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A power-aware, best-effort real-time task scheduling algorithm

A power-aware, best-effort real-time task scheduling algorit...

引用

IEEE Workshop on Software Technologies for Future Embedded Systems (WSTFES 2003)

作者： Wang, JG Ravindran, B Martin, T Virginia Polytech Inst & State Univ Bradley Dept Elect & Comp Engn Blacksburg VA 24061 USA

ISBN: (纸本)0769519377

In this paper, we present a power-aware, best-effort real-time task scheduling algorithm called PA-BTA that optimizes real-time performance and power consumption. The algorithm considers a timeliness model where task timing constraints are described using Jensen's benefit functions and a system-level power model. We propose a metric called "Energy and Real-Time Performance Grade" (ERG) to measure real-time performance and power consumption in a unified way. Since the scheduling problem is NP-hard, PA-BTA heuristically computes schedules to maximize ERG, incurring a worst-case computational cost of O(n(2)). Our simulation results indicate that the algorithm performs close to the optimal algorithm and better than other algorithms considered in the study.

关键词： Automatic control Availability Energy consumption Optimal control Power system modeling Power system reliability Processor scheduling Real time systems scheduling algorithm Timing

来源：评论

学校读者我要写书评

暂无评论

A Controlled scheduling algorithm Decreasing the Incidence of Starvation in Grid Environments

A Controlled Scheduling Algorithm Decreasing the Incidence o...

引用

International Conference on Artificial Intelligence and Computational Intelligence

作者： Liu, Minna Ou, Kairi Zhao, Yuelong Sun, Tian S China Univ Technol Sch Engn & Comp Sci Guangzhou 510006 Guangdong Peoples R China

ISBN: (纸本)9783642052521

A fair scheduling algorithm accounting for the weight and execution time of tasks is critical in the Grid environment. The MTWCT (Minimize Total Weighted Completion Time) has been proved to minimize the total weighted completion time of a set of independent tasks in a processor, but it results in another problem that the response time of some tasks is far longer. To decrease the incidence of the starvation phenomena, an improved algorithm named CSA (Controlled scheduling algorithm) based on MTWCT is proposed, which computes the rho factors of tasks by the execution time and weight of step chains, and selects the unexecuted step chain in terms of rho factor and the executed time of task. Experimental results exhibit that CSA compared with the MTWCT, decreases the completion time of short tasks and the average turnaround time by sacrificing a little total weighted completion time.

关键词： grid environment scheduling algorithm starvation phenomena step chains

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy-based scheduling algorithm for prediction of next CPU-burst time to implement Shortest Process Next

A Fuzzy-based Scheduling Algorithm for prediction of next CP...

引用

Spring Conference of the International-Association-of-Computer-Science-and-Information-Technology

作者： Pourali, Abdolghader Rahmani, Amir Masoud Islamic Azad Univ Dept Comp Engn Abadan Branch POB 666 Abadan Iran Islamic Azad Univ Dept Comp Engn Tehran Iran

ISBN: (纸本)9780769536538

Practical use of SJF scheduling algorithm (SPN or Shortest Process Next), which is one of the best scheduling algorithms, always has some difficulties because when an operating system wants to execute a process, it does not know the execution time of it. After running, the exact execution time of that process would appear. Consequently, for calculating and estimating the execution time of a process before running, many algorithms were introduced. In this paper, a new algorithm with more efficiency is introduced. This algorithm is able to estimate the execution time (next CPU-burst time) of a process based on past behavior by using the intelligent fuzzy system.

关键词： scheduling algorithm Operating system CPU-burst time Fuzzy system Shortest Process Next (SPN)

来源：评论

学校读者我要写书评

暂无评论

EdgeTuner: Fast scheduling algorithm Tuning for Dynamic Edge-Cloud Workloads and Resources 41

EdgeTuner: Fast Scheduling Algorithm Tuning for Dynamic Edge...

引用

41st IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Han, Rui Wen, Shilin Liu, Chi Harold Yuan, Ye Wang, Guoren Chen, Lydia Y. Beijing Inst Technol Beijing Peoples R China Delft Univ Technol Delft Netherlands

ISBN: (纸本)9781665458221

Edge-cloud jobs are rapidly prevailing in many application domains, posing the challenge of using both resource-strenuous edge devices and elastic cloud resources. Efficient resource allocation on such jobs via scheduling algorithms is essential to guarantee their performance, e.g. latency. Deep reinforcement learning (DRL) is increasingly adopted to make scheduling decisions but faces the conundrum of achieving high rewards at a low training overhead. It is unknown if such a DRL can be applied to timely tune the scheduling algorithms that are adopted in response to fast changing workloads and resources. In this paper, we propose EdgeTuner to effectively leverage DRL to select scheduling algorithms online for edge-cloud jobs. The enabling features of EdgeTuner are sophisticated DRL model that captures complex dynamics of Edge-Cloud jobs/tasks and an effective simulator to emulate the response times of short-running jobs in accordance to dynamically changing scheduling algorithms. EdgeTuner trains DRL agents offline by directly interacting with the simulator. We implement EdgeTuner on Kubernetes scheduler and extensively evaluate it on Kubernetes cluster testbed driven by the production traces. Our results show that EdgeTuner outperforms prevailing scheduling algorithms by achieving significant lower job response time while accelerating DRL training speed by more than 180x.

关键词： Edge-cloud workloads scheduling algorithm DRL run-time tuning Kubernetes

来源：评论

学校读者我要写书评

暂无评论

Three-phase-scheduling algorithm for IP networks

Three-phase-scheduling algorithm for IP networks

引用

4th International Conference on Communications, Circuits and Systems (ICCCAS 2006)

作者： Qin, Yu Ye, Wu Feng, Suili Jiang, Shengming South China Univ Technol Dept Elect Commun Guangzhou Peoples R China

ISBN: (纸本)0780395840

Some scheduling algorithms have been developed to support QoS requirement for various applications in the IP networks. In this paper, we developed Three-Phase (TP) scheduling algorithm to get adjustable tradeoff between QoS requirement and fairness. TP can also improve the utilization of the scheduler. We analyzed the essence of TP and computed, the average packets delay compared with the other algorithms. And the simulation has shown that TP can get a good fairness with little influence on delay requirement for high priority traffic.

关键词： scheduling algorithm IP networks Traffic control Delay Counting circuits Throughput Processor scheduling algorithm design and analysis Computational modeling Communication system traffic control

来源：评论

学校读者我要写书评

暂无评论

Real-Time Fault-Tolerant scheduling algorithm with Rearrangement in Cloud Systems 2

Real-Time Fault-Tolerant Scheduling Algorithm with Rearrange...

引用

2017 IEEE 2nd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC 2017)

作者： Pengze Guo Zhi Xue Department of Electronic Engineering Shanghai Jiao Tong University

ISBN: (纸本)9781509064151;9781509064144

Cloud computing has aroused great interest from both academia and industry in the past decade. Due to Service Level Agreement(SLA), the cloud service providers have to guarantee the reliability of their systems. However, unpredictable hardware or software failures are usually inevitable. For realtime tasks, system failure may cause them to miss their deadlines. Fault tolerance technique can efficiently avoid such ***-backup model is widely used to realize fault tolerance by duplicating a task into two copies – a primary copy and a backup copy. The redundancy introduced by backup copies incurs extra overhead for cloud systems. To address this issue, in this paper we propose a real-time fault-tolerant scheduling algorithm with rearrangement(RFTR) in cloud systems. Different from traditional scheduling algorithms, RFTR dynamically rearranges the execution orders of tasks. Simulation experiments are conducted on Cloud Sim platform. Compared with the existing scheduling algorithm FESTAL, RFTR shows excellent performance in both task schedulability and resource conservation.

关键词： real-time fault tolerance primary-backup model scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

The Multi-user scheduling algorithm Based on BDMA Transmission in the Massive Multi-Input Multi-Output (MIMO) System 6th

The Multi-user Scheduling Algorithm Based on BDMA Transmissi...

引用

6th International Conference on Communications, Signal Processing, and Systems (ICCSPS)

作者： Yang, Guanglong Wang, Xiao Zhang, Wenbin Wang, Yi Harbin Inst Technol Commun Res Ctr Harbin 150080 Heilongjiang Peoples R China HeiLongJiang Prov Elect Informat Prod Supervis & Harbin 150001 Heilongjiang Peoples R China

ISBN: (纸本)9789811065712;9789811065705

This paper makes use of the feature of space channel of the massive MIMO which means that the channel of each user in the beam domain focus on part of the beam to propose a kind of multi-user scheduling algorithm based on BDMA transmission. This algorithm takes the system and the rate as the principles to simplify the uplink and rate expression. The expression only needs to perform the calculation of the determinant according to the received related matrix of the base station. The dimension is only related to the quantity of the beam received by a single user. This paper obtains the instantaneous channel status information on the maximum beam of channel gain of each user through the estimation of the LS channel, also provides the transmission method selected by the beam, proposes to simplify the greedy algorithm for the user scheduling and at last perform the simulation directly at the multi user MIMO system user scheduling and characteristics of BRE which highlights the advantages of the algorithm.

关键词： Massive MIMO scheduling algorithm BDMA transmission BRE

来源：评论

学校读者我要写书评

暂无评论

An Adaptive scheduling algorithm for Multi-Priority Traffic in Load-Balanced Switch 18

An Adaptive Scheduling Algorithm for Multi-Priority Traffic ...

引用

International Conference on Information Science and System (ICISS)

作者： Gao, Ya Wuxi Inst Technol Wuxi Peoples R China

ISBN: (纸本)9781450364218

In this paper, a hierarchical weighted round-robin scheduling (HWRR) algorithm is proposed in Load-Balanced two-stage switches. Following the change of traffic load, the proposed algorithm can adjust scheduling weights and allocate bandwidth flexibility. Intensive dispatching will be performed when heavy load is detected. It can reduce the packet drop probability and meet the requirements of different priority traffic. The simulation results show that HWRR achieves stable performance on delay and cell drop probability, and performs well under several types of traffic.

关键词： Load-Balanced switch traffic-adaptive scheduling algorithm bandwidth allocation

来源：评论

学校读者我要写书评

暂无评论

An improved feasible shortest path real-time fault-tolerant scheduling algorithm 7

An improved feasible shortest path real-time fault-tolerant ...

引用

7th International Conference on Real Time Computing Systems and Applications

作者： Kim, H Lee, S Jeong, BS Kyung Hee Univ Sch Elect & Informat Kiheung Eup 1 Seocheon Ri South Korea

ISBN: (纸本)0769509304

Fault tolerance is an important aspect of real-time computer systems, since timing constraints must not be violated. For real-time single processor environment, Ghosh proposed two queue-based scheduling techniques. an FSP (Feasible Shortest Path) algorithm and LTH(Linear lime Heuristics). Even though the FSP algorithm can produce optimal fault-tolerant schedules, it is not practical due to its time complexity The LTH algorithm is a greedy heuristics that closely approximates the optimal However since Ghosh's algorithm assumes that there is at most one fault within time interval df and does not consider interfault time it can deteriorate real-time scheduling performance due to unnecessary backup scheduling. In this paper;we have proposed an improved FSP algorithm on the more realistic assumption that there is no additional fault during minimum inter-fault time DeltaF after one fault occurs. The proposed algorithm can improve system performance by including more primary tasks in a fault-tolerant schedule and also reduce time complexity in generating backup schedules.

关键词： Delay Dynamic programming Fault tolerance Fault tolerant systems Processor scheduling Real time systems scheduling algorithm Standby generators System performance Timing

来源：评论

学校读者我要写书评

暂无评论

The Research of scheduling algorithm for Time-Triggered Ethernet Based on Path-hop 35

The Research of Scheduling Algorithm for Time-Triggered Ethe...

引用

35th IEEE/AIAA Digital Avionics Systems Conference (DASC)

作者： Zheng, Zhong He, Feng Xiong, Ying Beihang Univ Sch Elect & Informat Engn Beijing Peoples R China

ISBN: (纸本)9781509025237

The time-triggered principle establishes and maintains a system-wide synchronized time-base by the local clocks of the device. The proposed concept of Time-Triggered Ethernet (TTE) guarantees the determinacy of time-critical message for avionics and safety-critical systems. This paper presents an algorithm based on path-hop of tasks to generate a rational scheduling timetable to ensure is free of conflicts on the physical link. The scheduling timetable is periodic cycle by the Cluster Cycle as a unit. Cluster Cycle consists of several Integration Cycles (Min-cycle) with same time span. Time-Triggered (TT) flows are divided into several types by their path-hop parameter which can be obtained from path property. Different types of TT flows can be arranged into Cluster Cycle without conflict to achieve temporal determinacy. Meanwhile, the scheduling timetable unifies TT traffic and RC (Rate-Constrained) traffic defined in Avionics Full Duplex Switched Ethernet (AFDX) as well as BE (Best-Effort) traffic defined in ordinary Ethernet to improve bandwidth utilization. When all TT flows have been arranged into the scheduling timetable, the residual time resource can be used to transmit RC frames. Each vertex in the TTE network has its own scheduling timetable with different contents. Due to the clearly divided of timetable, it can support on-line modification for dynamical task insertion and withdrawal without congestion.

关键词： Time-Triggered Ethernet scheduling algorithm path-hop parameter scheduling priority

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 10 11 12 13 14 15 16 17 18 19 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：