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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
678 篇 期刊文献
9 篇 学位论文
5 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

10,726 篇 scheduling algor...
4,056 篇 processor schedu...
2,043 篇 delay
1,646 篇 throughput
1,565 篇 algorithm design...
1,380 篇 computer science
1,302 篇 resource managem...
1,301 篇 real time system...
1,291 篇 quality of servi...
1,170 篇 bandwidth
1,086 篇 traffic control
968 篇 job shop schedul...
945 篇 dynamic scheduli...
782 篇 costs
735 篇 telecommunicatio...
691 篇 switches
677 篇 optimal scheduli...
588 篇 application soft...
582 篇 heuristic algori...
520 篇 hardware

机构

40 篇 department of el...
32 篇 department of co...
30 篇 department of co...
30 篇 department of el...
30 篇 department of co...
29 篇 department of el...
29 篇 scuola superiore...
29 篇 department of co...
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,585 篇 英文
83 篇 其他
58 篇 中文

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

共 10726 条记录，以下是211-220 订阅

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

详细简洁

排序：

Hybrid iSLIP scheduling algorithm for Network on Chip 2

Hybrid iSLIP Scheduling Algorithm for Network on Chip

引用

World Symposium on Web Applications and Networking (WSWAN)

作者： Ben Mbarek, Ihsen Mazouzi, Mohamed Hasnaoui, Salem Jelassi, Khaled Univ Tunis El Manar Natl Engn Sch Tunis Networking & Distributed Comp SysCom Tunis Tunisia Univ Tunis El Manar Natl Engn Sch Tunis Elect Syst Lab Tunis Tunis Tunisia

ISBN: (纸本)9781479981724

Network on Chip is a set of hardware component that communicates together. The communication system must achieve maximum throughput while maintaining the system correctness, stability and eliminating starvation. The ideal solution among existing NoC architecture is the Switch Fabric. As it is known, the scheduler is the Switch Fabric brain. Moreover, the scheduling algorithm choice must be suitable to the application requirement. By nature, NoC architecture is composed of two types of core that are master cores and slave ones, called also processor and coprocessor. Trying to give the suitable solution for such hardware architecture, we propose our own scheduling algorithm called Hybrid iSLIP which is a kind of prioritized iSLIP. This paper presents a modeling, design and an evaluation of a hardware scheduler for High-Speed Virtual output Queuing using the Hybrid iSLIP algorithm. A comparison is done between the iSLIP algorithm and the Hybrid one by determining the complexity and the convergence order for both them.

关键词： HiSLIP iSLIP scheduling algorithm Complexity Convergence order VoQ HOL blocking Hardware Design Modeling

来源：评论

学校读者我要写书评

暂无评论

A packet scheduling algorithm using utility function for mixed services in the downlink of OFDMA systems

A packet scheduling algorithm using utility function for mix...

引用

66th IEEE Vehicular Technology Conference

作者： Lei, Haipeng Zhang, Lei Zhang, Xin Yang, Dacheng Beijing Univ Posts & Telecommun Wireless Theories & Technol Lab WT&T Beijing Peoples R China

ISBN: (纸本)9781424402632

In this paper, we propose a downlink packet scheduling algorithm in OFDMA systems for the mixed services, such as real-time (RT) and non-real-time (NRT) services. The proposed scheduling algorithm is based on the channel state information and utility function of queuing delay. Simulation results show that this algorithm can not only guarantee the fairness and delay requirements of users with different types of services but also obtain good system throughput.

关键词： OFDMA scheduling algorithm utility function

来源：评论

学校读者我要写书评

暂无评论

New scheduling algorithm for Uplink LTE System

New scheduling algorithm for Uplink LTE System

引用

International Symposium on Networks, Computers and Communications

作者： Khdhir, Radhia Mnif, Kais Kamoun, Lotfi Nuaymi, Loutfi Univ Sfax LETI Lab ENIS Sfax Tunisia Telecom Bretagne RSM Dept Brest France

ISBN: (纸本)9781479958740

In the LTE (Long Term Evolution) System, packet scheduling is considered the most important step of RRM (Radio Resource Management) to have better resource utilization. In this context, we proposed a new Uplink scheduling scheme for LTE networks and compared its performances with other well known algorithms such as the RME (Recursive Maximum Expansion), the RR (Round Robin) and the BCQI (Best-CQI) Uplink scheduler's algorithms. The RR scheduler is characterized by a high fairness, but low data rates at cell level. On the other hand, the RME scheduler is characterized by its low complexity, but poor fairness. Also, the BCQI scheme is characterized by high data rates, but poor fairness. The main goal of our proposed scheme was to use the Tabu method for to schedule and optimize the allocation of a PRBs (Physical Resource Blocks) efficiently between different users. Simulation results show that the newly proposed scheduling algorithm allows a fair distribution of available LTE resources while keeping an high system's throughput.

