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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,751 篇 会议
1,800 篇 期刊文献
5 篇 学位论文
1 册 图书

馆藏范围

8,557 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,400 篇 工学
- 3,895 篇 计算机科学与技术...
- 1,638 篇 信息与通信工程
- 1,596 篇 软件工程
- 1,511 篇 电气工程
- 588 篇 控制科学与工程
- 343 篇 电子科学与技术（可...
- 310 篇 机械工程
- 194 篇 动力工程及工程热...
- 188 篇 交通运输工程
- 116 篇 仪器科学与技术
- 81 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 49 篇 土木工程
- 47 篇 安全科学与工程
- 43 篇 建筑学
- 40 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,880 篇 管理学
- 1,761 篇 管理科学与工程(可...
- 1,433 篇 工商管理
- 222 篇 图书情报与档案管...
1,760 篇 理学
- 1,441 篇 数学
- 225 篇 系统科学
- 200 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
101 篇 经济学
- 99 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
37 篇 农学
26 篇 教育学
25 篇 文学
5 篇 艺术学
3 篇 军事学

主题

8,557 篇 scheduling algor...
1,044 篇 scheduling
564 篇 schedules
520 篇 resource managem...
511 篇 real-time system...
472 篇 cloud computing
439 篇 throughput
417 篇 heuristic algori...
392 篇 quality of servi...
377 篇 delays
307 篇 task analysis
302 篇 dynamic scheduli...
293 篇 optimization
261 篇 computational mo...
228 篇 simulation
217 篇 energy consumpti...
205 篇 job shop schedul...
204 篇 bandwidth
198 篇 servers
194 篇 algorithm design...

机构

26 篇 beijing universi...
24 篇 state key labora...
21 篇 university of ch...
18 篇 national mobile ...
14 篇 institute of com...
13 篇 purple mountain ...
12 篇 hong kong polyte...
12 篇 northeastern uni...
12 篇 college of compu...
10 篇 college of compu...
10 篇 shanghai jiao to...
10 篇 sun yat sen univ...
10 篇 school of softwa...
10 篇 university of el...
10 篇 scuola super san...
10 篇 school of automa...
9 篇 georgia state un...
9 篇 school of electr...
9 篇 state key labora...
9 篇 college of compu...

作者

21 篇 ghaderi javad
16 篇 baruah sanjoy
15 篇 guan nan
13 篇 yi wang
12 篇 gao hong
11 篇 anderson james h...
11 篇 xie zhiqiang
11 篇 buyya rajkumar
10 篇 wei hu
10 篇 wang wei
10 篇 wang yi
10 篇 jing liu
9 篇 zhang lei
9 篇 deng qingxu
9 篇 ying lei
9 篇 hsu yu-pin
9 篇 li bo
9 篇 shakkottai sanja...
9 篇 zhang jie
9 篇 pop florin

语言

8,295 篇 英文
173 篇 其他
81 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8557 条记录，以下是481-490 订阅

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

详细简洁

排序：

Comparison of Various Round Robin scheduling algorithms

Comparison of Various Round Robin Scheduling Algorithms

引用

International Conference on System Modeling & Advancement in Research Trends (SMART)

作者： Ankush Joshi S.B. Goyal Bhagwant University Ajmer Rajasthan Dean Faculty of Information Technology City University Malaysia

ISBN: (数字)9781728132457

ISBN: (纸本)9781728132464

In last ten to fifteen years lots of improved and transformed forms of RR scheduling have been created to overcome some of issues which were available in the standard RR scheduling. When these transformed versions were given by various scientists and researchers, these algorithms were always compared with the standard Round Robin Algorithm to make sure that the improved version is better than the standard algorithm. In this research paper we tried to draw comparison between various improved versions of round robin algorithm and analyze their average waiting time, average turnaround times and context switches, to check which one improved version would be able to suggest a fruitful modification over the original one.

关键词： Round Robin Algorithm scheduling Time Quantum Context Switch Turnaround Time Waiting Time First Come First Served Ready Queue Waiting time Turnover Time Round robin context switching time quantum scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Smart Traffic Light scheduling algorithms

Smart Traffic Light Scheduling Algorithms

引用

International Conference on Smart Communications and Networking (SmartNets)

作者： Jihene Rezgui Mamadou Barri Reiner Gayta Laboratoire Recherche Informatique Maisonneuve (LRIMa) Montreal Canada

ISBN: (数字)9781728142753

ISBN: (纸本)9781728142760

Traffic lights have and always will be necessary for the safety of the traffic on the road. However, the time cycles of these traffic lights are based on premeditated computations and not real time data. These scheduling methods can often be inefficient and therefore lead to traffic congestions. In this paper, we propose three different Smart Traffic Light scheduling (STLS) algorithms that were tested on our Isolated Intersection Simulator (IIS) Java platform. IIS simulates real-life traffic flow on an at-grade junction with different traffic light scheduling algorithms. We integrate a heuristic to our proposed algorithms that takes into account, not only the density of the junctions like traditional schemes, but also the waiting time of the vehicles. In addition, it can also give the right of way to emergency vehicles that need immediate passage through the intersection. Throughout extensive simulations, IIS displays the efficiency of our different STLS algorithms in terms of managing the intersection and avoiding congestions. For instance, our simulations demonstrated a tremendous decrease in the average delay time when compared to regular traffic lights. In fact, cars on the intersection using our STLS algorithms performs 3 times better. On top of this, thanks to our algorithms, the average speed of the cars is nearly doubled and the number of static cars on average are halved.

关键词： ISS Smart Traffic Light STLS Average Traffic Density Traffic Simulator Junctions Average Waiting Time Traffic lights Junction Device Component International space stations European Union Institute for Security Studies semi-threshold logic Cars SCGB1D4 gene IIS scheduling algorithms Crossing Right Of Way Emergency vehicles algorithms Delay time Intersection

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis and Comparison Among Different Task scheduling algorithms in Cloud Computing

Performance Analysis and Comparison Among Different Task Sch...

引用

Sustainable Technologies for Industry 4.0 (STI), International Conference on

作者： Md. Tanvir Alam Siddique Selina Sharmin Tanvir Ahammad Jagannath University Dhaka Bangladesh

ISBN: (数字)9781665404891

ISBN: (纸本)9781665404907

In the field of cloud computing, efficient task scheduling plays a vital role. Cloud computing is an on-demand service where resources are shared virtually by the users to complete their tasks. The main concept of task scheduling is to execute the tasks in such an order that can enhance the performance with full resource utilization and minimum loss. Already a lot of scheduling algorithm exists targeting to various goals like reducing execution time, cost, makespan and increase resource utilization, load balancing, etc. In this work, we have mainly carried out the performance analysis and comparison among various well-known task scheduling algorithms. The algorithms are examined and implemented in a well-known cloud simulator (CloudSim) to observe their performances by varying different parameters. Finally, the performance metrics like makespan, waiting time, turnaround time, throughput, and load balancing are observed by plotting the results graphically. Along with the comparative analysis, this work also assists one to identify a better scheduling algorithm based on different scheduling constraints and criteria.

关键词： Cloud computing scheduling algorithms Load management Throughput Performance analysis Resource management Task analysis

来源：评论

学校读者我要写书评

暂无评论

Comparative study of scheduling algorithms to enhance the performance of virtual machines in cloud computing

Comparative study of scheduling algorithms to enhance the pe...

引用

International Conference on Emerging Trends in Engineering, Technology and Science (ICETETS)

作者： M N Kavyasri B. Ramesh Dept. of CS & E Malnad College of Engineering Hassan

ISBN: (纸本)9781467367264

Cloud computing is an emerging technology and serves as next generation platform, which allows the user to pay as they use. It permits access to remote and geographically distributed resources with the help of an important feature in cloud computing called virtualization. Cloud consists of number of virtual machines. In cloud there is need of number of virtual machines (VM) based on the requirement of user and cloud service providers. scheduling is necessary to manage large number of VM requests. scheduling is key technology in cloud computing, scheduling of tasks and resource allocation is challenging task in cloud. So we require scheduling algorithm. Primary consideration of scheduling algorithm is to provide proficiency to task and resource scheduling. Main objective of the paper is to give comparative analysis of existing scheduling algorithm in cloud platform where resources have varying cost and computational efficiency. In this paper we have surveyed on different types of scheduling algorithm and tabulated their various parameters, scheduling factors and so on.

关键词： Cloud computing scheduling scheduling algorithms Resource management Virtual machining Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Optimization of Max-Min and Min-Min Task scheduling algorithms Using G.A in Cloud Computing

Optimization of Max-Min and Min-Min Task Scheduling Algorith...

引用

International Conference on Engineering Technology and their Applications (IICETA)

作者： Ismael Salih Aref Juliet Kadum Amaal Kadum Department of Computer Science College of Science University of Diyala Iraq

ISBN: (数字)9781665472159

ISBN: (纸本)9781665472166

Task and resource scheduling in cloud computing remains an important topic that requires enhancement. In this paper, a hybrid task scheduling consisting of three algorithms Min-Min scheduling, Max-Min scheduling, and genetic algorithm is proposed to reduce Makespan and optimize the load balances between resources. In this work genetics algorithm play a vital role by determining which tasks should schedule using the Max-Min algorithm and which ones should be scheduled using the Min-Min algorithm. The Makespan and resources utilization are two measures used to test the efficiency of the proposed work. The results obtained from the proposed work are compared with Min-Min and Max-Min scheduling algorithms, the experimental results show the best outcomes in reducing the Makespan and utilization of all available resources effectively compared with the other two algorithms.

关键词： Cloud computing Schedules scheduling algorithms Minimax techniques scheduling Resource management Task analysis

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of packet scheduling algorithms in LTE-A HetNets

Performance comparison of packet scheduling algorithms in LT...

引用

Asia-Pacific Conference on Communications

作者： Ramprasad Subramanian Kumbesan Sandrasegaran Xiaoying Kong Faculty of Engineering and Information Technology University of Technology Sydney Sydney Australia

ISBN: (纸本)9781509006779

Performance comparison of various Packet scheduling (PS) algorithms such as Proportional Fair (PF), Maximum Largest Weighted Delay First (MLWDF) and Exponential/Proportional Fair (EXP/PF) has been studied in HetNets environment. The performance indicators such as throughput, Packet Loss Ratio (PLR), delay and fairness are considered to judge the performance of the scheduling algorithms. Various strategies such as increasing the number of pico cells in the cell edge were used in the simulation for the performance evaluation study. The results achieved by various simulations show that adding the pico cells to the existing macros enhances the overall system performance in addition to various scheduling algorithms implemented in macros. Simulation results show that the overall system gain has increased by adding picos, provide better coverage in the cell edge and increase the capacity of the network to provide better Quality of Service (QoS). Furthermore, simulations show that MLWDF performs better for video traffic than compared to other with PS algorithms.

关键词： Delays scheduling algorithms Mathematical model Quality of service Long Term Evolution Algorithm design and analysis Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Experimental Evaluation of Global and Partitioned Semi-Fixed-Priority scheduling algorithms on Multicore Systems

Experimental Evaluation of Global and Partitioned Semi-Fixed...

引用

International Symposium on Object-Oriented Real-Time Distributed Computing

作者： Hiroyuki Chishiro Nobuyuki Yamasaki School of Science for Open and Environment Systems Keio University Yokohama Japan

Nowadays multicore systems have been used in real-time applications such as robots. In robots, imprecise tasks such as image processing tasks are required to detect and avoid objects. However, existing real-time operating systems have evaluated multiprocessor real-time scheduling algorithms in Liu and Lay land's model and have not evaluated those in the imprecise computation model. This paper performs experimental evaluations of global and partitioned semi-fixed-priority scheduling algorithms in the extended imprecise computation model on multicore systems. Experimental results show that semi-fixed-priority scheduling has comparable overhead to fixed-priority scheduling. In addition, global semi-fixed-priority scheduling has lower overhead than partitioned semi-fixed-priority scheduling.

关键词： Real time systems scheduling Computational modeling scheduling algorithms Multicore processing Hardware

来源：评论

学校读者我要写书评

暂无评论

Improved scheduling algorithms for Single-Path Multiple Bandwidth Reservation Requests

Improved Scheduling Algorithms for Single-Path Multiple Band...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Liudong Zuo Michelle Mengxia Zhu Computer Science Department California State University Carson CA USA Department of Computer Science Montclair State University Montclair NJ USA

ISBN: (纸本)9781509032068

Colossal amounts of data are being generated in extreme-scale e-Sciences with the advent of new computation tools and experimental infrastructures. Such extremely large and complex data sets normally need to be transferred remotely for data storage and analysis. Reserving bandwidth as needed along selected paths in high-performance networks (HPNs) has proved to be an effective way to satisfy the high-demanding requirements of such data transfer. The most common data transfer requirement from users is the data transfer deadline. However, users oftentimes want to achieve other data transfer performance parameters, such as the earliest completion time (ECT) and the shortest duration (SD). For the bandwidth reservation service provider, all bandwidth reservation requests (BRRs) in one batch should be scheduled for high scheduling efficiency and system throughput. In this paper, we study the problem of scheduling all BRRs in one batch while achieving their best average transfer performance on one reservation path in an HPN. Two data transfer performance parameters, ECT and SD, are specifically considered. Because of the limited bandwidth resources of the reservation path, the problems of scheduling all BRRs in one batch on one reservation path while achieving their best average ECT and SD are converted into the problems of scheduling as many BRRs as possible while achieving the average ECT and SD of scheduled BRRs, respectively. We prove these two converted problems as NP-complete problems, and improve two existing heuristic algorithms proposed previously for similar problems. Extensive simulation experiments show the superior scheduling performance of these improved algorithms in terms of several performance metrics.

关键词： Bandwidth Data transfer scheduling scheduling algorithms Schedules Throughput Local area networks

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of K means clustering using different scheduling algorithms

Comparative analysis of K means clustering using different s...

引用

IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)

