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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,410 篇 工学
- 3,902 篇 计算机科学与技术...
- 1,637 篇 信息与通信工程
- 1,592 篇 软件工程
- 1,508 篇 电气工程
- 592 篇 控制科学与工程
- 339 篇 电子科学与技术（可...
- 310 篇 机械工程
- 193 篇 动力工程及工程热...
- 186 篇 交通运输工程
- 120 篇 仪器科学与技术
- 80 篇 航空宇航科学与技...
- 68 篇 生物工程
- 62 篇 冶金工程
- 48 篇 土木工程
- 47 篇 安全科学与工程
- 43 篇 建筑学
- 40 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 37 篇 光学工程
1,882 篇 管理学
- 1,763 篇 管理科学与工程(可...
- 1,432 篇 工商管理
- 222 篇 图书情报与档案管...
1,773 篇 理学
- 1,452 篇 数学
- 225 篇 系统科学
- 202 篇 统计学（可授理学、...
- 149 篇 物理学
- 90 篇 生物学
- 41 篇 化学
101 篇 经济学
- 99 篇 应用经济学
65 篇 法学
- 62 篇 社会学
49 篇 医学
35 篇 农学
26 篇 教育学
24 篇 文学
5 篇 艺术学
3 篇 军事学

主题

8,556 篇 scheduling algor...
1,044 篇 scheduling
564 篇 schedules
519 篇 resource managem...
507 篇 real-time system...
482 篇 cloud computing
439 篇 throughput
414 篇 heuristic algori...
388 篇 quality of servi...
376 篇 delays
307 篇 task analysis
301 篇 dynamic scheduli...
289 篇 optimization
261 篇 computational mo...
227 篇 simulation
216 篇 energy consumpti...
206 篇 job shop schedul...
204 篇 bandwidth
197 篇 servers
193 篇 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
13 篇 buyya rajkumar
12 篇 gao hong
11 篇 anderson james h...
11 篇 xie zhiqiang
11 篇 jing liu
10 篇 wei hu
10 篇 wang wei
10 篇 li bo
10 篇 wang yi
9 篇 zhang lei
9 篇 deng qingxu
9 篇 ying lei
9 篇 hsu yu-pin
9 篇 shakkottai sanja...
9 篇 zhang jie
9 篇 li bin

语言

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

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

共 8556 条记录，以下是4901-4910 订阅

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

详细简洁

排序：

Task-set generator for schedulability analysis using the TACLeBench benchmark suite

Task-set generator for schedulability analysis using the TAC...

引用

2016 Embedded Operating Systems Workshop, EWiLi 2016

作者： De Bock, Yorick Altmeyer, Sebastian Broeckhove, Jan Hellinckx, Peter University of Antwerp Belgium Faculty of Science University of Amsterdam Netherlands

Current real-time embedded systems evolve towards complex systems using new state of the art technologies such as multi-core processors and virtualization techniques. Both technologies requires new real-time scheduling algorithms. For uniprocessor scheduling, utilization-based evaluation methodologies are common and well-established. For multicore systems and virtualization, evaluating and comparing scheduling techniques using the tasks' parameters is more realistic. Evaluating these different scheduling techniques requires relevant and standardised task sets. scheduling algorithms can be evaluated on three evaluation levels: 1) by using the mathematical model of the scheduling algorithm, 2) by simulating the scheduling algorithm and 3) by implementing the algorithm on the target platform. Generating task sets is straightforward in case of the first two levels;only the parameters of the tasks are required. Evaluating and comparing scheduling algorithms on the target platform itself, however, requires real executable tasks matching the predefined standardised task sets. Generating those executable tasks is not standardized yet. Therefore, we developed a task-set generator that generates reproducible, standardised task sets that are suitable at all levels. Beside generating the tasks' parameters, it includes an executable generator methodology that generates executables by combining publicly available benchmarks with know execution times. This paper presents and evaluates this task-set generator. The executables approximate the wanted execution time on the hardware platform.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Intelligent Time Management Recommendations Using Bayesian Optimization

Intelligent Time Management Recommendations Using Bayesian O...

引用

2024 IEEE International Conference on Communication, Computing and Signal Processing, IICCCS 2024

作者： Chandramowleeswaran, G. Sindhu, M. Alabdeli, Haider Mishra, Anshu Vinod, Priya Kaur, Harmeet Vel Tech Rangarajan Dr. Sagunthala R&d Institute of Science and Technology Department of Commerce and Business Administration Chennai600062 India Prince Shri Venkateshwara Padmavathy Engineering College Chennai India The Islamic University College Of Technical Engineering Department Of Computers Techniques Engineering Najaf Iraq The Islamic University Of Al Diwaniyah College Of Technical Engineering Department Of Computers Techniques Engineering Al Diwaniyah Iraq Ies University Ies Institute of Technology and Management Department of Computer Science & Engineering M.P. Bhopal India Christ University School Of Business And Management India Chandigarh Group of Colleges Chandigarh Engineering College Department of Computer Application Punjab Jhanjeri Mohali140307 India

ISBN: (纸本)9798350390759

This paper focuses on the improvement of the intelligent time management system which employ Bayesian optimization for suggesting time management plans for each particular person. In this sense, through historical data of input-output patterns and users' preferences, the system aims at increasing productivity and user satisfaction. In the study, Gaussian Processes are used as the surrogate model in the Bayesian optimization so that the required evaluations by the algorithm to realize optimal scheduling methodologies are kept to a minimum. Implementation is done as a web application where users submit their tasks and get the recommended schedule instantly. Indicators like, the degree of task accomplishment, time, and scheduling compliance, and probably the users' satisfaction suggest that system helped enhance time management results. Lack of feedback from the users is removed through questionnaire that reveals the simplicity of the system and the quality of its recommended times, thereby supporting the idea of Bayesian optimization as a game changer in the management of time. This research significance points to the need for maintaining efficient and individualized approaches to time management strategies and agrees with others' findings, which suggest that this is an area ample fiction research needs to acknowledge and pursue. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy consumption of algorithms for data retrieval from indexed parallel broadcast channels 7

Energy consumption of algorithms for data retrieval from ind...

引用

7th International Green and Sustainable Computing Conference, IGSC 2016

作者： Wisely, Michael Sarvestani, Sahra Sedigh Hurson, Ali Department of Computer Science Missouri S and T Rolla65409 United States Department of Electrical and Computer Engineering Missouri S and T Rolla65409 United States

ISBN: (纸本)9781509051175

Broadcasting over parallel channels has been shown to be an effective method for disseminating public data to mobile devices. Using recent techniques, equipped devices can leverage energy-saving modes to reduce the amount of energy consumed by wireless communication hardware. However, the use of parallel channels leads to challenges accessing concurrently broadcast data items and switching between channels both of which can incur additional energy costs and increase response time. To reduce these costs, the retrieval of data items can be scheduled in an order that reduces the required number of channel switches and repeated passes over a broadcast. Existing scheduling techniques, including Parallel Object Scan (POS) and Serial Empty Scan (SES) are able to produce optimal schedules through a broadcast on parallel channels. The energy consumed by the generated schedules has been studied previously. In this paper, we investigate the energy consumed by the execution of the POS and SES scheduling algorithms. The algorithms were executed in an emulated Android environment, where instrumentation tools were used to monitor the instructions executed by the virtualized CPU. Then, the total energy consumption for each algorithm was calculated using average energy costs per instruction. © 2016 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

PA-Tree: Polled-mode asynchronous B+ tree for NVMe 36

PA-Tree: Polled-mode asynchronous B+ tree for NVMe

引用

36th IEEE International Conference on Data Engineering, ICDE 2020

作者： Wang, Li Zhang, Zining He, Bingsheng Zhang, Zhenjie Yitu Pte. Ltd. Singapore R and D Singapore Singapore National University of Singapore Singapore Singapore

ISBN: (纸本)9781728129037

With the gaining popularity of the Non-Volatile Memory (NVM) technology, NVM express (NVMe) is now becoming the de facto interface for high-end block devices. NVMe generally enables the applications to exploit the massive internal parallelism of new-generation solid-state drives (SSDs) by issuing simultaneous I/O requests. However, existing B+ Trees are unable to maximize the utilization of NVMe hardware performance because of their synchronous execution paradigm which is incompatible with the interface of NVMe. To tackle this problem, we propose PA-Tree, an NVMe-friendly B+ Tree with a novel, polled-mode, asynchronous execution paradigm to process multiple index operations in an interleaved and asynchronous manner. Such an execution paradigm allows PA-Tree to saturate NVMe hardware with sufficient asynchronous I/O operations, while avoiding the potential overhead of excessive multi-threading. To further unleash the power of the new paradigm, we devise a new workload-aware scheduling algorithm to optimize the access to the NVMe interface based on the unique characteristic of NVMe, which enhances throughput while minimizing processing latency as well as CPU consumption. Extensive experiments on both synthetic and real workloads demonstrate that PA-Tree achieves up to 5× improvement on throughput and 30% reduction on latency against state-of-the-art solutions. © 2020 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A novel hybrid uplink bandwidth scheduler in WiMAX real time communication networks

A novel hybrid uplink bandwidth scheduler in WiMAX real time...

引用

International Conference on Ubiquitous Information Technologies and Applications

作者： Nie, Wei Xiong, Naixue Wang, Houjun School of Automation Engineering University of Electronic Science and Technology of China China Department of Computer Science Georgia State University Atlanta GA United States

ISBN: (纸本)9781424488124

As scheduling for real time polling services (rtPS) is not defined in IEEE 802.16 standard, there are various approaches described to address this issue. IEEE 802.16 has detailed documents about the QoS parameter. However, they do not mention the scheduling algorithm to be used. The essential goals of this packet scheduling scheme are to guarantee the QoS parameter as well as provide fairness among the subscriber stations. In this paper, we first use Earliest Deadline First (EDF) algorithm to schedule the real time service according to the QoS requirement. This meets maximum delay and packet loss requirements of a subscriber station in WiMax communication networks. In addition to satisfying the QoS requirements, we modify and extend the Proportional Fairness scheduling algorithm to what we call the Subscriber Stations Based Proportional Fairness (SSBPF) algorithm, which allocates remaining bandwidth fairly amongst subscriber stations. The algorithm has been implemented and evaluated in a WiMAX simulation platform developed in OPNET. From the simulation results, we can see not only the QoS requirement is satisfied, but also is fair to all subscriber stations in WiMax networks. ©2010 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Load balancing aware real-time task partitioning in multicore systems

Load balancing aware real-time task partitioning in multicor...

引用

18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012

作者： Kang, Jaeyeon Waddington, Daniel G. Computer Science Laboratory Samsung R and D Center San Jose CA United States

ISBN: (纸本)9781467330176

Real-time applications of future IT will continue to drive the demand for performance scaling in devices ranging from sensors to servers. Parallel processing in the form of mul-ticore and manycore architectures will also continue to be the principal route to unleashing next generation performance capabilities. To fully exploit multicore processors, real-time applications are expected to provide a large degree of parallel-ism, where real-time tasks can utilize multiple cores at the same time. Guaranteeing real-time performance, while making efficient use of multicore resources, requires a scheduling method that offers both high schedulability and effective load balancing. Many existing real-time scheduling methods for multicore systems focus on schedulability or load balancing, but not both - each coming at the expense of the other. In this work we develop an efficient scheduling algorithm that not only guarantees real-time performance but also demonstrates effective distribution of tasks across cores. Experimental re-sults show that our method significantly outperforms state-of-the-art approaches in terms of load balancing while still providing good schedulability. We also show the benefits with respect to energy reduction that result from balanced load. © 2012 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

LRE-TL: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines

LRE-TL: An optimal multiprocessor algorithm for sporadic tas...

引用

作者： Funk, Shelby University of Georgia AthensGA United States

This article presents a detailed discussion of LRE-TL (Local Remaining Execution-TL-plane), an algorithm that schedules hard real-time periodic and sporadic task sets with unconstrained deadlines on identical multiprocessors. The algorithm builds upon important concepts such as the TL-plane construct used in the development of the LLREF algorithm (Largest Local Remaining Execution First). This article identifies the fundamental TL-plane scheduling principles used in the construction of LLREF . These simple principles are examined, identifying methods of simplifying the algorithm and allowing it to handle a more general task model. For example, we identify the principle that total local utilization can never increase within any TL-plane as long as a minimal number of tasks are executing. This observation leads to a straightforward approach for scheduling task arrivals within a TL-plane. In this manner LRE-TL can schedule sporadic tasks and tasks with unconstrained deadlines. Like LLREF, the LRE-TL scheduling algorithm is optimal for task sets with implicit deadlines. In addition, LRE-TL can schedule task sets with unconstrained deadlines provided they satisfy the density test for multiprocessor systems. While LLREF has a O(n 2) runtime per TL-plane, LRE-TL's runtime is O(nlog∈n) per TL-plane. © 2010 Springer Science+Business Media, LLC.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive packets scheduling method for energy harvesting relay with receiver energy consumption

Adaptive packets scheduling method for energy harvesting rel...

引用

International Conference on Information, Communications and Signal Processing

作者： Zhaojie Sun Lilin Dan Yue Xiao Peibo Wen Shaoqian Li Xiaojie Wen National Key Laboratory of Science and Technology Communications University of Electronic Science and Technology of China Chengdu China National Mobile Communications Research Laboratory Southeast University Space Star Technology CO. Ltd.

In this paper, we investigate the throughput maximizing problem for a classic three-node relay communication system with a receive-and-forward relay node, which is able to harvest energy from the nature using a rechargeable battery. Besides of the energy consumption for reforwarding the received data, the energy for receiving data at the relay node is also considered. The objective is to maximize the relaying throughput, i.e., receive-and-forward data amount with the energy causality constraints. To this end, we optimize the constituent power allocation for receiving and transmitting under a deterministic energy harvesting (EH) model that the energy arrival time and the energy harvested amount are known prior to relaying. Finally, an algorithm to find the optimal power policy within the constraint of transmission deadline is presented.

关键词： Relays Resource management Throughput Wireless communication scheduling algorithms Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Trust-Based scheduling Strategy for Workflow Applications in Cloud Environment

Trust-Based Scheduling Strategy for Workflow Applications in...

引用

International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)