关键词： LTE network scheduling algorithm Tabu method Throughput

来源：评论

学校读者我要写书评

暂无评论

A novel scheduling algorithm for input-queued switches 9

A novel scheduling algorithm for input-queued switches

引用

9th Asia-Pacific Conference on Communications held in conjunction with the 6th Malaysia International Conference on Communications (MICC 2003)

作者： Wang, P Jin, DP Zeng, LG Tsing Hua Univ Dept Elect Engn State Key Lab Microwave & Digital Commun Beijing 100084 Peoples R China

ISBN: (纸本)0780381149

In input-queued scheduling, iSLIP algorithm is a milestone for its high throughput and low implementation complexity. However under bursty arrivals, its average input latency increases dramatically and quite a few cells will be dropped as the input buffer overflows. Motivated by cutting down the cell loss rate without increasing average input latency, we present a new scheduling algorithm called iTFF (iterative "Time to leave" and "Full or not" First), which has better performance than iSLIP under bursty traffic conditions. Simulation results indicate that iTFF restrains the cell loss rate significantly and yet maintains low average input latency. Moreover, iTFF can be implemented in hardware to achieve high speed.

关键词： iSLIP iTFF input-queued scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm for Hadoop MapReduce Workflows with Budget Constraints in the Heterogeneous Cloud 30

A Scheduling Algorithm for Hadoop MapReduce Workflows with B...

引用

30th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Wylie, Andrew Shi, Wei Corriveau, Jean-Pierre Wang, Yang Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Univ Ontario Fac Business & IT Inst Technol Oshawa ON L1H 7K4 Canada Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China

ISBN: (纸本)9781509036820

In recent years cloud services have gained much attention as a result of their availability, scalability, and low cost. One use of these services has been for the execution of scientific workflows as part of Big Data Analytics, which are employed in a diverse range of fields including astronomy, physics, seismology, and bioinformatics. There has been much research on heuristic scheduling algorithms for these workflows due to the problem's inherent complexity, however existing work has mainly considered execution in a utility grid environment using a generic distributed framework. For our research, we consider the ever-increasingly popular Apache Hadoop framework for scheduling workflow onto resources rented from cloud service providers. Contrary to other distributed frameworks, the Hadoop MapReduce model imposes a functional style onto application definition, and as such presents an interesting and unapproached challenge for workflow scheduling. Investigated in our work is budget-constrained workflow scheduling on the Hadoop MapReduce platform, wherein we devise both an optimal and a heuristic approach to minimize workflow makespan while satisfying a given budget constraint. We have implemented modifications to the Apache Hadoop framework to allow fully integrated workflow scheduling. These modifications are novel and have led to the completion of the first generic workflow scheduler fully integrated with the Apache Hadoop framework. Both the framework modifications and the proposed scheduler implementation have been extensively tested via execution on multiple workflow applications, which demonstrates the ability of our implementation to handle all possible workflow substructures. Results from our empirical studies further establish these facts.

关键词： Scientific Workflow Cloud Service Hadoop MapReduce scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

The Mobile Sensor Nodes scheduling algorithm Based on Grid Competition in UWSNs

The Mobile Sensor Nodes Scheduling Algorithm Based on Grid C...

引用

Conference on Ocean Optics and Information Technology / International Symposium on Optoelectronic Technology and Application (OTA)

作者： Ding Yuan-ming Liu Fang Li Na-na Zhang Ran Yang Yang Dalian Univ Coll Informat Engn Key Lab Commun & Networks Dalian 116622 Peoples R China Dalian Univ Natl & Local Joint Engn Lab Smart Shipping & Logi Dalian 116622 Peoples R China

ISBN: (数字)9781510623439

ISBN: (纸本)9781510623439

The deployment of sensors in Underwater Wireless Sensor Networks (UWSNs) is a fundamental issue in underwater wireless communications. Aiming at the problem of sensor nodes failure caused by the collection of information and too much data transformation in the deployment of sensor of UWSNs, the mobile sensor nodes scheduling algorithm based on grids competition in UWSNs is proposed. Firstly, a hexagonal grid partition model is designed to reduce the communication energy consumption combined with existing of grid computing. On the basis of the model, the energy consumption analysis and mathematical model of sensor node scheduling are given. Further, a length-search message exchange mechanism involved in the model is developed. Hence the scheduling plan among the grids can be computed therefore, the whole algorithm is proposed. Finally, simulation experiments illustrate the rationality and effectiveness of the proposed algorithm. The simulation results show that the proposed algorithm can significantly reduce the communication energy consumption and mobile consumption of sensor nodes. In a conclusion, the energy balance among sensor nodes can be guaranteed, and the network lifetime can be extended somewhat.