作者： D S Kavya Chaitra D Desai Computer Science and Engineering REVA Institute of Technology and Management Bengaluru India

ISBN: (纸本)9781509007752

Hadoop is an open-source framework developed by Apache software foundation. It works on large datasets, as the data is been stored and processed across cluster in distributed environment. It consist of two components - HDFS and MapReduce. HDFS is used for storing the data and MapReduce is used to process those stored datasets. In current era large amount of data is generated by many websites, the data generated is enormous which is simply stated as "big data". These datasets are then processed in Hadoop framework. As the processing is done parallely in Hadoop framework appropriate scheduling of the resources is required to process large datasets in-order to gain better performance. Mainly scheduling algorithms are used to minimize completion time of a parallel application. Among users the resource allocation will be guaranteed by schedulers. In this paper we study about the performance of various scheduling algorithms like fair, fifo, capacity of Hadoop platform.

关键词： scheduling algorithms Conferences Market research scheduling Resource management Google

来源：评论

学校读者我要写书评

暂无评论

A java based visual tool to learn CPU scheduling algorithms

A java based visual tool to learn CPU scheduling algorithms

引用

International Conference on Computing for Sustainable Global Development (INDIACom)

作者： Neetu Jain P. V. Suresh SOCIS IGNOU New Delhi

CPU scheduling algorithms are integral part of learning operating system. Over the years, it has been experienced that initially CS students face a lot of problems in understanding and further implementing the various scheduling algorithms. Also generating and regenerating Gantt Charts is faced with difficulties by many CS students. A visual tool or diagram has always been effective way in better learning and understanding. We developed a Java and Java Swing based application, to visually explain various scheduling algorithms. User can enter the runtime details of processes and the tool is capable of graphically showing the execution of processes inside the system using a particular scheduling algorithm. The tool is also capable of doing calculations different effectiveness criteria of an algorithm like waiting time of each process, average waiting time and turnaround time. Proposed tool has used different colors to depict processes to have much better understanding of the operations inside the system.

关键词： scheduling algorithms Operating systems Decision support systems Visualization Java Handheld computers Education

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 45 46 47 48 49 50 51 52 53 54 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：