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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

10,732 篇 scheduling algor...
4,056 篇 processor schedu...
2,043 篇 delay
1,645 篇 throughput
1,565 篇 algorithm design...
1,380 篇 computer science
1,303 篇 resource managem...
1,302 篇 real time system...
1,292 篇 quality of servi...
1,170 篇 bandwidth
1,086 篇 traffic control
969 篇 job shop schedul...
946 篇 dynamic scheduli...
782 篇 costs
736 篇 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,592 篇 英文
82 篇 其他
58 篇 中文

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

共 10732 条记录，以下是4681-4690 订阅

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

详细简洁

排序：

A Job Schedule Model Based on Grid Environment

A Job Schedule Model Based on Grid Environment

引用

International Conference on Complex, Intelligent and Software Intensive Systems, CISIS

作者： Homer Wu Chong-Yen Lee Wuu-Yee Chen Tsang-Yean Lee Department of Information Management Chinese Cultural University Taipei Taiwan

Factors such as CPU utilization, throughput, turnaround time, waiting time, and response time can influence system performance. Different operating systems use different scheduling algorithms to achieve their goals. System performance of grid computing is calculated from resources usages. Job scheduling is more important when jobs are not uniformly distributed in all grid nodes. In order to achieve performance optimization, we propose a maximum processor utilization and throughput (MPUT) scheduling algorithm which maximizes CPU utilization and throughput at the same time and minimizes turnaround time as well. The algorithm is used in all execute grid nodes to schedule their jobs and get good performance

关键词： scheduling algorithm Job shop scheduling Throughput Processor scheduling Operating systems Grid computing Time factors Delay System performance Optimization

来源：评论

学校读者我要写书评

暂无评论

Max-Min Fair Bandwidth Allocation algorithms for Packet Switches

Max-Min Fair Bandwidth Allocation Algorithms for Packet Swit...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Deng Pan Yuanyuan Yang Department of Computer Science State University of New York Stony Brook NY USA Department of Electrical & Computer Engineering State University of New York Stony Brook NY USA

With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are a common approach for switches and routers to support QoS. All fair scheduling algorithms are running based on a bandwidth allocation scheme. The scheme should be feasible in order to be applied in practice, and should be efficient to fully utilize available bandwidth and allocate bandwidth in a fair manner. However, since a single input port or output port of a switch has only the bandwidth information of its local flows (i.e., the flows traversing itself), it is difficult to obtain a globally feasible and efficient bandwidth allocation scheme. In this paper, we show how to fairly allocate bandwidth in packet switches based on the max-min fairness principle. We first formulate the problem, and give the definitions of feasibility and max-min fairness for bandwidth allocation in packet switches. As the first step to solve the problem, we consider the simpler unicast scenarios, and present the max-min fair bandwidth allocation algorithm for unicast traffic. We then extend the analysis to the more general multicast scenarios, and present the max-min fair bandwidth allocation algorithm for multicast traffic. We prove that both algorithms achieve max-min fairness, and analyze their complexity. The proposed algorithms are universally applicable to any type of switches and scheduling algorithms.

关键词： Channel allocation Packet switching Switches scheduling algorithm Quality of service Bandwidth Multicast algorithms algorithm design and analysis Buffer storage Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Opportunistic Proportionate Fairness Adaptive Scheduler for High Speed Packet Access System

Opportunistic Proportionate Fairness Adaptive Scheduler for ...

引用

International Conference on Communication Systems Software and Middleware (COMSWARE)

作者： Avinash Venkatesh Baiju Parameswaran Saptarshi Chaudhuri Center of Excellence Wireless Business Unit Wipro Technologies Limited Bangalore India

3G MAC entity forms the most important part of any high speed packet access system. Due to high data rate requirements, MAC layer requires an efficient scheduler algorithm that can optimize the flow control, buffer utilization as well as channel quality requirements. The MAC entity consists of mainly the flow control engine, buffer management, scheduler and HARQ process that together provide a steady packet flow to the physical layer. In this paper, we propose a new algorithm to address the scheduler functionality. This algorithm provides the correct feedback to flow control and the HARQ process for data flow. The algorithm selects users for transmission bits based on their actual buffer occupancies per queue, dynamic token value traffic class priority, as well as channel conditions reporting from the access terminal. This algorithm is named as the opportunistic proportionate fairness scheduler (OPFS).

