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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

10,726 篇 scheduling algor...
4,056 篇 processor schedu...
2,043 篇 delay
1,646 篇 throughput
1,565 篇 algorithm design...
1,380 篇 computer science
1,302 篇 resource managem...
1,301 篇 real time system...
1,291 篇 quality of servi...
1,170 篇 bandwidth
1,086 篇 traffic control
968 篇 job shop schedul...
945 篇 dynamic scheduli...
782 篇 costs
735 篇 telecommunicatio...
691 篇 switches
677 篇 optimal scheduli...
588 篇 application soft...
582 篇 heuristic algori...
520 篇 hardware

机构

40 篇 department of el...
32 篇 department of co...
30 篇 department of co...
30 篇 department of el...
30 篇 department of co...
29 篇 department of el...
29 篇 scuola superiore...
29 篇 department of co...
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,585 篇 英文
83 篇 其他
58 篇 中文

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

共 10726 条记录，以下是4881-4890 订阅

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

详细简洁

排序：

Chemical Reaction Optimization for the Grid scheduling Problem

Chemical Reaction Optimization for the Grid Scheduling Probl...

引用

IEEE International Conference on Communications (ICC)

作者： J. Xu A. Y. S. Lam V. O. K. Li Department of Electrical and Electronic Engineering University of Hong Kong Hong Kong China

Grid computing collects geographically dispersed resources ranging from laptops to supercomputers to compute tasks requested by clients. Grid scheduling, i.e., assigning tasks to resources, is an NP-hard problem, and thus, metaheuristic methods are employed to find the optimal solutions. In this paper, we propose a Chemical Reaction Optimization (CRO) algorithm for the grid scheduling problem. CRO is a population-based metaheuristics mimicking the interactions between molecules in a chemical reaction. We compare the CRO approach with four generally acknowledged metaheuristics, and show that CRO performs the best.

关键词： Chemicals Processor scheduling Peer to peer computing Grid computing Geographic Information Systems scheduling algorithm Ant colony optimization Communications Society Supercomputers Registers

来源：评论

学校读者我要写书评

暂无评论

Static-priority periodic scheduling on multiprocessors

Static-priority periodic scheduling on multiprocessors

引用

Real-Time Systems Symposium (RTSS)

作者： S. Ramamurthy M. Moir IBM Transarc Laboratories Pittsburgh PA USA Sun MicroSystems Laboratories Inc. Burlington MA USA

Presents a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling scheme. Like a previous condition due to S. Baruah et al. (1996), our condition actually determines pfair schedulability. Pfairness requires that the schedule, in addition to being periodic, schedules each task at an approximately even rate. Our condition improves on the previous one in two important ways. First, it can determine that task sets with both high utilization and many tasks are schedulable, while the previous condition cannot. Second, our condition applies to both uniprocessors and multiprocessors, while the previous condition applies only to uniprocessors. We present simulations that show that our condition is highly accurate for many cases of interest.

关键词： Processor scheduling scheduling algorithm Dynamic scheduling Engineering profession Sun Process control Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A timed Petri net approach for pre-runtime scheduling in partial and dynamic reconfigurable systems

A timed Petri net approach for pre-runtime scheduling in par...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： R. Eskinazi M.E. Lima P.R.M. Maciel C.A. Valderrama A.G.S. Filho P.S.B. Nascimento Polytechnic School University of the State of Pernambuco Brazil Informatics Center-Computer Engineering Group Federal University of Pernambuco (UFPE) Brazil

Dynamic reconfigurable systems (DRS) offer a very interesting alternative for embedded digital systems design. Tasks scheduling within a reconfigurable environment allows the development of systems with better execution performance, chip area economy and lower power consumption. This paper describes an algorithm for design of dynamically reconfigurable systems where tasks scheduling have as prime objective the overall application performance speedup. The methodology includes the generation of an embedded controller supporting the scheduling process in a target architecture.

关键词： Dynamic scheduling Processor scheduling Field programmable gate arrays Computer architecture Petri nets Hardware Embedded computing scheduling algorithm Informatics Power engineering computing

来源：评论

学校读者我要写书评

暂无评论

scheduling and Source Control with Average Queue-Length Control in Cellular Networks

Scheduling and Source Control with Average Queue-Length Cont...

引用

IEEE International Conference on Communications (ICC)

