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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,837 篇 会议
1,799 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

5,414 篇 工学
- 3,902 篇 计算机科学与技术...
- 1,645 篇 信息与通信工程
- 1,593 篇 软件工程
- 1,528 篇 电气工程
- 590 篇 控制科学与工程
- 341 篇 电子科学与技术（可...
- 305 篇 机械工程
- 199 篇 动力工程及工程热...
- 189 篇 交通运输工程
- 117 篇 仪器科学与技术
- 80 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 48 篇 土木工程
- 46 篇 安全科学与工程
- 42 篇 建筑学
- 40 篇 环境科学与工程（可...
- 40 篇 网络空间安全
- 38 篇 光学工程
1,880 篇 管理学
- 1,760 篇 管理科学与工程(可...
- 1,430 篇 工商管理
- 222 篇 图书情报与档案管...
1,787 篇 理学
- 1,466 篇 数学
- 223 篇 系统科学
- 199 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 42 篇 化学
102 篇 经济学
- 100 篇 应用经济学
68 篇 法学
- 63 篇 社会学
50 篇 医学
36 篇 农学
27 篇 教育学
25 篇 文学
5 篇 艺术学
2 篇 军事学

主题

8,637 篇 scheduling algor...
1,061 篇 scheduling
571 篇 schedules
539 篇 resource managem...
527 篇 real-time system...
478 篇 cloud computing
453 篇 throughput
432 篇 heuristic algori...
394 篇 quality of servi...
379 篇 delays
319 篇 dynamic scheduli...
314 篇 optimization
307 篇 task analysis
265 篇 computational mo...
230 篇 simulation
220 篇 energy consumpti...
210 篇 bandwidth
207 篇 job shop schedul...
203 篇 servers
193 篇 algorithm design...

机构

26 篇 beijing universi...
25 篇 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...
9 篇 tsinghua univers...
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 篇 zhang jie
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 篇 guo song
9 篇 hsu yu-pin
9 篇 li bo
9 篇 shakkottai sanja...

语言

7,925 篇 英文
636 篇 其他
80 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8637 条记录，以下是4191-4200 订阅

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

详细简洁

排序：

A spatial scheduling strategy for irregular workplace in shipbuilding

A spatial scheduling strategy for irregular workplace in shi...

引用

IEEE International Conference on Mechatronics and Automation

作者： Yan Ge Aimin Wang Jincheng Cheng Department of Mechanical Engineering Beijing Institute of Technology Beijing China

ISBN: (纸本)9781509023974

To deal with the problems in one-time shipbuilding spatial scheduling with irregular workplace and rectangular blocks, a mathematical model with the objective of higher efficiency was established which is bound by the relationship between the blocks and blocks, the blocks and the workplace. And then a scheduling algorithm based on heuristic rules and genetic algorithm was put forward. The algorithm consists of two parts, which are the pre-arrangement of blocks and the scheme optimization. In the pre-arrangement stage, the notepad rule was proposed to achieve the preliminary arrangement and adjustment of blocks specifically for irregular workplace. And the genetic algorithm is for the stage of scheme optimization. Genetic algorithm can generate an optimal sequence of some blocks to guarantee the utilization of the workplace. Meanwhile, the collision detection technology runs through the whole algorithm to ensure the feasibility of the project. Finally, a program was developed with the actual data of a shipyard to verify the feasibility and effectiveness of the algorithm. The result shows that the algorithm obtains satisfactory results in all indexes mentioned above.

关键词： Employment Genetic algorithms Algorithm design and analysis Job shop scheduling Collision avoidance scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

User scheduling and optimal power allocation for full-duplex cellular networks

User scheduling and optimal power allocation for full-duplex...

引用

IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： George C. Alexandropoulos Marios Kountouris Italo Atzeni Mathematical and Algorithmic Sciences Lab Huawei Technologies Co. Ltd.

ISBN: (纸本)9781509017508

The problem of user scheduling and power allocation in full-duplex (FD) cellular networks is considered, where a FD base station communicates simultaneously with one half-duplex (HD) user on each downlink and uplink channel. First, we propose low complexity user scheduling algorithms aiming at maximizing the sum rate of the considered FD system. Second, we derive the optimal power allocation for the two communication links, which is then exploited to introduce efficient metrics for FD/HD mode switching in the scheduling procedure, in order to further boost the system rate performance. We analyze the average sum rate of the proposed algorithms over Rayleigh fading and provide closed-form expressions. Our representative performance evaluation results for the algorithms with and without optimal power control offer useful insights on the interplay among rate, transmit powers, self-interference (SI) cancellation capability, and available number of users in the system.

关键词： High definition video Resource management scheduling scheduling algorithms Interference cancellation Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Node-based service-balanced scheduling for provably guaranteed throughput and evacuation time performance

Node-based service-balanced scheduling for provably guarante...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Bo Ji Gagan R. Gupta Yu Sang Dept. of CIS Temple University Philadelphia PA USA

ISBN: (纸本)9781467399548

This paper focuses on the design of provably efficient online link scheduling algorithms for multi-hop wireless networks. We consider single-hop flows and the one-hop interference model. The objective is twofold: 1) maximize the throughput when the flow sources continuously inject packets into the network, and 2) minimize the evacuation time when there are no future packet arrivals. The prior work mostly employs the link-based approach, which leads to throughput-efficient algorithms but often does not guarantee satisfactory evacuation time performance. In this paper, we adopt a novel node-based approach and propose a service-balanced online scheduling algorithm, called NSB, which gives balanced scheduling opportunities to the nodes with heavy workload. We rigorously prove that NSB guarantees to achieve an efficiency ratio no worse (or no smaller) than 2/3 for the throughput and an approximation ratio no worse (or no greater) than 3/2 for the evacuation time. It is remarkable that NSB is both throughput-optimal and evacuation-time-optimal if the underlying network graph is bipartite. Further, we develop a lower-complexity NSB algorithm, called LC-NSB, which provides the same performance guarantees as NSB. Finally, we conduct numerical experiments to elucidate our theoretical results.

