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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,405 篇 工学
- 3,895 篇 计算机科学与技术...
- 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,561 篇 scheduling algor...
1,047 篇 scheduling
567 篇 schedules
520 篇 resource managem...
511 篇 real-time system...
473 篇 cloud computing
439 篇 throughput
420 篇 heuristic algori...
392 篇 quality of servi...
377 篇 delays
307 篇 task analysis
304 篇 dynamic scheduli...
295 篇 optimization
261 篇 computational mo...
228 篇 simulation
217 篇 energy consumpti...
208 篇 bandwidth
205 篇 job shop schedul...
198 篇 servers
194 篇 algorithm design...

机构

26 篇 beijing universi...
24 篇 state key labora...
21 篇 university of ch...
18 篇 national mobile ...
14 篇 institute of com...
13 篇 hong kong polyte...
13 篇 purple mountain ...
12 篇 northeastern uni...
12 篇 college of compu...
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 篇 shanghai jiao to...
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,305 篇 英文
167 篇 其他
81 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8561 条记录，以下是4701-4710 订阅

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

详细简洁

排序：

Resource Allocation Optimization with Guaranteed Security Level for Anti-traceable Access 18

Resource Allocation Optimization with Guaranteed Security Le...

引用

18th IEEE Int Symp on Parallel and Distributed Proc with Applicat (ISPA) / 10th IEEE Int Conf on Big Data and Cloud Comp (BDCloud) / IEEE Int Symp on Social Comp and Networking (SocialCom) / IEEE Int Conf on Sustainable Comp and Commun (SustainCom)

作者： Jin, Bo Jin, Hao Wang, Yashen Li, Yangyang Luo, Xi Gong, Xiaoqing Yin, Xiaoyan Northwest Univ Sch Informat Sci & Technol Xian 710127 Peoples R China China Acad Elect & Informat Technol CETC Natl Engn Lab Risk Percept & Prevent RPP Beijing 100041 Peoples R China

ISBN: (纸本)9781665414852

Internet visitors can be well protected by hiding their traces. The purpose of traditional traceability is to obtain the user's IP address and physical location through some technical means. However, the essence of anti-traceability is to hide information browsing and search intention through trace hiding technology. Inspired by the PPM (Probability Packet Marking) strategy, an effective method of anti-tracing is to prevent the attacker from reconstructing the user's access path in a VPN network. We investigate a systematic study of ant-itracing to capture the relationship between resource allocation and security level guarantee in this paper. Furthermore, we propose a novel resource allocation and link scheduling algorithm with guaranteed security level. Numerical results verify that our proposed resource allocation solution can achieve good performance in terms of anti-tracing and security level guarantee.

关键词： Systematics scheduling algorithms Simulation Linearization techniques Spread spectrum communication Virtual private networks Security

来源：评论

学校读者我要写书评

暂无评论

Practical Imprecise Computation Model: Theory and Practice 17

Practical Imprecise Computation Model: Theory and Practice

引用

17th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC)

作者： Chishiro, Hiroyuki Yamasaki, Nobuyuki Keio Univ Dept Informat & Comp Sci Yokohama Kanagawa 223 Japan

ISBN: (纸本)9781479944309

We introduce the research overview of the practical imprecise computation model to achieve imprecise real-time applications. The practical imprecise computation model has multiple mandatory parts as real-time parts and multiple optional parts as non-real-time parts. We explain a new concept of real-time scheduling in the practical imprecise computation model, called semi-fixed-priority scheduling. In addition, we explain a semi-fixed-priority scheduling algorithm, called Rate Monotonic with Wind-up Part (RMWP). RMWP schedules each part in the practical imprecise computation model in Rate Monotonic order. We also introduce a real-time operating system for semi-fixed-priority scheduling algorithms, called RT-Est. We describe programming paradigms for the practical imprecise computation model in RT-Est. RT-Est has the SIM architecture for simulating real-time scheduling algorithms and the visualization tool for drawing simulation results. Finally we give future research directions for the practical imprecise computation model in theory and practice.

关键词： Computational modeling Measurement Programming Real-time systems scheduling algorithms Upper bound Imprecise Computation Real-Time scheduling Real-Time Systems Semi-Fixed-Priority scheduling Computational modeling real-time systems scheduling algorithms time schedule Programming Upper bound

来源：评论

学校读者我要写书评

暂无评论

Using run-time predictions to estimate queue wait times and improve scheduler performance 5th

Using run-time predictions to estimate queue wait times and ...

引用

5th Annual Workshop on Job scheduling Strategies for Parallel Processing held in Conjunction with the IPPS/SPDP '99 Conference

作者： Smith, W Taylor, V Foster, I Argonne Natl Lab Div Math & Comp Sci Argonne IL 60439 USA Northwestern Univ Dept Elect & Comp Engn Evanston IL 60208 USA

ISBN: (纸本)3540666761

