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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,382 篇 工学
- 3,886 篇 计算机科学与技术...
- 1,633 篇 信息与通信工程
- 1,587 篇 软件工程
- 1,507 篇 电气工程
- 585 篇 控制科学与工程
- 337 篇 电子科学与技术（可...
- 310 篇 机械工程
- 194 篇 动力工程及工程热...
- 188 篇 交通运输工程
- 116 篇 仪器科学与技术
- 79 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 47 篇 土木工程
- 47 篇 安全科学与工程
- 41 篇 建筑学
- 40 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,874 篇 管理学
- 1,756 篇 管理科学与工程(可...
- 1,431 篇 工商管理
- 220 篇 图书情报与档案管...
1,739 篇 理学
- 1,421 篇 数学
- 225 篇 系统科学
- 198 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
99 篇 经济学
- 97 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
35 篇 农学
26 篇 教育学
25 篇 文学
5 篇 艺术学
3 篇 军事学

主题

8,509 篇 scheduling algor...
1,039 篇 scheduling
563 篇 schedules
516 篇 resource managem...
510 篇 real-time system...
469 篇 cloud computing
436 篇 throughput
414 篇 heuristic algori...
391 篇 quality of servi...
376 篇 delays
307 篇 task analysis
297 篇 dynamic scheduli...
289 篇 optimization
259 篇 computational mo...
225 篇 simulation
215 篇 energy consumpti...
206 篇 job shop schedul...
204 篇 bandwidth
195 篇 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 篇 sun yat sen univ...
10 篇 school of softwa...
10 篇 university of el...
10 篇 scuola super san...
9 篇 shanghai jiao to...
9 篇 georgia state un...
9 篇 school of electr...
9 篇 state key labora...
9 篇 college of compu...
9 篇 department of el...

作者

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,265 篇 英文
154 篇 其他
82 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 德文
1 篇 法文
1 篇 俄文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8509 条记录，以下是4951-4960 订阅

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

详细简洁

排序：

A probabilistic retransmission scheme with link-state-dependent packet scheduling in wireless networks

A probabilistic retransmission scheme with link-state-depend...

引用

International Conference on Information and Communication Technology Convergence (ICTC)

作者： Kai Le Jipeng Zhou Yuhui Deng Haisheng Tan Lin Cui Department of Computer Science Jinan University Guangzhou China

The wireless environment is unstable. The transmission link always bursts into errors, which makes the head packet fail to be transmitted. This paper gives the fact that choosing the queue with bad error link to transmit the packet will bring about the Head Of Line (HOL) problem: the blocked head packet would make the rest postpone to be sent The HOL problem occurs frequently because of the unstable state of the link. This paper proposes a new probabilistic retransmission method to solve this problem. The simulation results show that the proposed algorithms can remove the packets from the bottleneck node and can improve the throughput of the networks.

关键词： Throughput scheduling Base stations Probabilistic logic scheduling algorithms Wireless communication Equations

来源：评论

学校读者我要写书评

暂无评论

An Analysis of Service Level Agreement Parameters and scheduling in Multi-Tenant Cloud Systems

An Analysis of Service Level Agreement Parameters and Schedu...

引用

International Conference on Control Systems and Computer Science (CSCS)

作者： George-Valentin Iordache Universitatea din Bucuresti Bucuresti RO

In Cloud Systems it usually the case that there exists a multi-tenancy of Cloud Service Customers meaning that some Cloud Service Customers applications share the same Cloud infrastructure. In this situation there must exist a Service Level Agreement (SLA) contract between the Multi-Tenant Cloud Service Provider (MTCSP) and the Cloud Service Customers (CSCs). In this article we discuss about the parameters of an SLA in the Cloud and we particularize it in the case of multi-tenancy. We analyze and implement two algorithms with the purpose of optimizing the scheduling of tasks from the tenants of the Multi-Tenant Cloud Service. The results show that the algorithms can be used in different situations with good results.

关键词： Cloud computing Task analysis Contracts Service-oriented architecture scheduling algorithms scheduling Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Towards Optimizing Task scheduling Process in Cloud Environment

Towards Optimizing Task Scheduling Process in Cloud Environm...

引用

IEEE Annual Computing and Communication Workshop and Conference (CCWC)

作者： Yong Shi Kun Suo Jameson Hodge Divya Pramasani Mohandoss Steven Kemp College of Computing and Software Engineering Kennesaw State University Marietta USA

ISBN: (数字)9781665414906

ISBN: (纸本)9781665430586

The cloud computing paradigm offers many advantages over traditional self-hosting computing solutions by abstracting computations from infrastructure. An essential task for any cloud provider is task scheduling, wherein tasks are assigned to computing resources within the cloud system by a broker. Numerous cloud task scheduling algorithms exist including Min-Min, Max-Min, and Sufferage-though each is defined by performance trade-offs. BSufferage is proposed as a novel cloud task scheduling algorithm that augments the performance of the classical Sufferage algorithm. Modeling the algorithm using the open source CloudSim package and comparing it to its precursor yields performance results for BSufferage-demonstrating decreased completion times, increased throughput, and improved load balancing of resources.

关键词： Cloud computing scheduling algorithms Conferences Load management Throughput Task analysis Load modeling

来源：评论

学校读者我要写书评

暂无评论

scheduling hybrid workflows using extended look-ahead approach in utility grid

Scheduling hybrid workflows using extended look-ahead approa...

引用

Conference on Information and Knowledge Technology

作者： Shahab Nassiri Mahmoud Naghibzadeh Department of Computer Engineering Ferdowsi University of Mashhad Mashhad Iran

A workflow represents a complex activity that is often modeled by a directed acyclic graph (DAG) in which each vertex is a task and each directed edge represents both precedence and communication. Recently, Hybrid DAG has emerged as a new model. In this model, unlike the traditional DAG model, tasks can also interact during their executions. Hybrid workflows that are composed of tasks and super-tasks can be modeled using hybrid DAGs. With respect to scheduling workflows to run on the Grid, Lookahead is an important list-based algorithm. To assign a processor to a task, it predicts the status of the system after the children of this task are scheduled and then makes the final decision on this task. One source of sometimes low performance of Lookahead is that unscheduled parents of these children are not given higher priority over the corresponding children's tasks. In this paper, we have proposed the Extended Lookahead algorithm in which this deficiency of Lookahead is removed. In next step, the Extended Lookahead, HEFT, and Lookahead approaches are modified such that they are able to schedule hybrid workflows that will be executed in the utility Grid. The experimental comparison results show that the performance of the new approach is improved compared to both HEFT and Lookahead.

关键词： Quality of service scheduling Schedules scheduling algorithms Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Quantifying the Sub-optimality of Non-preemptive Real-Time scheduling

Quantifying the Sub-optimality of Non-preemptive Real-Time S...

引用

Euromicro Conference on Real-Time Systems

作者： Abhilash Thekkilakattil Radu Dobrin Sasikumar Punnekkat Mälardalen Real-Time Research Center Mälardalen University Sweden

A number of preemptive real-time scheduling algorithms, such as Earliest Deadline First (EDF), are known to be optimal on uni-processor systems under specified assumptions. However, no uni-processor optimal algorithm exists under the non-preemptive scheduling paradigm. Hence preemptive schemes strictly dominate non-preemptive schemes with respect to uni-processor feasibility. However, the 'goodness' of non-preemptive schemes, compared to uni-processor optimal preemptive scheduling schemes such as EDF, which can also be referred to as its sub-optimality, has not been fully investigated yet. In this paper, we apply resource augmentation, specifically processor speed-up, to quantify the sub-optimality of non-preemptive scheduling with respect to EDF, and apply the results to guarantee user specified upper-bounds on the preemption related scheduling costs. In particular, we derive an upper bound on the minimum processor speed-up required to guarantee the non-preemptive feasibility of tasks that are deemed feasible under the preemptive EDF, and we prove that, in the cases where, for all tasks in the task set, the largest execution requirement is not greater than the shortest deadline, this bound is equal to 4. We also show how the proposed approach enables a system designer to choose an optimal processor, in order to, e.g., guarantee specified upper bounds on the preemption related overheads.

关键词： Real-time systems Optimal scheduling Silicon Schedules scheduling scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Bus scheduling Algorithm Based on Integer Programming

Research on Bus Scheduling Algorithm Based on Integer Progra...

引用

Mobile Internet, Cloud Computing and Information Security (MICCIS), International Conference on

作者： Sheng Liu Minna Huang Tong Zhang Nan Jing Intelligent Transportation Information Co. Ltd. Nanjing China Nanjing University of Aeronautics and Astronautics Nanjing China

ISBN: (数字)9798350389906

ISBN: (纸本)9798350389913

To address challenges inherent in the scheduling of public bus transportation, such as disparities in peak and off-peak operational demands, amalgamated single and double shift operations, this study endeavors to model and optimize the daily operational schedules for bus routes, grounded in empirical data reflecting actual operational requirements. The formulation of the bus scheduling problem entails the integration of various parameters including planned trip quantities, peak-hour road conditions, station dwell durations, inter-departure intervals, and driver shift change dynamics. In the optimization process, a hybrid algorithm, combining Genetic Algorithm (GA) and Tabu Search (TS), is proposed. GA serves as a heuristic for a global exploration of the solution space, while TS is for a detailed exploration of local regions. Leveraging the operational parameters of actual bus schedules in Nanjing, the proposed hybrid algorithm is applied to refine the scheduling plan for a specific bus route. The actual scheduling results demonstrate that, in comparison to stand-alone implementations of GA, greedy algorithms, and manually crafted schedules, the hybrid GA-Tabu algorithm yields a noteworthy 7.88 percent improvement in the utilization rate of working hours. Furthermore, the departure frequency seamlessly adapts to peak periods, aligning with passenger demand patterns and augmenting the overall system efficiency. The proposed hybrid GA-Tabu algorithm proves efficacious in enhancing system efficiency, catering to passenger demands, and ensuring compliance with driver work hour regulations. Besides, its applicability showcases a degree of generality within the realm of public bus transportation scheduling.

关键词： Greedy algorithms Schedules scheduling algorithms Roads Manuals Dynamic scheduling Regulation

来源：评论

学校读者我要写书评

暂无评论

The Research on Task scheduling Algorithm for the Cloud Management Platform of Mimic Common Operating Environment

The Research on Task Scheduling Algorithm for the Cloud Mana...

引用

International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)