关键词： Throughput scheduling algorithms Measurement Complexity theory Approximation algorithms scheduling Interference

来源：评论

学校读者我要写书评

暂无评论

scheduling Low-Utilized Real-Time Systems with End-to-End Timing Constraints

Scheduling Low-Utilized Real-Time Systems with End-to-End Ti...

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Chih-Yao Chuang Yung-Chieh Chen Chih-Wen Hsueh Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan R.O.C.

ISBN: (纸本)9781509024803

End-to-end delay is one of the most important timing constraints in distributed real-time systems (DRTS) [1], especially in the area of wireless sensor network (WSN) or Internet of Things (IoT). Since we may need to collect data from sensor nodes and react immediately. Thus, tasks must be executed in a distance-constrained manner. That is, the temporal distance between any two consecutive executions of a task should always be less than a certain amount of time. In DRTS, transactions are decomposed into a group of tasks, and periodic model might not be efficient enough, since the temporal distance between two consecutive executions of task could be two times of its period in the worst case. Moreover, an execution will not be always ready in a period, which might incur extra end-to-end delay in DRTS. Pinwheel scheduling algorithms have been designed to schedule tasks with distance constraint. But meeting distance constraints in a node does not guarantee minimized end-to-end delay of a transaction. Therefore, DSr, a distributed pinwheel scheduling algorithm, focuses on reducing end-to-end delay systematically and synchronously [2]. Although the pinwheel scheduling algorithms provide simple scheduling bounds and approaches for fully utilized tasks, for the simpler sensor nodes with limited hardware timer support, it might not be easy to execute the pinwheel scheduling algorithms accordingly and guarantee the synchronous results. We find that there exists a simple feasible algorithm (e.g. First In First Out, FIFO) with tight scheduling bound. Although it is always schedulable only in low-utilized systems using FIFO, it results in shorter endto- end delays than DSr in most cases with high utilization. To simplify, we focus only on the system of two nodes with the same utilization. As shown in Figure 1, we simulate the total end-to-end delay with different number of transactions, n, and utilization, ρ, and find that FIFO outperforms DSr. That means transactions can be fini

关键词： Delays Wireless sensor networks Real-time systems scheduling algorithms Internet of things

