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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,416 篇 工学
- 3,905 篇 计算机科学与技术...
- 1,646 篇 信息与通信工程
- 1,603 篇 软件工程
- 1,519 篇 电气工程
- 587 篇 控制科学与工程
- 342 篇 电子科学与技术（可...
- 307 篇 机械工程
- 195 篇 动力工程及工程热...
- 189 篇 交通运输工程
- 116 篇 仪器科学与技术
- 82 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 49 篇 土木工程
- 46 篇 安全科学与工程
- 43 篇 建筑学
- 39 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,886 篇 管理学
- 1,767 篇 管理科学与工程(可...
- 1,436 篇 工商管理
- 222 篇 图书情报与档案管...
1,781 篇 理学
- 1,461 篇 数学
- 224 篇 系统科学
- 199 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
102 篇 经济学
- 100 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
36 篇 农学
27 篇 教育学
25 篇 文学
5 篇 艺术学
2 篇 军事学

主题

8,603 篇 scheduling algor...
1,052 篇 scheduling
569 篇 schedules
528 篇 resource managem...
520 篇 real-time system...
475 篇 cloud computing
444 篇 throughput
427 篇 heuristic algori...
392 篇 quality of servi...
379 篇 delays
311 篇 dynamic scheduli...
307 篇 task analysis
306 篇 optimization
262 篇 computational mo...
229 篇 simulation
218 篇 energy consumpti...
209 篇 bandwidth
205 篇 job shop schedul...
200 篇 servers
194 篇 algorithm design...

机构

26 篇 state key labora...
26 篇 beijing universi...
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 篇 wang wei
11 篇 anderson james h...
11 篇 xie zhiqiang
11 篇 buyya rajkumar
11 篇 wang yi
10 篇 wei hu
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,236 篇 英文
277 篇 其他
87 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8603 条记录，以下是4381-4390 订阅

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

详细简洁

排序：

Min-parent: An effective approach to enhance resource utilization in cloud environment

Min-parent: An effective approach to enhance resource utiliz...

引用

(Spring) International Conference on Advances in Computing, Communication, & Automation (ICACCA)

作者： Raj Kumar Mala Kalra Sudeep Tanwar Sudhanshu Tyagi Neeraj Kumar Department of CSE NITTTR Chandigarh India Department of Information Technology Bharat Institute of Technology Meerut U.P. india Department of E&CE GBPUA&T Pantnagar Uttarakhand India Department of Computer Science & Engineering Thapar University Patiala Pb. India

With the rapid growth in online services and scarcity of professionals under same domain, there is a huge requirement for integaration of services with Cloud Computing (CC). It is a latest technological trend in present arena. It provide an efficient infrastructure, better services over the internet. In CC environment scheduling of services is one of the major issue which can have significant impact on resource utilization and system performance. Work-flow scheduling is a problem of finding the correct execution sequence for assigned work-flow tasks. It plays a vital role in the work-flow management. Proper scheduling of work-flow can have an efficient impact on performance of the system. This paper proposes a scheduling algorithm for work-flows. Key parameters include parent-child relationship, task allocation to available Virtual Machines(VMs) for execution. Proposed algorithm mainly focuses on increasing the resource utilization and reducing the make-span. In proposed algorithm, we create a table that contains ready tasks and their corresponding children in a work-flow, and occurrences of child have been counted. Further, on the basis of child occurrences, this parent-child relationship table is sorted and then used for ready tasks scheduling. The proposed algorithm has been executed and validated by using simulation based analysis through WorkflowSim tool kit. The results of the proposed scheduling algorithm significantly minimizes overall execution time of work-flows.

关键词： scheduling algorithms Resource management Algorithm design and analysis Dynamic scheduling Cloud computing Schedules

来源：评论

学校读者我要写书评

暂无评论

Optimized data-driven MAC schedulers for low-latency downlink in LTE networks

Optimized data-driven MAC schedulers for low-latency downlin...

引用

Annual Conference on Wireless On Demand Network Systems and Services (WONS)

作者： Fabio Pianese Peter J. Danielsen Wireless Research Program Bell Labs Alcatel-Lucent

We consider a novel way by which DL dynamic MAC scheduling can be augmented based on cross-layer inputs to provide desired performance enhancements. We describe ODDS, an automated design process for the data-driven refinement of downlink resource scheduling algorithms. ODDS extracts insights from the behavior of a simulated LTE cellular system under randomized traffic patterns and propagation conditions in a given network scenario. An offline iterated reinforcement learning campaign seeks to best fulfill a target set of goals, e.g. “fair throughput with low latency”, which can be encoded in the form of an arbitrary utility function specified by the designer. The knowledge base obtained from the learning campaign consists in a set of rules that a parametric scheduler leverages at run-time. We present our learning framework and evaluation results. ODDSgenerated schedulers are shown to achieve improved performance compared to well-known reference scheduling strategies.

关键词： Measurement Training Wireless communication scheduling algorithms Throughput OFDM Downlink

来源：评论

学校读者我要写书评

暂无评论

Network Codes-based Multi-Source Transmission Control Protocol for Content-centric Networks

Network Codes-based Multi-Source Transmission Control Protoc...

引用

International Workshop on Quality of Service

作者： Dongliang Xie Xin Wang Qingtao Wang State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China Department of Electrical and Computer Engineering State University of New York at Stony Brook USA

ISBN: (纸本)9781509026357

With the rapid shift from end-to-end communications to content-based data retrieval, there are increasing interests in exploiting Content-centric Networks (CCN) to deliver data. As the special characteristics of CCN, in-network caching and naming-based routing make traditional TCP-like transmission control protocol unsuitable. Although there are some existing efforts on improving the congestion control in CCN, the big issue of redundant transmissions caused by multiple sources has received little attention. To eliminate the redundancy and speed up the transmission, we propose a complete Network Codes-based Multi-Source Transmission Control Protocol (MSTCP), which provides an efficient and controllable multi-source content retrieval service over CCN. MSTCP takes advantage of random network coding to make full use of the coded data responded by different sources to speed up decoding and data receiving at the request side. Moreover, we design a scheduling algorithm based on a simple Expected Reception Deadline (ERD) to efficiently control the number of coded packets to send at each source. This not only effectively eliminates the redundant transmissions in CCN, but also helps to significantly speed up the information retrieval. Extensive simulations show that our mechanism greatly reduces the redundancy while speeding up the content retrievals by the network users.

关键词： Network coding Protocols Redundancy scheduling algorithms Decoding Peer-to-peer computing Routing

来源：评论

学校读者我要写书评

暂无评论

BLEST: Blocking estimation-based MPTCP scheduler for heterogeneous networks

BLEST: Blocking estimation-based MPTCP scheduler for heterog...

引用

IFIP Networking Conference

作者： Simone Ferlin Özgü Alay Olivier Mehani Roksana Boreli Simula Research Laboratory Norway National ICT Australia (NICTA) Sydney Australia

With the widespread availability of multi-homed devices, multipath transport protocols such as MPTCP are becoming increasingly relevant to support better use of multiple connectivity through capacity aggregation and seamless failover. However, capacity aggregation over heterogeneous paths, such as offered by cellular and Wi-Fi networks, is problematic. It causes packet reordering leading to head-of-line (HoL) blocking at the receiver, increased end-to-end delays and lower application goodput. MPTCP tackles this issue by penalising the use of longer paths, and increasing buffer sizes. This, however, results in suboptimal resource usage. In this paper, we first evaluate and compare the performance of default MPTCP and alternative state-of-the-art schedulers, all implemented in the Linux kernel, for a range of traffic patterns and network environments. This allows us to identify shortcomings of various approaches. We then propose a send-window BLocking ESTimation scheduler, BLEST, which aims to minimise HoL-blocking in heterogeneous networks, thereby increasing the potential for capacity aggregation by reducing the number of spurious retransmissions. The resulting scheduler allows an increase by 12% in application goodput with bulk traffic while reducing unnecessary retransmissions by 80% as compared to default MPTCP and other schedulers.

关键词： Wireless LAN Delays scheduling algorithms Streaming media Servers Transport protocols Linux

来源：评论

学校读者我要写书评

暂无评论

AQP++: A Hybrid Approximate Query Processing Framework for Generalized Aggregation Queries

AQP++: A Hybrid Approximate Query Processing Framework for G...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Yuxiang Wang Xiaoliang Xu Yixing Xia Qiming Fang School of Computer Science Technology Hangzhou Dianzi University Hangzhou P.R. China

ISBN: (纸本)9781509036783

Sampling-based approximate query processing (AQP) method provides a fast way, in which the users can obtain a trade-off between accuracy and time consumption by executing the analytical application on a sample of data rather than the whole dataset. AQP method is usually adopted to support Big Data analysis efficiently, and there are two major AQP methods: (1) central limit theorem (CLT) based online aggregation, and (2) bootstrap method. The first one is time-efficient but only available for simple aggregation queries, while the second one is general but high computation overhead. Both two methods suffer from the possible estimation failure. However, there is no technology can not only supports more categories of queries but also has acceptable execution time. In order to make the current AQP method much more general and efficient, we propose a hybrid approximate query framework called AQP++ to combine the advantages of both methods together and eliminate the limitations as far as possible. We have implemented our AQP++ prototype and conducted extensive experiments on the TPC-H benchmark. Our results demonstrate the effectiveness and efficiency of our AQP++.

关键词： Estimation Query processing Computational modeling Big data Dynamic scheduling Facebook scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of scheduling policies for VoIP traffic in LTE-Advanced network 2

Performance analysis of scheduling policies for VoIP traffic...

引用

2nd International Conference on Computer, Communications, and Control Technology, I4CT 2015

作者： Md Zain, Aini Syuhada Abd. Malek, Mohd Fareq Elshaikh, Mohamed Omar, Normaliza Hussain, Abadal-Salam T. School of Computer and Communication Engineering Malaysia School of Electrical Systems Engineering University Malaysia Perlis Perlis Malaysia

ISBN: (纸本)9781479979523

Resource allocation mechanisms are important in assigning all available resources in the network. scheduling is one of the resource allocation mechanism which will determine the performance of the network. This paper provides the performance analysis on three different scheduling algorithms in the Long Term Evolution-Advanced downlink transmission system with realistic channel model for urban macro cell scenario. All scheduling algorithms are evaluated based on throughput, frame delay, packet delay variation and mean opinion score index of voice over internet protocol via simulation executed on OMNET++ based simulator. The maximum of carrier to interference ratio scheme provided the highest value of throughput and mean opinion score index among all schemes in the evaluated network. The scheme also provided the lowest value of frame delay and packet delay variation in the evaluated network scenario. © 2015 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A clustering approach to schedule workflows to run on the cloud

A clustering approach to schedule workflows to run on the cl...

引用

Conference on Information and Knowledge Technology

作者： Arash Deldari Mahmoud Naghibzadeh Amin Rezaeian Hamidreza Abrishami Department of Computer Engineering Ferdowsi university of Mashhad Mashhad Iran

ISBN: (纸本)9781509043361

Scientific workflows can be considered a useful modeling method to model different scientific applications. Service-oriented computing is an attractive platform for most users to execute these applications in a pay-as-you-go manner. Therefore, scheduling workflows on the cloud as the latest trend in service-oriented computing and meeting the required users' Quality of Service requirements is an important problem to be tackled. Furthermore, the scheduling algorithms must consider the available multicore processing resources on the commercial Infrastructure as a Service cloud. Hence, considering multicore resources in addition to Quality of Service constraints makes the workflow scheduling problem more challenging to be solved. In this research, a static workflow scheduling algorithm is proposed which considers the available multicore resources on the cloud and attempts to minimize the leasing costs of the processing resources while considering not violating a user-defined deadline. The proposed algorithm uses a clustering technique to divide the workflow into a number of clusters and attempts to combine the clusters in such a way to achieve the algorithms' main goals. A flexible and extendable scoring approach chooses the best combination available in each step. Extensive simulations reveal a great reduction in the leasing costs of the workflow execution while meeting the user-defined deadline.

关键词： Clustering algorithms Cloud computing Quality of service Multicore processing scheduling algorithms scheduling

来源：评论

学校读者我要写书评

暂无评论

Supporting composition in symbolic system synthesis

Supporting composition in symbolic system synthesis

引用

International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (IC-SAMOS)

作者： Kai Neubauer Christian Haubelt Michael Glaß University of Rostock Rostock-Warnemünde Germany University of Erlangen-Nuremberg Erlangen Germany

ISBN: (纸本)9781509030774

Typically, state-of-the-art approaches in system synthesis do not consider the trend in embedded systems design towards systems-of-systems where optimized subsystems exist from previous projects or as 3 rd party IP. In this paper, we propose a novel top-down system synthesis approach with additional support for the composition of subsystems that is based on the use of hierarchical mapping edges and a list-based scheduling algorithm using distributed priority queues. The proposed method not only enables composition of existing subsystems, but experimental results also show a significant reduction of the design space while maintaining a good quality of the implemented systems. Especially for large network-on-chip systems (NoC), our approach outperforms an existing top-down methodology in solving time by nearly 50% and in average quality by 11%.

关键词： Schedules Resource management Embedded systems Communication channels Market research IP networks scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Message-Aware Communication Scheduler for Ceph Storage System

A Dynamic Message-Aware Communication Scheduler for Ceph Sto...

引用

IEEE International Workshops on Foundations and Applications of Self Systems

作者： Yunjung Han Kwonyong Lee Sungyong Park Department of Computer Science and Engineering Sogang University Seoul Republic of Korea SDS Tech. Lab Corporate R&D Center SK Telecom Seoul Republic of Korea

ISBN: (纸本)9781509036523

With the proliferation of cloud computing technologies, the Ceph, a distributed object-based storage system has been an attractive alternative to building a storage backend due to its excellent performance, reliability, and scalability. As the storage system processes huge amount data and the network traffic generated from the cloud increases rapidly, designing a high-performance messenger in the storage system has created a lot of challenging issues. Although the async messenger, one of the Ceph's messengers, is known to be efficient and flexible, it contains several performance problems due to its simple round-robin based scheduling scheme that assigns a connection to a worker thread without any consideration for the amount of workloads transferred through the connections. This causes the imbalance of worker threads and adversely affects the performance of the Ceph storage system. This paper proposes a dynamic message-aware communication scheduler for Ceph storage system that balances the workloads of worker threads based on the types of incoming messages, while avoiding unnecessary connection movements among worker threads. We use genetic algorithm (GA) to solve this problem and implement the proposed scheduling algorithm using the async messenger. The benchmarking results show that the proposed approach outperforms the original async messenger by as much as 12.5% under the same workload from clients and 24% under the random workloads from clients.

关键词： Message systems Cloud computing Data transfer Dynamic scheduling Genetic algorithms scheduling algorithms Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Runtime mapping and scheduling for energy efficiency in heterogeneous multi-core systems

Runtime mapping and scheduling for energy efficiency in hete...

引用

International Conference on ReConFigurable Computing and FPGAs, ReConFig 2015

作者： Silva, Bruno Delbem, Alexandre Bonato, Vanderlei Diniz, Pedro C. Instituto de Ciencias Matemáticas e de Computação Universidade de São Paulo São Carlos Brazil USC Information Sciences Institute 4676 Admiralty Way Marina del ReyCA90292 United States

ISBN: (纸本)9781467394062

Heterogeneous Multi-core Processors (HMPs) have the potential to outperform homogeneous multi-core processors in terms of raw performance and/or energy as both their Instruction-Set Architectures (ISA) and cache configurations (size and set associativity) can be tailored to the specific needs of a computation. In this paper we describe algorithm for the generation of custom HMP and a dynamic run-time core-mapping and scheduling policy that exploits the heterogeneity of such systems customized with respect to the number of cores and L1 cache memory sizes. Experimental results targeting custom HMPs implemented on a contemporary Field-Programmable Gate Array (FPGA) with LEON3 cores as their base for a set of 50 application codes reveal that the proposed core-mapping and scheduling algorithms achieves an average execution time improvement of 18.3% and a 12% energy reduction over a static core-mapping and list-scheduling algorithms. © 2015 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 435 436 437 438 439 440 441 442 443 444 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：