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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,405 篇 工学
- 3,896 篇 计算机科学与技术...
- 1,640 篇 信息与通信工程
- 1,591 篇 软件工程
- 1,516 篇 电气工程
- 588 篇 控制科学与工程
- 342 篇 电子科学与技术（可...
- 308 篇 机械工程
- 194 篇 动力工程及工程热...
- 187 篇 交通运输工程
- 115 篇 仪器科学与技术
- 81 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 49 篇 土木工程
- 46 篇 安全科学与工程
- 43 篇 建筑学
- 39 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,883 篇 管理学
- 1,764 篇 管理科学与工程(可...
- 1,433 篇 工商管理
- 222 篇 图书情报与档案管...
1,759 篇 理学
- 1,440 篇 数学
- 224 篇 系统科学
- 199 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
101 篇 经济学
- 99 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
37 篇 农学
27 篇 教育学
25 篇 文学
5 篇 艺术学
2 篇 军事学

主题

8,577 篇 scheduling algor...
1,050 篇 scheduling
568 篇 schedules
525 篇 resource managem...
520 篇 real-time system...
474 篇 cloud computing
442 篇 throughput
425 篇 heuristic algori...
392 篇 quality of servi...
378 篇 delays
309 篇 dynamic scheduli...
307 篇 task analysis
303 篇 optimization
262 篇 computational mo...
229 篇 simulation
217 篇 energy consumpti...
208 篇 bandwidth
205 篇 job shop schedul...
199 篇 servers
194 篇 algorithm design...

机构

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

作者

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

语言

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

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

共 8577 条记录，以下是4541-4550 订阅

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

详细简洁

排序：

A dynamic scheduling algorithm for bandwidth reservation requests in software-defined networks

A dynamic scheduling algorithm for bandwidth reservation req...

引用

International Conference on Information, Communications and Signal Processing

作者： Chunbin Zhang Xiaohong Huang Gang Ma Xi Han Institute of Network Technology Beijing University of Posts and Telecommunications Beijing China Information Network Center Beijing University of Posts and Telecommunications Beijing China

With the rapid development of Internet technology and the emergence of more flexible applications, dynamic allocation of network resources is becoming more and more significant. Since bandwidth resource is limited, users' dynamic allocation requests cannot always be granted. Therefore, scheduling the dynamic requests to achieve optimal bandwidth utilization or service rate is of great importance. However, this is difficult to achieve in current networks due to the lack of programming interface of network devices for effective and centralized control and management. In recent years, the emergence of software-defined networks (SDN) provides us an opportunity to realize the goal. Centralized control and programmability of SDN let network managers configure, manage and optimize network resources very easily and quickly. In this paper, a dynamic scheduling algorithm based on an optimization model for scheduling reservation-based bandwidth allocation requests is proposed to achieve optimal resource utilization. Simulation result shows that the scheduling algorithm proposed in this paper could achieve higher bandwidth utilization compared to another two scheduling algorithms.

关键词： Bandwidth Resource management scheduling algorithms Channel allocation Dynamic scheduling Optimization

来源：评论

学校读者我要写书评

暂无评论

A Task scheduling Algorithm Based on Genetic Algorithm and Ant Colony Optimization Algorithm with Multi-QoS Constraints in Cloud Computing

A Task Scheduling Algorithm Based on Genetic Algorithm and A...

引用

International Conference on Intelligent Human-Machine Systems and Cybernetics, IHMSC

作者： Yangyang Dai Yuansheng Lou Xin Lu College of Computer & Information Hohai University Nanjing China

ISBN: (纸本)9781479986477

Task scheduling problem in cloud computing environment is NP-hard problem, which is difficult to obtain exact optimal solution and is suitable for using intelligent optimization algorithms to approximate the optimal solution. Meanwhile, quality of service (QoS) is an important indicator to measure the performance of task scheduling. In this paper, a novel task scheduling algorithm MQoS-GAAC with multi-QoS constraints is proposed, considering the time-consuming, expenditure, security and reliability in the scheduling process. The algorithm integrates ant colony optimization algorithm (ACO) with genetic algorithm (GA). To generate the initial pheromone efficiently for ACO, GA is invoked. With the designed fitness function, 4-dimensional QoS objectives are evaluated. Then, ACO is utilized to seek out the optimum resource. The experiment indicates that the proposed algorithm has preferable performance both in balancing resources and guaranteeing QoS.

关键词： Genetic algorithms Quality of service Cloud computing Algorithm design and analysis scheduling algorithms Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

DARTS: DynAmic Real-time Task scheduling

DARTS: DynAmic Real-time Task Scheduling

引用

Conference on Information and Knowledge Technology

作者： Abolfazl Ghavidel Samaneh Sadat Mousavi Nik Mohammad Hajibegloo Mahmoud Naghibzadeh Department of Computer Engineering Ferdowsi University of Mashhad Mashhad Iran Ferdowsi University of Mashhad Mashhad Razavi Khorasan IR

Real-time systems often involve time critical control tasks in which their correctness depends not only on the functionality but also on timeliness. In order to guarantee the timely-correctness, real-time scheduling has been studied extensively. The main problem of multiprogramming scheduling on a single processor is that an optimum fixed priority scheduler has a least upper bound to processor utilization, which is around 70 percent for large tasksets, in contrast, full processor utilization can be achieved by dynamically assigning priorities. In this paper DynAmic Real-time Task scheduling (DARTS) algorithm is proposed, which is based on dynamic utilization and assigns higher priority to a task with the highest utilization with regard to its laxity. Eventually, this method is extended for multiprocessor systems and we demonstrate that not only does DARTS algorithm have better utilization than existing global EDF schedulability tests, but it also has significantly well outputs in total utilization less than 90 percent.

关键词： Dynamic scheduling scheduling algorithms Heuristic algorithms Real-time systems Schedules

来源：评论

学校读者我要写书评

暂无评论

Adaptive Deadline Based Dependent Job scheduling algorithm in cloud computing

Adaptive Deadline Based Dependent Job Scheduling algorithm i...

引用

International Conference on Advanced Computing, ICAC

作者： Dinesh Komarasamy Vijayalakshmi Muthuswamy Department of Information Science and Technology Anna University Chennai India

ISBN: (纸本)9781509019342

Cloud computing is a platform for hosting an immense number of applications and computing services that will continuously change due to a large number of jobs randomly submitted by the end user. Thus, scheduling becomes strenuous in cloud computing because of an immense number of jobs submitted randomly. The ultimate intention of the proposed work is to minimize the makespan of the job, to improve the processor utilization irrespective with the cloud environment. Hence, this paper posits a novel approach called Adaptive Deadline Based Dependent Job scheduling (A2DJS) algorithm in cloud computing that comprises of three major components as job manager, data center and VM creation. Here, the job manager embeds with dependency resolver and task-prioritizer. The dependency resolver will determine the dependency among the tasks and task-prioritizer will prioritize the tasks to avoid starvation. Moreover, the data center embeds with job scheduler and host creation with VM allocation. The job scheduler schedules the job with the VM existing. The host creation with VM allocation allocates the jobs to the VM in a two-tier VM architecture. This contribution will mitigate the makespan of the job, evade starvation and improve the processor utilization. The results are simulated using cloudsim that shows the performance of the proposed A2DJS algorithm better when compared to the existing algorithms.

关键词： Cloud computing scheduling algorithms scheduling Resource management Computer architecture Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Decentralized scheduling with data locality for data-parallel computation on peer-to-peer networks

Decentralized scheduling with data locality for data-paralle...

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Weina Wang Matthew Barnard Lei Ying School of Electrical Arizona State University Tempe AZ

Despite distributed in computation and data storage, current data-parallel computing systems are centralized in task scheduling, which results in hierarchies that create single point of failure, limit scalability, and increase administration costs. In this paper, we propose a fully decentralized scheduling algorithm for data-parallel computing systems on peer-to-peer (P2P) networks. Our scheduling algorithm eliminates the centralized scheduler by letting each node in the network make scheduling decisions. To achieve good performance, data locality, which stresses the efficiency of colocating tasks with their input data, and load-balancing, should be considered jointly, and in a decentralized fashion. By exploring a backpressure-based approach, the proposed task scheduling algorithm strikes the right balance between data locality and load-balancing with each node only knowing the status information of part of the nodes in the network, and proves to maximize the throughput.

关键词： Peer-to-peer computing scheduling algorithms Distributed databases scheduling Computer architecture Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

An energy scheduling algorithm supporting power quality management in commercial Building Microgrids

An energy scheduling algorithm supporting power quality mana...

引用

IEEE General Meeting Power& Energy Society

作者： Mingguo Hong Xiangyang Yu Nanpeng Yu Kenneth Loparo Electrical Engineering and Computer Science Case Western Reserve University

This paper presents an energy scheduling algorithm for a small-scale microgrid serving small to medium size commercial buildings (the Building Microgrid) that includes conventional and renewable distributed generation resources, energy storage, and both linear and nonlinear loads. An essential study objective is to mitigate power quality issues through coordinating the operating schedules of sensitive devices in the Building Microgrid. The proposed energy scheduling algorithm is formulated as a mixed integer programming problem where power quality requirements are modeled in the constraints. The algorithm also involves validation with the harmonics and dynamic event simulations. Case studies have been performed with realistic model parameters to verify the performance of the algorithm. The study results demonstrate the effectiveness of the algorithm in managing voltage and frequency deviations, as well as harmonic distortions. In the transaction-based control framework, the proposed algorithm can be used to aggregate device transaction bids and facilitate the buildings-to-grid integration.

关键词： Heuristic algorithms Buildings Microgrids scheduling algorithms Power quality Performance evaluation Computer science

来源：评论

学校读者我要写书评

暂无评论

Resource scheduling for hybrid broadcasting and cellular networks

Resource scheduling for hybrid broadcasting and cellular net...

引用

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

作者： Panjin Song Jian Xiong Lin Gui Meikang Qiu Yue Zhang Institute of Image Communication and Network Engineering (IICNE) Shanghai Jiao Tong University China Department of Computer Science Pace University New York City USA Department of Computer Science and Technology University of Bedfordshire UK

This paper proposes a novel Resource scheduling (RS) method by using Hybrid Broadcasting and Cellular Networks (HBCN). In this approach, the hot or common information is assigned with higher priority levels and is preferentially scheduled. The Equivalent Throughput (ET) and fairness are redefined and discussed. Simulations show the ETs of the networks are improved by using the proposed algorithms, the hotter the information, the more efficient the network. Moreover, the simulations also show the more cells in the coverage of the terrestrial broadcasting network, the more efficient of the HBCN.

关键词： Broadcasting Bandwidth Throughput Base stations scheduling scheduling algorithms IEEE members

来源：评论

学校读者我要写书评

暂无评论

A master-axis-based feedrate scheduling with jerk constraints for five-axis tool center point trajectory

A master-axis-based feedrate scheduling with jerk constraint...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Ming-Tsung Lin Nien-Tzu Yu Wan-Ting Chiu Chien-Yi Lee Yi-Min Lu Department of Mechanical Design Engineering National Formosa University Yunlin Taiwan ROC Intelligent Machinery Technology Division Industrial Technology Research Institute Taichung Taiwan ROC

In this paper, a feedrate scheduling algorithm based on master axis is proposed to generate smooth five-axis tool center point (TCP) trajectory. The method first plans corner feedrate while respecting jerk continuity of three linear axes at block corner. The axis with the maximum movement among TCP and rotary axes is selected to be a master, and the ratios among the movements of the master and other axes are obtained. Five-axis feedrate regulation formulation (FFRF) is utilized to evaluate the velocity of the master axis. Feedrate command on TCP is adjusted with the constraints of jerks and movements of TCP and rotary axes. S-shape acceleration/ deceleration (ACC/DE C) method is us ed to achieve velocity smoothing and generate five-axis interpolation commands. Finally, the cutting experiments are performed to verify the efficiency of the proposed technology on a five-axis engraving machine.

关键词： Kinematics Splines (mathematics) Trajectory Interpolation Mathematical model scheduling algorithms Machining

来源：评论

学校读者我要写书评

暂无评论

SAWR: scheduling algorithm for wireless sensor networks with rendezvous nodes

SAWR: Scheduling algorithm for wireless sensor networks with...

引用

IEEE International Conference on Computational Intelligence and Computing Research

作者： Amar Jukuntla Keerthi Pendam N Arjun CSE Nalla Malla Reddy Engineering College Hyderabad India

A large class of Wireless Sensor Networks applications involved in monitoring environmental parameters in isolated urban areas covered with sensor nodes. Mobile sinks are mounted upon isolated urban areas with fixed trajectories to monitor environmental parameters. These MS provides ideal infrastructure for retrieving sensory data from isolated WSNfields. The existing approach uses the multi-hop technique for transfer of data from SNs lies within MS's range and network traffic can be balanced among sensor nodes. When sensor nodes run out of energy, the resulting loss of network connectivity and decreasing network life time. In this paper, an ant colony optimization (ACO) scheduling algorithm is exploredfor maximizing the network life, it can be done in three phases. In phase one, finds the initial active sensor nodes with fully coverage constraints. In second phase, it uses successor sensor set, for activating the sensor nodes for reaching constraint. In third phase, sensory data will be forwarded to MS through rendezvous nodes.

关键词： Wireless sensor networks Monitoring Mobile communication Clustering algorithms Silicon scheduling algorithms Radiation detectors

来源：评论

学校读者我要写书评

暂无评论

On demand SINR based scheduling algorithm (ODSSA) for mobile uplink communication in LTE networks

On demand SINR based scheduling algorithm (ODSSA) for mobile...

引用

International Conference on Signal Processing And Communication Engineering Systems (SPACES)

作者： S. K. L. V. Sai Prakash Mushunuri Visali National Institute of Technology Calicut Calicut Kerala IN National Institute of Technology Warangal India

Long Term Evolution (LTE) a Third Generation Partnership Project (3GPP) is developed for multimedia applications on mobile user equipment with very high data rates of the order 75/300 Mbps and low latency of 10msec. The high data rates are achieved by using SC-FDMA radio access mechanism for uplink communication and OFDM access mechanism for downlink. The performance can be further improved by scheduling the user data in an efficient manner considering channel characteristics as well as its QOS parameters, thereby allocating the resources to maximize the throughput. The Packet Scheduler helps in handling the LTE data traffic by allocating the resources both in time and frequency dimension. In this paper, we propose a novel scheduling algorithm that allocates maximum resources for the random users depending on their channel SNR condition with main focus on the data flow behavior. This is then compared with the two distinct algorithms that focus mainly on flow level dynamics- Fair Fixed Assignment (FFA) and Maximum added value (MAV) algorithms. It is shown that our algorithm outperforms the other two algorithms in terms of mean flow transfer time.

关键词： Interference Signal to noise ratio scheduling algorithms Uplink Long Term Evolution Algorithm design and analysis Base stations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 451 452 453 454 455 456 457 458 459 460 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：