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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,405 篇 工学
- 3,896 篇 计算机科学与技术...
- 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,577 篇 scheduling algor...
1,050 篇 scheduling
568 篇 schedules
525 篇 resource managem...
520 篇 real-time system...
474 篇 cloud computing
442 篇 throughput
425 篇 heuristic algori...
392 篇 quality of servi...
378 篇 delays
309 篇 dynamic scheduli...
307 篇 task analysis
303 篇 optimization
262 篇 computational mo...
229 篇 simulation
217 篇 energy consumpti...
208 篇 bandwidth
205 篇 job shop schedul...
199 篇 servers
194 篇 algorithm design...

机构

26 篇 beijing universi...
24 篇 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...
10 篇 school of automa...
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,321 篇 英文
167 篇 其他
81 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

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

共 8577 条记录，以下是4551-4560 订阅

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

详细简洁

排序：

Performance and power efficient task scheduling in VFI-based multi-core systems

Performance and power efficient task scheduling in VFI-based...

引用

International Green Computing Conference

作者： Ehsan Mohandesi Lauren Hiland Shervin Hajiamini Behrooz Shirazi Electrical Engineering and Computer Science Department Washington State University Pullman USA

ISBN: (纸本)9781509001736

With voltage frequency islanding (VFI) we are able to change the voltage and frequency of the processors to save power within a certain performance constraint. In this work we want to maximize potential power savings and minimize time penalty by means of efficient task scheduling in VFIs. A new scheduling algorithm is presented which schedules the tasks onto the processing cores in the VFI by ranking them based on the computation load and communication load among other tasks. The mapping of the tasks is relevant to the processing speed of the cores and the simulation results show improvements compared to the default task scheduler of Linux.

关键词： Time-frequency analysis scheduling algorithms Multicore processing Energy consumption Program processors Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Abstraction of abstraction - an outline of general scheduling platform for space missions, part II

Abstraction of abstraction - an outline of general schedulin...

引用

International Conference on Information and Automation (ICIA)

作者： Hua Zhu Jinjiang Xing Xuemei Zou Jian Li Beijing Aerospace Control Center Beijing P.R. China

ISBN: (纸本)9781467391054

For designing a general scheduling platform, this part of paper discusses logic and process abstraction that can be implemented to different kind of space missions. A logic model extension solution is given to allow defining specific mission related data patterns with custom manipulation methods. The scheduling elements, requirement, inputs and outputs are organized in one solution for estimation and verification. All the scheduling constrains are abstracted into expressions for simplification. A protocol is proposed for reinforcement heuristic algorithms besides internal ones, with which the process of problem solving is controllable. With the basic abstraction methods, a common framework capable for general space mission scheduling is set up, ensuring the general mission scheduling platform with great flexibility and extensibility.

关键词： scheduling Cameras Space missions Orbits Space vehicles scheduling algorithms Data models

来源：评论

学校读者我要写书评

暂无评论

Quantifying the Exact Sub-optimality of Non-preemptive scheduling

Quantifying the Exact Sub-optimality of Non-preemptive Sched...

引用

Real-Time Systems Symposium (RTSS)

作者： Robert I. Davis Abhilash Thekkilakattil Oliver Gettings Radu Dobrin Sasikumar Punnekkat Real-Time Syst. Res. Group Univ. of York Paris France Malardalens Hogskola Vasteras SE

Fixed priority scheduling is used in many real-time systems, however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive Earliest Deadline First (EDF-P). In this paper, we investigate the sub-optimality of fixed priority non-preemptive scheduling. Specifically, we derive the exact processor speed-up factor required to guarantee the feasibility under FP-NP (i.e. schedulablability assuming an optimal priority assignment) of any task set that is feasible under EDF-P. As a consequence of this work, we also derive a lower bound on the sub-optimality of non-preemptive EDF (EDF-NP), which since it matches a recently published upper bound gives the exact sub-optimality for EDF-NP. It is known that neither preemptive, nor non-preemptive fixed priority scheduling dominates the other, i.e., there are task sets that are feasible on a processor of unit speed under FP-P that are not feasible under FP-NP and vice-versa. Hence comparing these two algorithms, there are non-trivial speedup factors in both directions. We derive the exact speed-up factor required to guarantee the FP-NP feasibility of any FP-P feasible task set. Further, we derive upper and lower bounds on the speed-up factor required to guarantee FP-P feasibility of any FP-NP feasible task set. Empirical evidence suggests that the lower bound may be tight, and hence equate to the exact speed-up factor in this case.

关键词： scheduling algorithms Real-time systems scheduling Schedules Measurement Upper bound

来源：评论

学校读者我要写书评

暂无评论

Efficient and low-complexity scheduling algorithm in a multi-user heterogeneous traffic scenario