作者： H.-W. Lee C. Kim S. Chong Department of Electrical Engineering and Computer Science Kaist South Korea Department of Next Generation WLAN Research Electronics and Telecommunications Research Institute South Korea

In this paper, a scheduling problem is considered in the cellular network where there exist CBR (constant bit rate) users requiring exact minimum average throughput and delay guarantee, and EMG (elastic with minimum guarantee) users requiring minimum average throughput and delay guarantee and more throughput if possible. We first define a new utility function of average queue length. Based on the new queue utility function and the throughput utility function proposed before, we design a 2-dimensional weight function that will be used in our scheduling algorithm, and suggest a source control algorithm that can work with the scheduling algorithm. We show through simulations that the proposed algorithm guarantees the QoS (quality of service) requirements of CBR and EMG users.

关键词： Land mobile radio cellular systems Throughput Delay scheduling algorithm Electromyography Quality of service Processor scheduling Communication system control Electronic mail Bit rate

来源：评论

学校读者我要写书评

暂无评论

Optimizing transmission and shutdown for energy-efficient packet scheduling in sensor networks

Optimizing transmission and shutdown for energy-efficient pa...

引用

European Workshop on Wireless Sensor Networks

作者： S. Pollin B. Bougard R. Mangharam L. Van der Perre F. Catthoor R. Rajkumar I. Moerman IMEC Wireless Research/DESICS Leuven Belgium K.U.Leuven ESAT/INSYS Leuven Belgium Real-Time and Multimedia Systems Carnegie Mellon University Pittsburgh PA USA Ugent INTEC Gent Belgium

Energy-efficiency is imperative to enable the deployment of sensor networks with satisfactory lifetime. Conventional power management in radio communication primarily focuses independently on the physical layer, medium access control (MAC) or routing and approaches differ depending on the levels of abstraction. At the physical layer, the fundamental trade-off that exists between transmission rate and energy is exploited. This leads to the lazy scheduling approach, which consists of transmitting with the lowest power over the longest feasible duration. At MAC level, power reduction techniques tend to keep the transmission as short as possible to maximize the radio's power-off interval. Those two approaches seem conflicting and it is not clear which one is the most appropriate for a given network scenario. In this paper, we propose a transmission strategy that combines both techniques optimally. We present a cross-layer solution to determine the best transmission strategy taking into account the transceiver power consumption characteristics, the system load and the scenario constraints. Based on this approach, we derive a low complexity, on-line scheduling algorithm that can be used to optimally organize the forwarding of the sensed information from cluster heads to the data sink (uplink) in a hierarchical sensor network. Results, considering Coded Frequency Shift Keying (FSK) modulation, show that depending on the scenario, a 50% extra power reduction is achieved in a realistic uplink data gathering context, compared to the case where only transmission rate scaling or shutdown is considered.

关键词： Energy efficiency scheduling algorithm Physical layer Frequency shift keying Energy management Radio spectrum management Radio communication Media Access Protocol Routing Transceivers

来源：评论

学校读者我要写书评

暂无评论

scheduling Sensors' Tasks with Imprecise Timings within Wireless Sensor Networks

Scheduling Sensors' Tasks with Imprecise Timings within Wire...

引用

IEEE Conference on Wireless Communications and Networking

作者： Sami J. Habib Paulvanna Nayaki Marimuthu Computer Engineering Department Kuwait University Safat Kuwait

This paper proposes a novel data-aggregation approach for capacity planning of a wireless sensor network (WSN). The approach is based on incorporating the three sensor's tasks, which are sensing, processing and transmission, into a task flow graph (TFG); moreover all TFGs within WSN are merged into one super task flow graph (STFG). Also, we have modeled the execution time of transmission task as non-preemptive imprecise computation times. In real time systems, the insufficient number of gateways may partially terminate the transmission due to the deadline requirements in timings. This termination of transmission of any sensor node results in partial information of the sensed data resulting in imprecise computations. We have scheduled all tasks within STFG to determine the number and capacity of the gateways (base stations), where the aggregated data should be collected. We have utilized a Branch-and-Bound algorithm to perform scheduling, which is subject to concurrency in transmissions. We have analyzed the performance of 50 sensors within WSN by varying the availability of gateways. The computational results have provided excellent bounds on the number and capacity of gateways keeping in mind the trade-off in the quality of data-aggregation in the imprecise computations.

关键词： Wireless sensor networks Timing Flow graphs Processor scheduling Capacity planning Real time systems Base stations scheduling algorithm Concurrent computing Performance analysis