作者： Litian Huo Peinan Shao Fei Ying Lunhan Luo The 32nd Research Institute of China Electronics Technology Group Corporation Shanghai China School of Electronic and Information Engineering Tongji University Shanghai China

scheduling algorithm is an important step in cloud computing, which determines the effectiveness of the system. Focus on the business requirement of mimic common operating environment (MCOE), especially the incomplete consideration of load balancing and heterogeneous in traditional scheduling algorithms, this paper presents an entropy weight clustering scheduling (EWCS) algorithm, which combines the dynamic heterogeneous redundancy (DHR) architecture of mimetic defense theory and K-Means clustering of machine learning to complete the nodes selection on the cloud platform. This algorithm consists of four steps: risk value screening, load balancing, entropy weight calculation and clustering optimization. The simulation results show that the algorithm is reasonable and can serve MCOE well. It is also an effective attempt to apply machine learning method to scheduling problem.

关键词： Clustering algorithms Heuristic algorithms Cloud computing Task analysis scheduling algorithms Entropy Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

TRAVEL: Deterministic Transmission scheduling for Satellite-Terrestrial Integrated Networks

TRAVEL: Deterministic Transmission Scheduling for Satellite-...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Weiting Zhang Peixi Liao Dong Yang Ping Dong Haixia Peng Hongke Zhang School of Electronic and Information Engineering Beijing Jiaotong University Beijing China School of Information and Communications Engineering Xi’an Jiaotong University Xi’an China