Efficient and low-complexity scheduling algorithm in a multi...

引用

IEEE International Conference on Telecommunications and Malaysia Communications (ICT-MICC)

作者： Olalekan Bello Hushari Zen Al-Khalid Othman Khairuddin Abd Hamid Dept. of Electrical & Electronic Engineering University of Malaysia Sarawak Malaysia University Malaysia of Computer Science and Engineering Putrajaya Malaysia

In this paper, we propose a utility-based scheduling framework to maximize and improve the users' quality-of-service (QoS) satisfaction in broadband wireless access system. The scheduling framework comprises of three novel radio resource allocation (RRA) techniques; delay-based scheduling policy for real-time (RT) services using a sigmoid-like utility function, minimum-rate-based scheduling policy for non-real-time (NRT) services which obeys the law of diminishing marginal utility and a throughput-based scheduling policy for best-effort (BE), also based on the law of diminishing marginal utility but without a minimum rate requirement. The proposed algorithm, called maximum QoS satisfaction (MQS), is efficient and of low complexity as it specifies only a single parameter for different class of services. To prove its efficiency, we compare it with the delay-based satisfaction maximization and throughput-based satisfaction maximization (DSM/TSM), which exhibits similar characteristics in terms of resource allocation objectives. System-level simulation results demonstrate that the MQS achieves superior user call satisfaction performances in a multi-user heterogeneous traffic scenario.

关键词： Quality of service Delays Resource management scheduling algorithms Optimization Streaming media Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

scheduling of mixed-criticality systems with RUN

Scheduling of mixed-criticality systems with RUN

引用

International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Romain Gratia Thomas Robert Laurent Pautet IRT SystemX Palaiseau France Institut Mines-Telecom Paris France

Mixed-criticality systems emerged with the aim of reconciling safety requirements and efficient use of multi-processor or uniprocessor platforms. On multi-processors, recent works on mixed-criticality have produced impressive results in terms of speed-up factor. But these solutions, based on Pfair-like scheduling algorithms, entail too many preemptions and migrations to be effectively used in real systems. As RUN is an optimal scheduling algorithm that is known to limit this problem, we propose MxC-RUN, an adaptation of RUN to mixed-criticality systems. We redefine RUN's primal servers as modal servers that allocate the overestimated time budget of their higher criticality tasks to execute lower criticality ones. These servers can be handled by RUN without any modification and preserve its performances in terms of preemptions and migrations. MxC-RUN earns a speed-up factor smaller than other multi-processors EDF-based mixed-criticality scheduling algorithms.

关键词： Servers Yttrium scheduling algorithms Schedules Optimal scheduling Timing

来源：评论

学校读者我要写书评

暂无评论

Uncoordinated scheduling strategies for BAN-to-BAN interference mitigation

Uncoordinated scheduling strategies for BAN-to-BAN interfere...

引用

International Black Sea Conference on Communications and Networking (BlackSeaCom)

作者： Martina Barbi Kamran Sayrafian Mehdi Alasti Information Technology Laboratory National Institute of Standards & Technology USA Global Technology Associates USA

A Body Area Network (BAN) is a radio standard for wireless connectivity of wearable and implantable sensors located inside or in close proximity to the human body. Medical and some other applications impose stringent constraints on battery powered BAN reliability, quality of service, and power consumption. However, lack of coordination among multiple colocated BANs in the current BAN standard may cause unacceptable deterioration of BAN reliability and quality of service due to high levels of inter-BAN interference. Assuming Time Division Multiple Access (TDMA), this paper proposes inter-BAN interference mitigation using several novel uncoordinated transmission scheduling algorithms. These algorithms use patterns of past and current interference for implicit coordination across multiple BAN transmissions. Simulation results demonstrate improvement in the performance and potential benefits of the proposed strategies.

关键词： Interference Body area networks Conferences Sensors scheduling algorithms Standards Reliability

来源：评论

学校读者我要写书评

暂无评论

Decision-based link scheduling approximation algorithm with SINR relaxation for wireless mesh network

Decision-based link scheduling approximation algorithm with ...

引用

International Conference on Computer, Control, Informatics and Its Applications (IC3INA)

作者： Nachwan Mufti Adriansyah Muhamad Asvial Bagio Budiardjo Electrical Engineering Department Universitas Indonesia Depok Indonesia Universitas Indonesia Depok Jawa Barat ID