On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this paper, we build on runtime prediction techniques that we developed in previous research to explore two problems. The first problem is to predict how long applications will wait in a queue until they receive resources. We develop runtime estimates that result in more accurate wait-time predictions than other run-time prediction techniques. The second problem we investigate is improving scheduling performance. We use run-time predictions to improve the performance of the least-work-first and backfill scheduling algorithms. We find that using our run-time predictor results in lower mean wait times for the workloads with higher offered loads and for the backfill scheduling algorithm.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Window-Based Schedule Synthesis for Industrial IEEE 802.1Qbv TSN Networks 16

Window-Based Schedule Synthesis for Industrial IEEE 802.1Qbv...

引用

16th IEEE International Conference on Factory Communication Systems (WFCS)

作者： Reusch, Niklas Zhao, Luxi Craciunas, Silviu S. Pop, Paul Tech Univ Denmark Kongens Lyngby Lyngby Denmark TTTech Computertech AG Vienna Austria

ISBN: (纸本)9781728152974

Time-Sensitive Networking (TSN) introduces standardized mechanisms that add real-time capabilities to IEEE 802.1 Ethernet networks. In particular, the Time-Aware Shaper (TAS) can be used to send frames in a deterministic fashion according to a predefined global schedule. Existing methods for generating the global communication schedule enforce isolation either in the time or in the space domain. This extended abstract presents a novel, more flexible window-based scheduling algorithm which removes the previously required isolation constraints for Scheduled Traffic (ST) by integrating worst-case delay analysis to guarantee bounded latency.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

TBER and SINR Evaluation for Interference Sensitivity Assessment in 5G NR Networks for Bands above 6 GHz 2

TBER and SINR Evaluation for Interference Sensitivity Assess...

引用

2nd International Conference on Innovative Research in Applied Science, Engineering and Technology (IRASET)

作者： Angri, Ismail Mahfoudi, Mohammed Najid, Abdellah Natl Inst Posts & Telecommun INPT Telecommun Syst Networks & Serv STRS Lab Rabat Morocco Sidi Mohamed Ben Abdellah Univ Artificial Intelligence & Data Sci & Emerging Sys Fes Morocco

ISBN: (纸本)9781665422093

For high mobility users in a 5G NR network, interference management becomes a big challenge. Efficient RRM (Radio Resource Management) plays a primary role in increasing the Signal to Interference and Noise Ratio (SINR) values, and also in decreasing signal Transport Block Error Rate (TBER). To this end, the evaluation of these two parameters actively participates in the propagation channel sensitivity prediction. Thus, radio resources allocation must be efficient and powerful. Therefore, eight scheduling algorithms were developed and programmed into the mmWave model of NS-3 simulator. The simulations were run for different types of data flows, and the achieved results were evaluated in terms of SINR and TBER. The performance of most schemes in a typical 5G NR environment is satisfactory. In terms of SINR, and for the RT (Real Time) flows, MLWDF, EXP-Rule and our algorithm EXP-MLWDF ensure more reliability compared to other schemes, with values of around 25 dB for VOIP traffic and around 30 dB for video streams, whereas PF and Max-Rate allow better values for BE flows, with achievements greater than 20 dB, which presents improvements of about 60% compared to other schemes. On the other hand, PF, EXP-PF, EXP-Rule, Log-Rule and EXP-MLWDF ensure optimal values of TBER for RT flows, by achieving stable performance with a rate of less than 0.5% for VOIP, and around 0.1% for Vi5G. These values represent a reduction of 100% compared to other scheduling strategies. For NRT (Non-RT) flows, EXP-Rule and MLWDF have the best achievements and they quickly reach stability, with values between 0.4 and 1.4%, which represents an improvement of 70% in comparison with the concurrent schemes.

关键词： BLER flexible numerology interference management New Radio (NR) Radio Resource Management (RRM) scheduling algorithms SINR TBER 5G

来源：评论

学校读者我要写书评

暂无评论

Ant algorithms for the exam timetabling problem

Ant algorithms for the exam timetabling problem

引用

6th International Conference on Practice and Theory of Automated Timeabling

作者： Eley, Michael Aschaffenburg Univ Appl Sci Logist Lab Aschaffenburg Germany

ISBN: (纸本)9783540773443

scheduling exams at universities can be formulated as a combinatorial optimization problem. Basically one has to schedule a certain number of exams in a given number of time periods so that a predetermined objective function is minimized. In particular, the objective function penalizes schedules where students have to write exams in consecutive periods or even in the same period. Ant colony approaches have been demonstrated to be a powerful solution approach for various combinatorial optimization problems. This paper presents two ant colony approaches for the exam timetabling problem, a Max-Min and an ANTCOL approach. Using the Toronto benchmark test cases from the literature, both algorithms arc compared to other timetabling heuristics. Finally, the Max-Min and ANTCOL algorithms are compared using the same set of test cases. In spite of some shortcomings, the ANTCOL approach turned out to be a worthwhile algorithm, among the best currently in use for examination timetabling.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Appropriate control of wireless networks with flow level dynamics