来源：评论

学校读者我要写书评

暂无评论

Poster Abstract: Preliminary Performance Evaluation of HEF scheduling Algorithm

Poster Abstract: Preliminary Performance Evaluation of HEF S...

引用

IEEE Symposium on Real-Time and Embedded Technology and Applications

作者： Carlos A. Rincon Albert M. K. Cheng Real-time Systems Laboratory University of Houston Houston USA Networking and Telematics Academic Unit Universidad del Zulia Maracaibo Venezuela

Summary form only given. The purpose of this paper is to analyze the performance of the Highest Entropy First (HEF) scheduling algorithm for real-time tasks. The contributions of this paper are: · Generate multiple task sets by implementing the programs from the Seoul National University (SNU) real-time benchmark in Wind River Workbench 3.3 to calculate the WCET and generating the periods by using a linear programming solution aiming to maximize the utilization of the system based on a predefined hyper-period. We implemented the SNU programs (sqrt.c, fibcall.c, crc.c, minver.c and select.c) on a server with an Intel i7-3770 processor running at 3.4 GHz, with 16 GB of RAM and 2 TB hard drive using Wind River Workbench 3.3 to calculate the worst case execution time (WCET). We run each program 100 times to average the results. We created 4 task sets with 2, 3, 4, and 5 tasks respectively. For each task set we used 100 ms as the hyper-period to calculate the periods of the tasks. We implemented a system with implicit deadlines. · Measure the performance of HEF algorithm to schedule real-time tasks using as metrics the number of context switches and deadline-miss ratio. The results from the preliminary performance evaluation show that the number of context switches is directly proportional to the number of tasks in the task set. For the deadline-miss ratio, HEF was able to schedule all the task sets without missing any deadline. Further analysis must be made to confirm that the deadline-miss ratio depends on the utilization of the system (U ≤ 1 = no deadline misses). The HEF algorithm has some similarities with the earliest deadline first algorithm (EDF), therefore we propose as future work to compare the performance of HEF against EDF using the task sets generated by the methodology proposed in this paper.

关键词： Real-time systems Performance evaluation scheduling algorithms Electronic mail Rivers Schedules Context

来源：评论

学校读者我要写书评

暂无评论

Improved priority based scheduling algorithm for real time embedded systems

Improved priority based scheduling algorithm for real time e...

引用

International Conference on Circuit, Power and Computing Technologies (ICCPCT)

作者： C Keerthanaa M Poongothai Dept. of ECE Coimbatore Institute of Technology Coimbatore India

ISBN: (纸本)9781509012787

Most of the real time systems are framed with aid of priority based scheduling algorithms. If the task is not scheduled accurately the percentage of deadline missing the tasks will exaggerate. In RTOS, when a high priority task is allowed to preempt the low priority task which results in context switching. Due to context switching, processor time and energy will get famished. To overcome these problems the controlled preemptive EDF (CP-EDF) scheduling algorithm is proposed so that preemptions have been controlled. The objective of the proposed CP-EDF scheduling algorithm is to avoid processor time and energy from getting wasted. The results are compared with fully preemptive EDF (FP-EDF) scheduling algorithm and non preemptive (NP-EDF) scheduling algorithm and concluded that the proposed CP-EDF scheduling algorithm outperforms the existing NP-EDF and FP-EDF scheduling algorithms in terms of success ratio, missing rate and CPU utilization.

关键词： scheduling algorithms Real-time systems Dynamic scheduling Switches Delays Context

来源：评论

学校读者我要写书评

暂无评论

On the secrecy capacity of multi-cell uplink networks with opportunistic scheduling

On the secrecy capacity of multi-cell uplink networks with o...

引用

IEEE International Conference on Communications (ICC)

作者： Hu Jin Bang Chul Jung Won-Yong Shin Dept. Electronics and Communication Engineering Hanyang University Ansan Korea Dept. Electronics Engineerring Chungnam National University Daejeon Korea Division of Mobile Systems Engineering Dankook University Yongin Korea

