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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

10,833 篇 scheduling algor...
4,083 篇 processor schedu...
2,061 篇 delay
1,663 篇 throughput
1,575 篇 algorithm design...
1,387 篇 computer science
1,319 篇 resource managem...
1,312 篇 quality of servi...
1,309 篇 real time system...
1,192 篇 bandwidth
1,099 篇 traffic control
974 篇 job shop schedul...
956 篇 dynamic scheduli...
789 篇 costs
742 篇 telecommunicatio...
703 篇 switches
685 篇 optimal scheduli...
589 篇 application soft...
589 篇 heuristic algori...
534 篇 hardware

机构

39 篇 department of el...
31 篇 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
22 篇 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
15 篇 j.a. stankovic
15 篇 i. ahmad
15 篇 j.w.s. liu
15 篇 r. srikant
15 篇 binoy ravindran

语言

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

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

共 10833 条记录，以下是4801-4810 订阅

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

详细简洁

排序：

A prioritized packet scheduling architecture for provision of quality-of-service in Tbit/sec WDM networks

A prioritized packet scheduling architecture for provision o...

引用

IEEE International Conference on Communications (ICC)

作者： I. Elhanany D. Sadot Electrical and Computers Engineering Department Ben-Gurion University of the Negev Beersheba Israel

The provision of quality-of-service (QoS) is a predominant requirement from modern high-performance switches and routers. Port densities of tens and even hundreds of ports characterize ATM and IPv6 switches where each port carries high-speed traffic with diverse statistical characteristics. In this paper a scheduling scheme for Tbit/sec, input-queued, WDM packet-switch networks is presented. The proposed architecture is contention-free, scalable, easy to implement and requires no internal "speedup". Moreover, the scheme inherently supports per-class QoS. Non-uniform destination distribution and bursty cell arrivals are studied for a switch with an aggregated capacity of 1 Tbit/sec. Simulation results show that class-differentiated low latency is achieved, yielding a powerful solution for high-performance packet-switch networks.

关键词： scheduling algorithm Quality of service Wavelength division multiplexing Switches Telecommunication traffic Delay Traffic control Communication switching Asynchronous transfer mode WDM networks

来源：评论

学校读者我要写书评

暂无评论

Integration of Multi-path Optimized Link State Protocol with Max-weight scheduling

Integration of Multi-path Optimized Link State Protocol with...

引用

International Conference on Information and Multimedia Technology (ICIMT)

作者： Andrzej Szwabe Pawel Misiorek Institute of Control and Information Engineering Poznan University of Technology Poznan Poland

Backpressure-based Max-Weight scheduling (MWS) algorithms are theoretically proven to be optimal with respect to wireless multi-hop networks throughput maximization. On the other hand, Optimized Link State Protocol (OLSR) is the leading proactive protocol for wireless ad-hoc networks. However, in its standard implementation, OLSR is a single-path protocol, whereas it is widely known that wireless network performance can be improved by allowing multiple routes from a given source to a given destination. Moreover, MWS algorithms provide higher throughput when used in multi-path routing scenarios. We designed a light-weight multi-path modification of the OLSR algorithm that is dedicated to work in cooperation with backpressure-based scheduling. The proposed routing algorithm preserves all features of proactive protocols. We tested our joint routing and scheduling scheme in a wireless network serving TCP flows. Since performance of multi-path TCP can suffer from packet reordering, we implemented a delayed reordering algorithm. In order to keep 802.11 MAC unmodified, we deployed a mechanism for the estimation of number of packets in the MAC sub-layer.

关键词： Wireless application protocol scheduling algorithm Throughput Wireless networks Spread spectrum communication Ad hoc networks algorithm design and analysis Routing protocols Testing Delay

来源：评论

学校读者我要写书评

暂无评论

Dynamic, reliability-driven scheduling of parallel real-time jobs in heterogeneous systems

Dynamic, reliability-driven scheduling of parallel real-time...

引用

International Conference on Parallel Processing (ICPP)

作者： X. Qin H. Jiang School of Computing and Information Technology Griffith University Brisbane QLD Australia Department of Computer Science and Engineering University of Nebraska Lincoln Lincolnshire NE USA