作者： Yuli Yang Xinguang Peng College of Computer Science and Technology Taiyuan University of Technology Taiyuan China

Current research on scheduling of workflow applications in Cloud environment is main focused on the trade-off between the execution cost and time of a task. However, unlike traditional scheduling, there are other important requirements to be taken into account. One such a requirement is trust scheduling, namely selecting trustful compute resources and data hosts so that the execution of applications. In this paper, we formulate the scheduling problem for workflow applications with trust constraints and present a novel scheduling algorithms based on trust. Experimental results illustrate that the proposed heuristic scheduling algorithm is better than the traditional algorithm for scheduling application workflows, and can find the most trusted execution flow efficiently.

关键词： Security Reliability scheduling scheduling algorithms Silicon Cloud computing

来源：评论

学校读者我要写书评

暂无评论

SEED: Confidential Big Data Workflow scheduling with Intel SGX Under Deadline Constraints

SEED: Confidential Big Data Workflow Scheduling with Intel S...

引用

IEEE International Conference on Services Computing (SCC)

作者： Ishtiaq Ahmed Saeid Mofrad Shiyong Lu Changxin Bai Fengwei Zhang Dunren Che Wayne State University Detroit Michigan USA Southern University of Science and Technology Shenzhen Guangdong China Southern Illinois University Carbondale Illinois USA