In this paper, we propose a novel user scheduling that achieves the optimal multi-user diversity gain in multi-cell uplink networks with multiple eavesdroppers. In the proposed scheduling, each base station (BS) selects a certain user based on two pre-determined thresholds (i.e., scheduling criteria). The first threshold is related to the amount of generating interference of the users to other BSs and the second threshold is related to the maximum amount of information overheard by the eavesdroppers in the network. Simulation results show that the proposed scheduling significantly outperforms the other scheduling algorithms in terms of secrecy throughput. Note that the proposed scheduling can operate with a distributed manner when time division duplex is adopted, i.e., no coordination among different BSs is needed.

关键词： Throughput Interference Uplink Diversity methods scheduling Fading channels scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluations of network coding-based scheduling approach for wireless data disseminations with time constraints

Evaluations of network coding-based scheduling approach for ...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Chunting Yan Shujuan Wang School of Information Engineering and Automation Kunming University of Science and Technology Kunming China

ISBN: (纸本)9781509040940

On-demand data broadcast has been broadly utilized In wireless communication networks. With the rapid increase of on-demand data dissemination services in burgeoning applications, clients are not satisfied with one data item per request but turn to multiple data item per request, while most of the existing scheduling algorithms focus on single-item request environment. In this work, we lucubrate the performance of the original scheduling algorithms that are proposed for single-item request based on network coding in multi-item request circumstances. The simulations come out that more hot data requested and larger cache size have positive effects on the performance of average access time and deadline miss ratio.

关键词： Servers scheduling algorithms Wireless communication Encoding Data models Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Swarm Intelligence Algorithm for Job scheduling in Computational Grid

Swarm Intelligence Algorithm for Job Scheduling in Computati...

引用

International Conference on Intelligent Systems, Modelling and Simulation (ISMS)

作者： Mehdi Effatparvar Somayeh Aghayi Vahid Asadzadeh Yosef Dashti Department of Computer Islamic Azad University Ardabil Iran Sama Technical and Vocational Training College Islamic Azad University Ardabil Iran Department of Computer Islamic Azad University Germi Iran

ISBN: (纸本)9781509006663

Grid computing is actually the next generation of distributed systems. Its objective is to create a powerful, large and autonomous virtual computer. This computer is created through assembling countless heterogeneous resources with the aim of sharing them. scheduling is one of the most important and challenging issue of such systems. An accurate and efficient schedule is required to increase the grid efficiency. Grid resources belong to different management domains, each one applies different management policies. This paper proposed a new heuristic approach based on particle swarm optimization algorithm in order to scheduling the jobs in gird environment. The proposed algorithm would create an optimal scheduler to complete the jobs in the minimum flowtime and makespan.

关键词： scheduling Particle swarm optimization Optimal scheduling scheduling algorithms Computers Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

An improved SJF scheduling algorithm in cloud computing environment

An improved SJF scheduling algorithm in cloud computing envi...

引用

International Conference on Electrical, Electronics, Communication, Computer and Optimization Techniques (ICEECCOT)

作者： Mokhtar A. Alworafi Atyaf Dhari Asma A. Al-Hashmi A. Basit Darem Suresha DoS in CS Mysore University India DoCS Thi_Qar University Iraq

ISBN: (纸本)9781509046980

Today, the service provider has to serve many users and the increase of the requests or tasks from the users to the cloud providers has become one of the scalable techniques to proposed the services. Many scheduling algorithms have been proposed to schedule the tasks in cloud computing environment such as (SJF) and (FCFS) algorithms. This paper aims to improve the shortest job first scheduling algorithm in the cloud computing. In tasks scheduling (TS), the most important parameters are makespan and response time. Therefore, we have proposed a Modified Shortest Job First algorithm (MSJF) to minimize the completion time of the last task (Makespan) and minimize the average response time with maximizing the resources utilization. MSJF has two functions, one is calculating the average of tasks length and the other one is Load-Balancing between the virtual machines. One of the important advantages of MSJF is sending the longest tasks to the fastest Machine. We compared the result of our proposed algorithm MSJF with SJF and FCFS. The performance of MSJF is better compared to SJF and FCFS.

关键词： Cloud computing scheduling algorithms Time factors Virtual machining Load management Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 416 417 418 419 420 421 422 423 424 425 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：