关键词： Adaptive scheduling scheduling algorithm Engines Traffic control Physical layer Delay Throughput Feedback Control systems Power system management

来源：评论

学校读者我要写书评

暂无评论

MAC-ASA: A New MAC Protocol for WMNs

MAC-ASA: A New MAC Protocol for WMNs

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Roberto Santamaria Olivier Bourdeau Tricha Anjali Department of Electrical and Computer Engineering Illinois Institute of Technology Chicago IL USA

This paper presents a novel medium access control (MAC) protocol intended to provide multi-hop wireless mesh networks with a higher throughput. The proposed MAC-ASA (medium access control with anticipated scheduling and agreement) protocol uses a modified version of the 802.11 CSMA/CA contention handling procedure integrated with a dynamic (time division multiple access) TDMA-like protocol structure. It combines distributed link scheduling algorithm with power control support for router -router communications with a self agreement protocol for the client -router communications. In addition, the proposed algorithm solves the "exposed node" problem by applying multiple frequencies and time saving policies. These features result in a significant improvement of the throughput in many scenarios. Performance results from an OPNET model are presented in this paper.

关键词： Media Access Protocol Access protocols Throughput Wireless application protocol Spread spectrum communication Wireless mesh networks Dynamic scheduling Multiaccess communication Time division multiple access scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A Decision-Theoretic Planner with Dynamic Component Reconfiguration for Distributed Real-Time Applications

A Decision-Theoretic Planner with Dynamic Component Reconfig...

引用

International Symposium on Autonomous Decentralized Systems (ISADAS)

作者： John S. Kinnebrew Ankit Gupta Nishanth Shankaran Gautam Biswas Douglas C. Schmidt Department of Electrical Engineering and Computer Science & ISIS Vanderbilt University Nashville TN USA

Distributed real-time embedded (DRE) systems perform sequences of coordination and heterogeneous data manipulation tasks in dynamic environments to meet specified goals. Autonomous operation of DRE systems can benefit from the integrated operation of (1) a decision-theoretic spreading activation partial order planner (SA-POP) that combines task planning and scheduling in uncertain environments with (2) a resource allocation and control engine (RACE) middleware framework that integrates multiple resource management algorithms for (re)deploying and (re)configuring task sequence components in these systems. This paper demonstrates the effectiveness of SA-POP and RACE in managing and executing mission goals for a multisatellite application. Our results show that combining planning, scheduling and resource constraints dynamically is the key to implementing autonomy in DRE systems

关键词： Resource management Satellites Middleware Real time systems Earth Runtime Manipulator dynamics Engines scheduling algorithm Data analysis

来源：评论

学校读者我要写书评

暂无评论

Simulation Study on Traffic Control Performance in Combined Input and Crosspoint Queuing Switches

Simulation Study on Traffic Control Performance in Combined ...

引用

IEEE Region 5 Annual Technical Conference

作者： SzeHuan Chin Qiang Duan Computer Science Department University of Central Arkansas AR USA

A wide range of emerging networking applications demand computer networks to provide quality of service (QoS). Packet switches play one of the most crucial roles in computer communication systems and traffic control in packet switches is the key to QoS provisioning. The combined input and cross-point queuing (CICQ) switch is a newly developed switch architecture that employs the crossbar-based switching fabric and a variant of the combined input and output queuing scheme with distributed output buffer at each crosspoint. The CICQ switch is being widely deployed in computer networks, therefore how to control traffic in a CICQ switch to provide QoS guarantees becomes an important issue. In this paper, we investigate the QoS performance of a variety of traffic control algorithms applied in CICQ switches. Since it is well known that the OQ switch is an ideal case that provides the optimal QoS performance, we compare the achievable performance of the CICQ switch under each packet scheduling policy with the performance that can be achieved by an Output Queuing (OQ) switch with the same scheduling algorithm. The performance analysis in this paper is based on a simulation system that we develop using OPNET modeler.

关键词： Traffic control Switches Communication switching Quality of service Packet switching Computer networks Communication system traffic control scheduling algorithm Computational modeling Application software

来源：评论

学校读者我要写书评

暂无评论

Architecture, Implementation, and Evaluation of a Concurrent Multi-path Real-time Transport Control Protocol

Architecture, Implementation, and Evaluation of a Concurrent...

