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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,034 篇 会议
716 篇 期刊文献
9 篇 学位论文
5 册 图书

馆藏范围

10,764 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,393 篇 工学
- 1,176 篇 计算机科学与技术...
- 883 篇 电气工程
- 679 篇 信息与通信工程
- 296 篇 软件工程
- 277 篇 电子科学与技术（可...
- 221 篇 控制科学与工程
- 200 篇 仪器科学与技术
- 151 篇 机械工程
- 60 篇 交通运输工程
- 24 篇 材料科学与工程（可...
- 23 篇 网络空间安全
- 22 篇 石油与天然气工程
- 17 篇 光学工程
- 16 篇 动力工程及工程热...
- 16 篇 航空宇航科学与技...
- 7 篇 土木工程
- 6 篇 测绘科学与技术
- 4 篇 化学工程与技术
252 篇 管理学
- 247 篇 管理科学与工程(可...
- 6 篇 工商管理
- 6 篇 图书情报与档案管...
172 篇 理学
- 67 篇 系统科学
- 58 篇 物理学
- 30 篇 数学
- 15 篇 化学
- 9 篇 生物学
48 篇 文学
- 48 篇 新闻传播学
16 篇 医学
- 12 篇 临床医学
9 篇 经济学
- 7 篇 应用经济学
9 篇 军事学
- 9 篇 军队指挥学
5 篇 教育学
1 篇 法学

主题

10,764 篇 scheduling algor...
4,069 篇 processor schedu...
2,048 篇 delay
1,652 篇 throughput
1,569 篇 algorithm design...
1,380 篇 computer science
1,311 篇 resource managem...
1,305 篇 real time system...
1,298 篇 quality of servi...
1,176 篇 bandwidth
1,091 篇 traffic control
970 篇 job shop schedul...
949 篇 dynamic scheduli...
787 篇 costs
742 篇 telecommunicatio...
698 篇 switches
681 篇 optimal scheduli...
588 篇 application soft...
587 篇 heuristic algori...
526 篇 hardware

机构

40 篇 department of el...
32 篇 department of co...
30 篇 department of co...
30 篇 department of co...
30 篇 department of el...
30 篇 department of co...
29 篇 department of el...
29 篇 scuola superiore...
26 篇 department of co...
24 篇 department of co...
24 篇 school of electr...
23 篇 department of co...
22 篇 department of co...
22 篇 department of co...
22 篇 mitre corporatio...
22 篇 beijing universi...
21 篇 institute of com...
19 篇 department of el...
19 篇 bell laboratorie...
18 篇 department of el...

作者

30 篇 m. hamdi
26 篇 tei-wei kuo
25 篇 e. leonardi
21 篇 e.h.-m. sha
19 篇 sanjoy baruah
19 篇 f. neri
19 篇 klaus i. pederse...
18 篇 k.g. shin
18 篇 james h. anderso...
17 篇 p. giaccone
17 篇 maode ma
17 篇 v.o.k. li
16 篇 jian-jia chen
16 篇 n.k. jha
16 篇 kwei-jay lin
16 篇 d. mosse
15 篇 j.a. stankovic
15 篇 i. ahmad
15 篇 j.w.s. liu
15 篇 r. srikant

语言

10,619 篇 英文
87 篇 其他
58 篇 中文

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

共 10764 条记录，以下是4981-4990 订阅

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

详细简洁

排序：

A Branch and bound for 1|ri| wiCi, scheduling Problem

A Branch and bound for 1|ri| wiCi, Scheduling Problem

引用

Computational Engineering in Systems Applications, CESA, IMACS Multiconference on FLAGGED

作者： Rabia Nessah Chengbin Chu Farouk Yalaoui Imed Kacem Institut Charles Delaunay-OSI Universite de Technologie de Troyes France

In this paper, we consider a single machine scheduling problem with release dates. The objective is to minimize the total completion time. This problem is know to be strongly NP-hard. We propose two new lower bounds that can be computed in O(n 2 ) and in O(n log n) time respectively. We also propose some dominance properties. A branch-and-bound algorithm in which the lower bounds and the dominance properties are incorporated is proposed and tested on a large set of instances

关键词： Processor scheduling Single machine scheduling Systems engineering and theory scheduling algorithm Open systems Testing Linear programming Lagrangian functions Polynomials

来源：评论

学校读者我要写书评

暂无评论

Static and dynamic scheduling of sporadic tasks for single-processor systems

Static and dynamic scheduling of sporadic tasks for single-p...

引用

Euromicro Conference on Real-Time Systems

作者： S. Baruah L. Rosier D. Varvel Department of Computer Sciences University of Texas Austin Austin TX USA

Sporadic tasks in hard-real-time systems, as defined by Mok (1983, 1988, 1989), are characterized by triples (e,d,p), 1 >

关键词： Dynamic scheduling scheduling algorithm Hardware Scalability Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

On-line scheduling on uniform multiprocessors

On-line scheduling on uniform multiprocessors

引用

Real-Time Systems Symposium (RTSS)

作者： S. Funk J. Goossens S. Baruah North Carolina State University Chapel Hill NC USA Université Libre de Bruxelles Brussels Belgium

ISBN: (纸本)0769514200

Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s/spl times/t) units of execution. The on-line scheduling of hard-real-time systems, in which all jobs must complete by specified deadlines, on uniform multiprocessor machines is considered It is known that online algorithms tend to perform very poorly in scheduling such hard-real-time systems on multiprocessors; resource-augmentation techniques are presented here that permit online algorithms to perform better than may be expected given the inherent limitations. Results derived here are applied to the scheduling of periodic task systems on uniform multiprocessor machines.