The crucial issue in the design of resource allocation algorithms for wireless mesh network is computational complexity. A high capacity algorithm with low computational complexity is desired, especially for dynamic topology adaptation in mobile mesh networks and also for the issue of low energy consumption. This paper proposes a new approach in the designing of a low complexity spatial time division multiple access link scheduling algorithm for wireless mesh network. In this paper, link scheduling is considered as a decision-making problem. This approach is contrary to physical interference model that requires SINR evaluation in global network. We propose the mesh coverage probability as a new performance metric in the design of mesh link scheduling algorithm. Based on this approach, we provide the tradeoff between spatial reuse and mesh coverage probability, which can be used as a benchmark in the design of scheduling algorithms for wireless mesh network.

关键词： Interference scheduling Wireless mesh networks Algorithm design and analysis Signal to noise ratio scheduling algorithms Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Priority-Based Dynamic Web Requests scheduling for Web Servers over Content-Centric Networking

A Priority-Based Dynamic Web Requests Scheduling for Web Ser...

引用

IEEE Workshop on Hot Topics in Web Systems and Technologies, HOTWEB

作者： Yukai Tu Xiuquan Qiao Guoshun Nan Junliang Chen Shasha Li State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781467396899

Content-Centric Networking (CCN) facilitates the content distribution for static Web applications due to its in-network caching. However, when it comes to dynamic Web request, the original fair scheduling of Interest packets on the CCN Web server (i.e. without differentiating a new service request and the service requests being processed) increases the mean response time, resulting in a decrease of service performance. To address this problem, we present a Priority-based Dynamic Web Requests scheduling (called PBDRS) for CCN Web server. We first increase the priority of the subsequent Interest packet requests belonging to dynamic Web requests being processed, based on the first-come-first-served strategy. Then, services with small-size response data are also scheduled to a higher priority, leveraging the shortest remaining processing time (SRPT) scheduling policy. To validate the proposed approach, we implemented the proposed PBDRS mechanism in our existing CCN Web server and conducted the performance evaluation experiments based on a real dataset crawled from three popular dynamic Web sites of China in a trace-driven way. Experimental results indicate that PBDRS outperforms existing fair scheduling approach of Interest packets in terms of the mean response time.

关键词： Web servers Time factors Dynamic scheduling Browsers scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy efficient scheduling in LTE-advanced for Machine Type Communication

Energy efficient scheduling in LTE-advanced for Machine Type...

引用

International Conference and Workshop on Computing and Communication (IEMCON)

作者： Basel Barakat Kamran Arshad Department of Engineering Science University of Greenwich United Kingdom

Machine Type Communication (MTC) is gaining an enormous interest among communication industry and academia all around the world. The variety of services offered by MTC is expected to significantly increase the number of MTC Devices (MTCD) on wireless networks. The huge number of MTCD poses several challenges to cellular network operators such as efficient radio resource management, energy efficiency (EE) etc. Two main radio resource management techniques to support MTC over 4G Long Term Evolution (LTE) were proposed in the literature: Group Based scheduling (GBS) and Time Granularity scheduling (TGS). In this paper, we compare the EE of GBS and TGS by formulating a general expression for the downlink transmit power by eNodeB. The numerical results show that the GBS is more energy efficient that TGS under given quality of service constraints.

关键词： Quality of service Throughput Interference Signal to noise ratio Job shop scheduling scheduling algorithms Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Node-based scheduling with provable evacuation time

Node-based scheduling with provable evacuation time

引用

Annual Conference on Information Sciences and Systems (CISS)

作者： Bo Ji Jie Wu Department of Computer and Information Sciences Temple University Philadelphia PA

ISBN: (纸本)9781479984299

This paper studies the link scheduling problem in multihop wireless networks without future packet arrivals, with an aim of minimizing the time interval needed for evacuating all the existing packets. We consider the scenario with single-hop traffic flows under the one-hop interference model. In this setting, the minimum evacuation time problem is equivalent to the classic multigraph edge coloring problem, which is generally NP-hard. Although many approximation algorithms have been studied, almost all of them require computing the schedules (or the colors) all at once, and thus have a complexity that is dependent on the number of packets in the network. This, however, renders these algorithms unsuitable for the considered application of link scheduling for packet evacuation, as they typically incur an impractically high complexity when there are a large number of initial packets waiting to be transmitted, even if the underlying network has a small size (i.e., the node count and the link count). Instead, it is desirable to compute the schedules (or the colors) in an online fashion, i.e., to quickly compute one schedule at a time. Unfortunately, none of the existing online algorithms can guarantee an approximation ratio better (or smaller) than 2. To that end, in this paper we suggest two scheduling algorithms using a node-based approach, and prove that their approximation ratios are both no worse (or greater) than 3/2. In addition, these scheduling algorithms can also serve as an alternative for achieving Shannon's bound, which is well known in the graph coloring literature.

关键词： Approximation algorithms Approximation methods Complexity theory scheduling algorithms Schedules Color scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 452 453 454 455 456 457 458 459 460 461 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：