In this paper, a heuristic dynamic scheduling scheme for parallel real-time jobs in a heterogeneous system is presented. The parallel real-time jobs studied in this paper are modelled by directed acyclic graphs (DAG). We assume a scheduling environment where parallel real-time jobs arrive at a heterogeneous system following a Poisson process. The scheduling algorithms developed in this paper take the reliability measure into account, in order to enhance the reliability of the heterogeneous system without any additional hardware cost. In addition, scheduling time and dispatch time are both incorporated into our scheduling scheme so as to make the scheduling result more realistic and precise. Admission control is in place so that a parallel real-time job whose deadline cannot be guaranteed is rejected by the system. The performance of the proposed scheme is evaluated via extensive simulations. The simulation results show that the heuristic algorithm performs significantly better than two other algorithms that do not consider reliability cost. Furthermore, results suggest that shortening the scheduling time results in a higher guarantee ratio. Hence, if parallel scheduling algorithm is devised and employed to shorten the scheduling time, the performance of the heterogeneous system will be further enhanced.

关键词： Dynamic scheduling Real time systems Processor scheduling scheduling algorithm Costs Heuristic algorithms Computer science Reliability engineering Concurrent computing Information technology

来源：评论

学校读者我要写书评

暂无评论

scheduling real-time applications in an open environment

Scheduling real-time applications in an open environment

引用

Real-Time Systems Symposium (RTSS)

作者： Z. Deng J.W.-S. Liu Department of Computer Science University of Illinois Urbana-Champaign Urbana IL USA

This paper extends the two-level hierarchical scheme in (Deng et al., 1997) for scheduling independently developed real-time applications with non-real-time applications in an open environment. The environment allows the schedulability of each real-time application to be validated independently of other applications in the system. The extended scheme removes the following two restrictions of the scheme: real-time applications that are scheduled preemptively must consist solely of periodic tasks; and applications must not share global resources (i.e., resources used by more than one application). Consequently, the extended scheme can accommodate a much broader spectrum of real-time applications.

关键词： Processor scheduling Real time systems Application software scheduling algorithm Timing Open systems Computer science Runtime NASA System testing

来源：评论

学校读者我要写书评

暂无评论

scheduling of storage and cache servers for replicated multimedia data

Scheduling of storage and cache servers for replicated multi...

引用

International Conference on High Performance Computing in the Asia-Pacific Region

作者： Park Kyeongho Yanghee Choi Chong Sang Kim Department of Computer Engineering Seoul National University Seoul South Korea

Multimedia storage servers will play an important role in many forthcoming network-based multimedia services like video-on-demand (VoD). The load on the storage servers and the data transmission cost can be reduced by using additional cache servers which store the data requested by a user temporarily and provide data to other users located near the cache servers. It is required to minimize the sum of the storage cost and the transmission cost while satisfying users' timing requirements. We study a scheduling scheme for storage servers and cache servers to meet this requirement. Assuming that the locations of the data and the users' deadline requirements are known beforehand, we formulate the problem, devise a greedy heuristic algorithm for scheduling servers statically and analyze its complexity, and, by limiting the backtracking distance and restricting the search area using a constant-size search window, the scheduling time can be greatly reduced with little increase in the total cost.

关键词： Cache storage Network servers Costs Buffer storage Topology algorithm design and analysis Processor scheduling Timing Heuristic algorithms scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Code scheduling For Vliw/superscalar Processors With Limited Register Files

Code Scheduling For Vliw/superscalar Processors With Limited...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： T. Kiyohara J.C. Gyllenhaal Media Research Laboratory Matsushita Elecrric Indusrrial Company Limited Kadoma Osaka Japan Coordinated Science Laboratory University of Illinois Urbana IL USA

来源：评论

学校读者我要写书评

暂无评论

Downlink scheduling in a cellular network for quality of service assurance

Downlink scheduling in a cellular network for quality of ser...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Dapeng Wu R. Negi Department of Electrical & Computer Engineering Carnegie Mellon University Pitsburg PA USA

We consider the problem of scheduling data in the downlink of a cellular network, over parallel time-varying channels, while providing quality of service (QoS) guarantees, to multiple users in the network. We design simple and efficient admission control, resource allocation, and scheduling algorithms for guaranteeing requested QoS. Our scheduling algorithms consists of two sets, namely, (what we call) joint K&H/RR scheduling and reference channel (RC) scheduling. The joint K&H/RR scheduling, composed of K&H scheduling and round robin (RR) scheduling, utilizes both multiuser diversity and frequency diversity to achieve capacity gain, and the RC scheduling minimizes the channel usage while satisfying users' QoS constraints. The relation between the joint K&H/RR scheduling and the RC scheduling is that 1) if the admission control allocates channel resources to the RR scheduling due to tight delay requirements, then the RC scheduler can be used to minimize channel usage; 2) if the admission control allocates channel resources to the K&H scheduling only, due to loose delay requirements, then there is no need to use the RC scheduler. In designing the RC scheduler, we propose a reference channel approach and formulate the scheduler as a linear program, dispensing with complex dynamic programming approaches, by the use of a resource allocation scheme. An advantage of this formulation is that the desired QoS constraints can be explicitly enforced, by allotting sufficient channel resources to users, during call admission.