关键词： scheduling algorithm message exchange mechanism grid competition underwater wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of scheduling Pool scheduling algorithm Based on Reuse of Jobs in Spark 1

Design and Implementation of Scheduling Pool Scheduling Algo...

引用

1st IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Tang Jianchao Yang Shuqiang Huang Chaoqiang Yan Zhou Natl Univ Def Technol Coll Comp Sci Changsha Hunan Peoples R China

ISBN: (纸本)9781509011926

As a distributed computing framework based on memory, Spark is being used by more and more enterprises. Generally, Spark runs in multi-user and multi-job mode, where may exist a large number of reuse of jobs. This reuse, here, refers to the calculation reuse inside the jobs, and it can greatly shorten the executing time of jobs in Spark. Therefore, this paper proposes a scheduling pool scheduling algorithm based on reuse of jobs. This algorithm is based on the original scheduling pool scheduling algorithm in Spark and can take great advantage of the reusable parts. Experiments show that the new scheduling algorithm realizes reuse of jobs, and improves the execution efficiency of the cluster.

关键词： scheduling pool reuse of jobs Spark scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Dynamic scheduling algorithm for Periodic Tasks in Real-Time Systems Using Dynamic Average Estimation

An Efficient Dynamic Scheduling Algorithm for Periodic Tasks...

引用

IEEE Symposium on Computers and Communication (ISCC)

作者： Alsheikhy, Ahmed Ammar, Reda Elfouly, Raafat Alharthi, Mosleh Alshegaifi, Abdulrahman Univ Connecticut Dept Comp Sci & Engn Storrs CT 06269 USA Cairo Univ Dept Comp Sci Fac Engn Giza Giza Governorat Egypt Taif Univ Fac Engn Dept Elect Engn At Taif Saudi Arabia

ISBN: (纸本)9781509006793

Real-time embedded systems have become widely used in many fields such as control, monitoring and aviation. They perform several tasks under strict time constraints. In such systems, deadline miss may lead to catastrophic results so that all jobs need to be scheduled appropriately to ensure that they meet their deadline times. This paper presents an efficient dynamic scheduling algorithm during run-time to schedule periodic tasks in multiprocessor environments and uniprocessor as well using a dynamic average estimation. Dynamic average estimation refers to changing in different probability distributions when a task is added or removed from them. It is not always available a value of Worst-Case Execution Time (WCET) in many real-time applications such as multimedia where data has a great variation. The proposed approach selects which task or a set of tasks must be picked up for execution. A simulation system was developed to show validation of the proposed approach.

关键词： Real-time embedded systems scheduling algorithm time constraints deadline performance periodic tasks probability distribution multiprocessor run-time efficient dynamic algorithm stochastic tasks

来源：评论

学校读者我要写书评

暂无评论

An Effective List scheduling algorithm for Homogeneous Multi-Core Processor

An Effective List Scheduling Algorithm for Homogeneous Multi...

引用

IEEE International Conference on Anti-Counterfeiting, Security and Identification (ASID)

作者： Li, Long Li, Dongsheng Song, Yukun Wang, Xiang Elect Engn Inst Hefei Hefei Peoples R China Hefei Univ Technol Inst VLSI Design Hefei Peoples R China

ISBN: (纸本)9781479911097

With increasing of the number of processors, the quantity of data and the communication traffic in multi-core parallel systems, data scheduling becomes an important factor to restrict the performance improvement. Based on the classic list scheduling-HEFT algorithm, an improved algorithm has been proposed in this paper to make better result of reordering the same priority level tasks. The presented algorithm improves the quality of scheduling by introducing the sum of communication time and executing time as a new parameter. The experiment results show that the proposed algorithm has good effect on lists derived from a variety of node priority levels.

关键词： DAG List scheduling Communication contention scheduling algorithm Static

来源：评论

学校读者我要写书评

暂无评论

A Multi-Service QoS Guaranteed scheduling algorithm for TD-LTE 230 MHz Power Wireless Private Networks 12

A Multi-Service QoS Guaranteed Scheduling Algorithm for TD-L...

引用

12th International Symposium on Antennas, Propagation and Electromagnetic Theory (ISAPE)

作者： Ma, Ping Lu, Yang Hou, Yabo Li, Liang Zhao, Xiongwen Zhang, Lei Zhu, Hang State Grid Shaoxing Elect Power Supply Co Shaoxing Peoples R China Global Energy Interconnect Res Inst Co Ltd Beijing Peoples R China North China Elect Power Univ Sch Elect & Elect Engn Beijing Peoples R China

This paper proposes a multi-service QoS (Quality of Service) algorithm for TD-LTE (time division-long term evolution) 230 MHz power wireless private networks, which can guarantee sufficient resource allocation for hig... 详细信息

ISBN: (纸本)9781538673027

关键词： LTE scheduling algorithm QoS NS-3 simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：