ISBN: (数字)9798350378412

ISBN: (纸本)9798350378429

In this paper, we investigate a deterministic transmission scheduling problem for satellite-terrestrial integrated networks (STIN), in which satellite networks supplement terrestrial networks endowed with deterministic mechanisms (e.g., cycle specified queuing and forwarding) to improve scheduling success ratio and reduce overall transmission delay (i.e., network revenue) while maintaining users’ quality of service (QoS). We propose a fixed-mobile-satellite integrated architecture and formulate the transmission scheduling problem as a two-hierarchical routing and queuing problem. Then, a deep reinforcement learning-based Transient Routing And Varied quEue aLgorithm (TRAVEL) is developed to address the two-hierarchical decision problem. Specifically, according to the intrinsic properties of routing and queuing, we decouple the decision problem into two sub-problems, namely route planning at the macro level and queue selection at the micro level. The proposed TRAVEL can realize efficient decision making to perform the differential transmission scheduling of intricate tasks. Simulation results demonstrate that the TRAVEL delivers robust and effective performance, thereby enhancing network operation revenue in terms of different traffic proportion.

关键词： Satellites scheduling algorithms Simulation Decision making Quality of service Routing Space-air-ground integrated networks

来源：评论

学校读者我要写书评

暂无评论

Effects of Interference Mitigation and scheduling on Dense Small Cell Networks