关键词： Downlink Land mobile radio cellular systems Quality of service Resource management Admission control scheduling algorithm Delay Dynamic scheduling Time-varying channels algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Novel Bandwidth scheduling Strategy for IEEE 802.16 Broadband Wireless Networks

A Novel Bandwidth Scheduling Strategy for IEEE 802.16 Broadb...

引用

International Conference on Wireless Communications, Networking and Mobile Computing (WiCom)

作者： Peng Zhu Guangxi Zhu Haibin Shi Hongzhi Lin Huazhong University of Science and Technology Wuhan Hubei CN Dept. of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan China

WiMax system, which is defined by the IEEE 802.16 standard, also called broadband wireless metropolitan area network, supports real time and non-real time services. It has not defined the packet-scheduling algorithms, which was need for the requirement of quality of service (QoS) supporting for real-time services. Generally, the service station (SS) requests for bandwidth from the base station (BS), The BS then allocates the bandwidth to SS according to priority-based request. In this paper we propose a novel bandwidth scheduling algorithm for real time polling services (rtPS), the SS estimate the arrival of rtPS packets prior to the arrival and requests the BS for bandwidth in advance, based on the SS's request and the indeed bandwidth request by past. The analytical model and simulation show that, this adaptive algorithm provided better results with respect to the number of packets waiting at SS and average delay as compared to the widely accepted weighted scheduling algorithm and Mukul 's adaptive bandwidth request mechanism.

关键词： Bandwidth Wireless networks Quality of service scheduling algorithm Analytical models WiMAX Wireless LAN Metropolitan area networks Real time systems Base stations

来源：评论

学校读者我要写书评

暂无评论

Grid Application scheduling Model Based on Petri Net with Changeable Structure

Grid Application Scheduling Model Based on Petri Net with Ch...

引用

第六届网格与协同计算国际会议(The Sixth International Conference on Grid and Cooperative Computing GCC 2007)

作者： Xiangang Zhao Bai Wang Liutong Xu Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China

This paper proposes a scheduling net based on a hierarchical color Petri net and a job net based on a Petri net with changeable structure. According to the granularity of grid applications, the scheduling net is designed into four levels, which makes it easy to deploy distributed schedulers in grid environment and benefits the management of different application *** job net model is based on Petri net with changeable structure, which can change its structure dynamically according to the real-time state of running jobs. This model supports the dynamic mergence and division of subtasks and has ability to handle the running exceptions of subtasks. Finally, we validate the liveness and reachability of the scheduling net and the job net by analyzing their reachability trees. A transition tree algorithm is also presented to analyze the cost and time properties of job net, which can be used for the optimization of resource allocation.

关键词： Processor scheduling Grid computing Application software Performance analysis scheduling algorithm Laboratories Intelligent structures Computer science Environmental management algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Real-time disk scheduling techniques for mirrored disk systems

Real-time disk scheduling techniques for mirrored disk syste...

引用

IEEE Region 10 International Conference TENCON

作者： Hyang Jae Park Heonshik Shin Department of Computer Science Keimyung University Taegu South Korea Department of Computer Engineering Seoul National University Seoul South Korea

ISBN: (纸本)0780318625

Mirrored disk systems are currently used for enhancing reliability of disk systems as well as achieving speedup of read/write access time. These characteristics of disk mirroring can properly meet the requirements of real time applications. The paper aims to develop some techniques for management of read request queues in a mirrored disk system operating under a soft real time environment, and conduct performance comparisons between them through simulations. The simulation results show that centralized queue policies out-perform distributed queue policies, and that some improved delayed write policies can reduce the miss ratio of read requests. Finally, we suggest two improved centralized queue policies which utilize multiple delayed write queues.< >

关键词： Real time systems Timing scheduling algorithm Processor scheduling Computer science Reliability engineering Environmental management Delay effects Coils Actuators

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 477 478 479 480 481 482 483 484 485 486 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：