Appropriate control of wireless networks with flow level dyn...

引用

42nd Annual Conference on Information Sciences and Systems

作者： Le, Long Mazumdar, Ravi R. Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781424422463

We consider the network control problem for wireless networks with How level dynamics under the general k-hop interference model. In particular, we investigate the control problem in low load and high load regimes. In the low load regime, we show that the network can be stabilized by a regulated maximal scheduling policy considering flow level dynamics if the offered load satisfies a constraining bound condition. Because maximal matching is a general scheduling rule whose implementation is not specified, we propose a constant-time and distributed scheduling algorithm for a general k-hop interference model which can approximate the maximal scheduling policy within an arbitrarily small error. Under the stability condition, we show how to calculate transmission rates for different user classes such that the long-term (time average) network utility is maximized. Our results imply that congestion control is unnecessary when the offered load is low and optimal user rates can be determined to maximize users' long-term satisfaction. In the high load regime where the network can be unstable under the regulated maximal scheduling policy, we propose the cross-layer congestion control and scheduling algorithm which can stabilize the network under arbitrary network load. Through numerical analysis for some typical networks, we show that the proposed scheduling algorithm has much lower overhead than other existing queue-length-based constant-time scheduling schemes in the literature, and it achieves performance much better than the guaranteed bound. In addition, using congestion control in the low load condition results in much lower average utility compared to that due to the optimal transmission rate derived in the paper.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Support for fine grained dependent tasks in OpenMP 1

引用

3rd International Workshop on OpenMP (IWOMP)

作者： Sinnen, Oliver Pe, Jsun Kozlov, Alexei Vladimirovich Univ Auckland Dept Elect & Comp Engn Auckland 1 New Zealand

ISBN: (数字)9783540693031

ISBN: (纸本)9783540693024

OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less powerful and the sections construct lacks support for dependences and fine grained tasks. This paper proposes a new work-sharing construct, tasks, which is a generalisation of sections. It goes beyond sections by allowing unbalanced and finer grained tasks with arbitrary dependence structure. A proof-of-concept compiler has been implemented for the new directives, which includes a state-of-the-art scheduling algorithm for task graphs. Experiments with a large set of programs were conducted using the new directives. The results demonstrate that the new approach can efficiently exploit the task parallelism inherent in the code, without introducing any additional overhead.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

HyF2FS: A Filesystem to Fully Exploit the Parallelism of Hybrid Storage 41

HyF2FS: A Filesystem to Fully Exploit the Parallelism of Hyb...

引用

41st IEEE International Conference on Computer Design (ICCD)

作者： Zhang, Jintong Chen, Jianxi Liu, Kezheng Zhuo, Yongkang Yuan, Panfei Huazhong Univ Sci & Technol Wuhan Natl Lab Optoelect Wuhan Hubei Peoples R China

ISBN: (纸本)9798350342918

Hybrid storage systems can fully leverage the advantages of multiple devices to achieve better performance. However, current systems are designed primarily for a slow disk with an expensive fast device at high costs. They ignore device features and workload status while placing data. The issue of cache pollution is affecting their data hotness identification. Besides, inconsistent load status in multiple devices is overlooked during migration. These shortcomings constrain the overall performance of the system. To solve this, we propose HyF2FS, a hybrid storage filesystem based on F2FS. HyF2FS features a cache-tiering integrated architecture that stores hot data and metadata in an accelerator while asynchronously migrating cold data to the SSD, which provides cost-effective opportunities to optimize device parallelism. HyF2FS uses multidimensional scores to place data on the appropriate device to achieve high bandwidth. To improve data hotness identification, HyF2FS proposes two-level counters. Besides, a migration window is employed to minimize the impact of migration on foreground I/O. By implementing these scheduling algorithms, HyF2FS can fully exploit the parallelism of both fast and slow devices. Experimental results demonstrate significant improvements in throughput (116%-244%) and latency reduction (49%-64%) compared to F2FS and other hybrid storage systems.

关键词： hybrid storage filesystem parallelism scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A flexible real-time locking protocol for multiprocessors

A flexible real-time locking protocol for multiprocessors

引用

13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

作者： Block, Aaron Leontyev, Hennadiy Brandenburg, Bjoern B. Anderson, James H. Univ N Carolina Dept Comp Sci Chapel Hill NC 27515 USA

ISBN: (纸本)9780769529752

Real-time scheduling algorithms for multiprocessor systems have been the subject of considerable recent interest. For such an algorithm to be truly useful in practice, support for semaphore-based locking must be provided. However for man), global scheduling algorithms, no such mechanisms have been proposed. Furthermore, in the partitioned case, most prior semaphore schemes are either inefficient or restrict critical sections considerably In this paper a new flexible multiprocessor locking scheme is presented that can be applied under both partitioning and global scheduling. This scheme allows unrestricted critical-section nesting, but has been designed to deal with the common case of short non-nested accesses efficiently.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 467 468 469 470 471 472 473 474 475 476 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：