Effects of Interference Mitigation and Scheduling on Dense S...

引用

IEEE Vehicular Technology Conference

作者： Victor Fernandez-Lopez Klaus I. Pedersen Beatriz Soret Aalborg University Nokia - Aalborg

ISBN: (纸本)9781479944484

This article compares the potential performance gains from downlink scheduling and interference mitigation in an LTE-Advanced dense small cell network. The study combines theoretical considerations and system-level simulations with a dynamic traffic model and different offered loads. It is shown that intra-cell scheduling can provide a 22% throughput gain in a narrow traffic load region, while the plausible gains from an ideal inter-cell resource management mechanism can be greater than 50% for a wider range of traffic loads, reaching 300% for some of the cases. The results from this research provide valuable insight for the design of resource management algorithms targeted to small cell scenarios on dedicated carriers.

关键词： Interference scheduling algorithms Throughput Computer architecture Signal to noise ratio Microprocessors Load modeling

来源：评论

学校读者我要写书评

暂无评论

A SURVEY: Duty cycle based routing and scheduling in wireless sensor networks

A SURVEY: Duty cycle based routing and scheduling in wireles...

引用

International Conference on Electronics and Communication Systems (ICECS)

作者： R. Nithya N. Mahendran M.E-Communication Systems M. Kumarasamy College of Engineering Karur India M Kumarasamy College of Engineering Karur Tamil Nadu IN

Wireless sensor networks consist of spatially distributed sensor nodes, which can sense the environment by collecting, processing and transmitting the data to sink node. A critical issue in wireless sensor networks since most sensors is equipped with non-rechargeable batteries. The lifetime of a sensor network can be extended by jointly applying different techniques of scheduling and routing schemes also brings great challenges to the design of efficient distributed routing protocols for multi-hop wireless sensor networks. In scheduling algorithms, the nodes are arranged to sleep when they are not in use. The main purpose of scheduling algorithms is to minimize resource starvation and to ensure fairness amongst the parties utilizing the resources. The routing can be applied to wireless sensor networks for reducing energy consumption caused by retransmissions and dynamically detouring critical sensor nodes with less energy. To achieve network lifetime maximization of wireless sensor network through joint routing schemes and scheduling algorithms. This paper surveys the latest progresses in scheduling and routing schemes.

关键词： Wireless sensor networks Routing Wireless communication Delays Routing protocols scheduling algorithms Monitoring

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：