关键词： Processor scheduling Parallel machines Concurrent computing scheduling algorithm Resumes Taxonomy Real time systems

来源：评论

学校读者我要写书评

暂无评论

A New approach in on-line task scheduling for reconfigurable computing systems

A New approach in on-line task scheduling for reconfigurable...

引用

International Conference on Application Specific Systems (ASAP), Architectures and Processors

作者： Maisam Mansub Bassiri Hadi Shahriar Shahhoseini Department of Electrical Engineering Iran University of Science and Technology Tehran Iran

Reconfiguration overhead is an important obstacle that limits the performance of on-line scheduling algorithms in reconfigurable computing systems and increases the overall execution time. Configuration reusing (task reusing) can decrease reconfiguration overhead considerably, particularly in periodic applications. In this paper, we present a new approach for on-line scheduling and placement in which configuration reusing is considered as a main characteristic in order to reduce reconfiguration overhead and decrease total execution time of the tasks. A large variety of experiments have been conducted on the proposed algorithm. Obtained results show considerable improvement in overall execution time of the tasks.

关键词： Processor scheduling scheduling algorithm Operating systems Resource management Field programmable gate arrays Runtime Probability distribution Surface finishing Cryptography

来源：评论

学校读者我要写书评

暂无评论

Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems

Slack-based global multiprocessor scheduling of aperiodic ta...

引用

ACS/IEEE International Conference on Computer Systems and Applications

作者： Lars Lundberg Hakan Lennerstad Department of Systems and Software School of Engineering Blekinge Institute of Technology Ronneby Sweden

We provide a constant time schedulability test and priority assignment algorithm for an on-line multiprocessor server handling aperiodic tasks. Dhall's effect is avoided by dividing tasks in two priority classes based on their utilization: heavy and light. The improvement in this paper is due to assigning priority of light tasks based on slack - not on deadlines. We prove that if the load on the multiprocessor stays below (3 - radic5)/2 ap 38.197%, the server can accept an incoming aperiodic task and guarantee that the deadlines of all accepted tasks will be met. This is better than the current state-of- the-art algorithm where the priorities of light tasks are based on deadlines (the corresponding bound is in that case 35.425%).

关键词： Processor scheduling Real time systems scheduling algorithm Delay Embedded software Software systems Software testing System testing Software algorithms Admission control

来源：评论

学校读者我要写书评

暂无评论

Laxity threshold polling for scalable real-time/non-real-time scheduling

Laxity threshold polling for scalable real-time/non-real-tim...

引用

International Conference on Computer Networks and Mobile Computing (ICCNMC)

作者： R.A. Lackman Xu Jian Computer Science Department Ocean University of China Qingdao China

Minimum Laxity Threshold scheduling has been found by several authors to give a near optimal trade-off between soft-real-time loss rate due to expired deadline and non-real-time average delay. By varying the threshold of the scheduling algorithm the real-time/non-real-time quality of service trade-off may be adjusted. In this paper an approximation is proposed to minimum deadline threshold scheduling. By means of discrete event simulation the approximation is demonstrated to come close to minimum deadline threshold scheduling in its performance. This approximation has the advantage of giving better scalability than minimum laxity threshold. It also has the advantage of not requiring a single queue that must be scheduled so it is usable for distributed applications.

关键词： Traffic control Processor scheduling Telecommunication traffic scheduling algorithm Computer networks Wireless application protocol Delay Discrete event simulation Application software Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Multiuser scheduling in Downlink MIMO Systems Using Particle Swarm Optimization

Multiuser Scheduling in Downlink MIMO Systems Using Particle...

引用

IEEE Conference on Wireless Communications and Networking