来源：评论

学校读者我要写书评

暂无评论

On the efficient scheduling of non-periodic tasks in hard real-time systems

On the efficient scheduling of non-periodic tasks in hard re...

引用

Real-Time Systems Symposium (RTSS)

作者： M.E. Thomadakis Jyh-Charn Liu Computer Science Department Texas A and M University College Station TX USA

The paper presents linear time, online algorithms which guarantee and jointly schedule firm aperiodic, hard sporadic and periodic tasks in fixed priority real time systems. We develop and capitalize on a methodology which computes the spare capacity Z(a,b) exactly in time /spl Theta/(n), for arbitrary schedule intervals (a,b), which, to the best of our knowledge, is the first linear time algorithm reported in the literature. Previous state of the art methods incur pseudopolynomial time to guarantee online a single aperiodic and incur continuous overhead for slack maintenance. Our method guarantees and schedules firm tasks to receive FIFO or EDF service, incurring a one-time linear cost of /spl Theta/(n) and /spl Theta/(n+k) respectively, where k is the number of pending firm tasks.

关键词： Real time systems Processor scheduling Ear Computer science scheduling algorithm Art Costs Dispatching

来源：评论

学校读者我要写书评

暂无评论

Fixed priority scheduling of periodic task sets with arbitrary deadlines

Fixed priority scheduling of periodic task sets with arbitra...

引用

Real-Time Systems Symposium (RTSS)

作者： J.P. Lehoczky Department of Statistics Carnegie Mellon University Pittsburgh PA USA

Consideration is given to the problem of fixed priority scheduling of period tasks with arbitrary deadlines. A general criterion for the schedulability of such a task set is given. Worst case bounds are given which generalize the C.L. Liu and J.W. Layland (1973) bound. The results are shown to provide a basis for developing predictable distributed real-time systems.< >

关键词： scheduling algorithm Contracts Statistics Real time systems Performance analysis Stochastic processes Oceans Computer displays Delay algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

QDV - A QoS Enabled Packet scheduling Scheme for Mobile WiMAX in UAV Swarms

QDV - A QoS Enabled Packet Scheduling Scheme for Mobile WiMA...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Bjoern Dusza Christian Wietfeld Communication Networks Institute Technical University Dortmund Dortmund Germany

For the reliable control of Micro Unmanned Aerial Vehicles (MUAV) using IP based networks it is of high importance to assure certain quality of service warranties for the transmission of control information. The mobile WiMAX standard IEEE 802.16e defines five QoS Classes which represent different requirements concerning data rate and delay. The scheduling scheme which is used to fulfill these requirements can be independently chosen by the network operator. In this paper we present a novel QoS aware scheduling scheme which can be parameterized in a very flexible and simple way and therefore enables the network operator to set up the service guarantees very accurate depending on the specific requirements. This is of special importance in the case that WiMAX is used for untypical applications such as for example the control of UAVs and therewith the requirements do not exactly match the predefined QoS classes.

关键词： Quality of service scheduling algorithm WiMAX Delay Mobile communication Generators Conferences

来源：评论

学校读者我要写书评

暂无评论

Good processor management=fast allocation+efficient scheduling

Good processor management=fast allocation+efficient scheduli...

引用

International Conference on Parallel Processing (ICPP)

作者： B.S. Yoo C.R. Das Department of Computer Science and Engineering Pennsylvania State University University Park PA USA

Fast and efficient processor allocation and job scheduling algorithms are essential components of a multi-user multicomputer operating system. In this paper we propose two novel processor management schemes which meet such demands for mesh-connected multicomputers. A stack-based allocation algorithm that can locate a free sub-mesh for a job very quickly using simple coordinate calculation and spatial subtraction is proposed. Simulation results show that the stack-based allocation algorithm outperforms all the existing allocation policies in terms of allocation overhead while delivering competitive performance. Another technique, called group scheduling, schedules jobs in such a way that the jobs belonging to the same group do not block each other. The groups are scheduled in an FCFS order to prevent starvation. This simple but efficient scheduling policy reduces the response rime significantly by minimizing the queueing delay for the jobs in the same group. These two schemes, when used together can provide faster service to users with very little overhead.

关键词： Processor scheduling scheduling algorithm Operating systems Resource management Computer science Engineering management Delay effects Environmental management System performance Performance gain

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 485 486 487 488 489 490 491 492 493 494 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：