引用

MILCOM, Military Communications Conference

作者： J. Anand Dilip Sarkar Department of Computer Science University of Miami Florida Department of Computer Science University of Miami Florida USA

Current multimedia applications utilize a combination of real-time transport protocol (RTP) and user datagram protocol (UDP) for transmitting real-time streams across the network. Bandwidth aggregation over multiple paths for improved real-time stream transmission can be achieved using either a combination of multi-flow RTP (MRTP) and UDP, or various adaptations of Partial reliability (PR) extension of SCTP (SCTP-PR). However, they are not really useful for balancing load on the multiple paths. The receiving end of these protocols can neither identify late arriving packets nor notify the sender about them. The novel concurrent multi-path real-time transmission control protocol (cmpRTCP) proposed, implemented, and evaluated in this work not only overcomes the problems faced by existing multi-path protocols, but also preserves the novel design and implementation features of the recently proposed cmpTCP. This protocol which has a congestion controller and a packet scheduler embedded in its core, intelligently exploits the availability of multiple paths between multi-homed hosts for concurrent transmission and showcases the ability of (i) remaining TCP-friendly while aggregating bandwidth, (ii) balancing load across paths by scheduling more packets on less congested paths, (iii) increasing end-to-end connection reliability by using multiple paths and (iv) improving QoS at the receiving end by scheduling more packets on better paths.

关键词： Transport protocols Bandwidth TCPIP Streaming media Computer network reliability Delay estimation Processor scheduling Quality of service scheduling algorithm Availability

来源：评论

学校读者我要写书评

暂无评论

On the Addition of an Input Buffer to an Iterative Decoder for LDPC Codes

On the Addition of an Input Buffer to an Iterative Decoder f...

引用

IEEE 65th Vehicular Technology Conference (VTC-Spring 2007), vol.4

作者： Massimo Rovini Alfonso Martinez Department of Information Engineering University of Pisa Pisa Italy Department of Electrical Engineering Technische Universiteit Eindhoven Eindhoven Netherlands

This paper describes the application of a new hardware architecture to the design of a decoder for Low-Density Parity-Check (LDPC) codes. Thanks to the systematic use of the built-in stopping rule in the decoder, the decoder runs the minimum number of iterations on each packet of received data. The addition of a small buffer on the decoder input allows the exploitation of the variations in the decoding time of different packets, in a spirit similar to statistical multiplexing of the data flow. Analysis and simulations are presented using the decoder for the next generation satellite Digital Video Broadcasting (DVB-S2) as a case study, to show that the throughput may be doubled with only two extra buffer locations, at almost no cost in chip area.

关键词： Iterative decoding Parity check codes Digital video broadcasting Throughput Hardware Satellite broadcasting Costs scheduling algorithm Design engineering Analytical models

来源：评论

学校读者我要写书评

暂无评论

On a Successful Application of Multi-Agent Reinforcement Learning to Operations Research Benchmarks

On a Successful Application of Multi-Agent Reinforcement Lea...

引用

IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning, (ADPRL)

作者： Thomas Gabel Martin Riedmiller Department of Mathematics and Computer Science Institute of Cognitive Science University of Osnabrück Osnabruck Germany

In this paper, we suggest and analyze the use of approximate reinforcement learning techniques for a new category of challenging benchmark problems from the field of operations research. We demonstrate that interpreting and solving the task of job-shop scheduling as a multi-agent learning problem is beneficial for obtaining near-optimal solutions and can very well compete with alternative solution approaches. The evaluation of our algorithms focuses on numerous established operations research benchmark problems

关键词： Learning Operations research scheduling algorithm Dynamic programming Application software Mathematics Computer science Cognitive science Bicycles Bridges

来源：评论

学校读者我要写书评

暂无评论

A Flexible Real-Time Locking Protocol for Multiprocessors

A Flexible Real-Time Locking Protocol for Multiprocessors

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Aaron Block Hennadiy Leontyev Bjorn B. Brandenburg James H. Anderson Department of Computer Science University of North Carolina Chapel Hill USA

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 many 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.

关键词： Protocols Processor scheduling scheduling algorithm Partitioning algorithms Job shop scheduling Real time systems Multicore processing Computer science Multiprocessing systems Manufacturing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 465 466 467 468 469 470 471 472 473 474 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：