作者： Yong-qiang Hei Xiao-Hui Li Ke-Chu Yi Xiong Li State Key Lab. of Integrated Services Networks Univ. of Shaanxi Xi'an

In this paper, a novel scheduling strategy based on particle swarm optimization (PSO) algorithm is proposed for the downlink of multiuser MIMO systems. By means of PSO searching mechanism, this scheduling algorithm mainly seeks the optimal "particle", i.e. the best scheduled user group, to maximize the system capacity. Besides, a new approach to associate the possible scheduled candidates by "particles" in PSO is also presented. Simulation results reveal that the proposed PSO strategy achieves nearly the same performance to the exhaustive search (ES) algorithm in terms of capacity performance, but with lower complexity. The convergence analysis is also presented to give a guideline in determining the parameters to keep the PSO convergent.

关键词： Downlink MIMO Particle swarm optimization scheduling algorithm Convergence Base stations Frequency Fading Linear antenna arrays Communications Society

来源：评论

学校读者我要写书评

暂无评论

Directional Relay with Spatial Time Slot scheduling for mmWave WPAN Systems

Directional Relay with Spatial Time Slot Scheduling for mmWa...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Zhou Lan Junyi Wang Jing Gao Chin-Sean Sum Fumihide Kojima Tuncer Baykas Hiroshi Harada Shuzo Kato National Institute of Information and Communications Technology Yokosuka Kanagawa Japan

In this paper, we propose a spacial time slot scheduling algorithm for relay operation to improve the throughput performance of millimeter-wave wireless personal area network (mmWave WPAN) systems which employ directional antenna. The upcoming mmWave WPAN is designed for high definition TV (HDTV) transmission, high speed wireless docking and gaming, etc. Based on the fact that the significant path loss of millimeter-wave environments provides good space isolation, we have proposed a coexistence mechanism by sharing time slots for relay with direct transmission to guarantee throughput for the above data-rate-greedy applications. This paper is an extension that addresses spacial time slot scheduling for relay operation taking the effect of directional antenna into consideration. We model the throughput maximization with scheduling as an integer optimization and solve it by transforming the problem to a max-weight matching problem of a bipartite graph. We propose a scheduling algorithm based on the Kuhn-Munkres algorithm which can be used to solve the max weight matching problem. Simulation results show that there is up to 25% throughput improvement achieved compared with random scheduling method.

关键词： Relays Throughput scheduling algorithm Millimeter wave technology Directional antennas HDTV Wireless personal area networks TV Propagation losses Bipartite graph

来源：评论

学校读者我要写书评

暂无评论

A simulation model of task cluster scheduling in distributed systems

A simulation model of task cluster scheduling in distributed...

引用

IEEE Workshop on Future Trends of Distributed Computing Systems

作者： H.D. Karatza Department of Informatics Aristotle University of Thessaloniki Thessaloniki Greece

This paper addresses issues of task clustering-the coalition of several fine grain tasks into single coarser grain tasks called task clusters-and task cluster scheduling on distributed processors. The performance of various scheduling schemes is studied and compared for a variety of workloads. Simulation results indicate that the scheduling policy that gives priority to the cluster with the smallest cumulative service demand of all its tasks performs better than the other policies examined.

关键词： Processor scheduling Cost function Informatics Partitioning algorithms Clustering algorithms scheduling algorithm Resource management Multitasking Clustering methods

来源：评论

学校读者我要写书评

暂无评论

scheduling with global information in distributed systems

Scheduling with global information in distributed systems

引用

International Conference on Distributed Computing Systems

作者： F. Petrini Wu-Chun Feng Computing Information and Communications Division Los Alamos National Laboratory Los Alamos NM USA School of Electrical & Computer Engineering Purdue University West Lafayette IN USA

Buffered coscheduling is a distributed scheduling methodology for time-sharing communicating processes in a distributed system, e.g., PC cluster. The principle mechanisms involved in this methodology are communication buffering and strobing. With communication buffering, communication generated by each processor is buffered and performed at the end of regular intervals (or time slices) to amortize communication and scheduling overhead. This regular communication structure is then leveraged by introducing a strobing mechanism which performs a total exchange of information at the end of each time slice. Thus, a distributed system can rely on this global information to more efficiently schedule communicating processes rather than rely on isolated or implicit information gathered from local events between processors. We describe how buffered coscheduling is implemented in the context of our SMART simulator. We then present performance measurements for two synthetic workloads and demonstrate the effectiveness of buffered coscheduling under different computational granularities, context-switch times and time-slice granularities.

关键词： Processor scheduling Time sharing computer systems Laboratories Operating systems scheduling algorithm Read only memory Identity-based encryption Computational modeling Context modeling Measurement

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：