ISBN: (数字)9781728187891

ISBN: (纸本)9781728187907

Recently, cloud platforms play an essential role in large-scale big data analytics and especially running scientific workflows. In contrast to traditional on-premise computing environments, where the number of resources is bounded, cloud computing can provide practically unlimited resources to a workflow application based on a pay-as-you-go pricing model. One challenge of using cloud computing is the protection of the privacy of the confidential workflow's tasks, whose proprietary algorithm implementations are intellectual properties of the respective stakeholders. Another one is the monetary cost optimization of executing workflows in the cloud while satisfying a user-defined deadline. In this paper, we use the Intel Software Guard eXtensions (SGX) as a Trusted Execution Environment (TEE) to support the confidentiality of individual workflow tasks. Based on this, we propose a deadline-constrained and SGX-aware workflow scheduling algorithm, called SEED (SGX, Efficient, Effective, Deadline Constrained), to address these two challenges. SEED features several heuristics, including exploiting the longest critical paths and reuse of extra times in existing virtual machine instances. Our experiments show that SEED outperforms the representative algorithm, IC-PCP, in most cases in monetary cost while satisfying the given user-defined deadline. To our best knowledge, this is the first workflow scheduling algorithm that considers protecting the confidentiality of workflow tasks in a public cloud computing environment.

关键词： Cloud computing scheduling algorithms Software algorithms Big Data Virtual machining Stakeholders Task analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 487 488 489 490 491 492 493 494 495 496 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：