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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是4671-4680 订阅

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

详细简洁

排序：

The Worst-Case Capacity of Wireless Sensor Networks

The Worst-Case Capacity of Wireless Sensor Networks

引用

International Symposium on Information Processing in Sensor Networks (IPSN)

作者： Thomas Moscibroda Microsoft Research Limited Redmond WA USA

The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of sensor networks is thus characterized by the rate at which information can be aggregated to the sink. In this paper, we derive the first scaling laws describing the achievable rate in worst-case, i.e. arbitrarily deployed, sensor networks. We show that in the physical model of wireless communication and for a large number of practically important functions, a sustainable rate of Theta(1/log 2 n) can be achieved in every network, even when nodes are positioned in a worst-case manner. In contrast, we show that the best possible rate in the protocol model is Theta(1/n), which establishes an exponential gap between these two standard models of wireless communication. Furthermore, our worst-case capacity result almost matches the rate of Theta(1/log n) that can be achieved in randomly deployed networks. The high rate is made possible by employing non-linear power assignment at nodes and by exploiting SINR-effects. Finally, our algorithm also improves the best known bounds on the scheduling complexity in wireless networks.

关键词： Wireless sensor networks Sensor phenomena and characterization Capacitive sensors Aggregates Computer networks Spread spectrum communication Protocols scheduling algorithm Tellurium Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

Policy Based QoS Management Architecture in IEEE 802.11e Networks

Policy Based QoS Management Architecture in IEEE 802.11e Net...

引用

第三届IEEE无线通讯、网络技术暨移动计算国际会议

作者： Wang Yan Wireless Communication Division CEC Beijing Huada Electronic Design Co. Ltd. Beijing China

To support applications with quality of service (QoS) requirements, such as video, audio, voice over IP and other multimedia applications in wireless networks, the IEEE 802.11e protocol is designed to provide differentiated priority QoS in wireless networks. In order to integrate with wide area networks effective, policy based QoS management architecture in 802.11e networks, which could realize uniform QoS in whole network, worth researches. This paper presents an efficient policy based QoS management scheme, called Policy-based WLAN QoS Management, and related proportional delay differentiated algorithm, referred as Arbitrary Channel Reservation, for 802.11e networks. In the new scheme, a hybrid type of architecture, combining the outsourcing and provisioning models, is used, most closely meets the requirements of 802.11e networks.

关键词： 802.11e QoS scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Enhanced End-to-End TDMA for wireless ad-hoc networks

Enhanced End-to-End TDMA for wireless ad-hoc networks

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： D. J. Vergados M. Koutsogiannaki D. D. Vergados V. Loumos N. Pantazis School of Electrical and Computer Engineering National and Technical University of Athens Greece Department of Information and Communication Systems Engineering University of Aegean Greece

TDMA has increasingly been used as the MAC layer for ad-hoc networks. However, the use of TDMA in multi-hop networks leads to the problem of distributing the available slots among the wireless nodes in an effective manner. The exact way the slots are distributed among the transmitting nodes has an impact on various performance parameters of the network, such as the end-to-end delay and the capacity. In general, an increase of the end-to-end delay may lead to an increased network capacity. In this paper, we study two new end-to-end TDMA scheduling algorithms, and compare them in terms of end-to-end delay and network capacity.

关键词： Time division multiple access Ad hoc networks Dynamic scheduling scheduling algorithm Spread spectrum communication Collision avoidance Heuristic algorithms Routing Systems engineering and theory Computer networks

来源：评论

学校读者我要写书评

暂无评论

A Uniform Fine-Grain Frame Spreading algorithm for Avoiding Packet Reordering in Load-Balanced Switches

A Uniform Fine-Grain Frame Spreading Algorithm for Avoiding ...

引用

IEEE Asia-Pacific Conference on Services Computing (APSCC)

作者： Yi Dai Jin-shu Su Zhi-gang Sun Jian-bo Guan National University of Defense Technology Changsha Hunan China

Network operators need high capacity router architectures that can offer scalability, provide throughput guarantees, and maintain packet ordering. However, current centralized crossbar-based architectures cannot scale to fast line rates and high port counts. On the other hand, while load-balanced switch architectures that rely on two identical stages of fixed configuration meshes appear to be an effective way to scale Internet routers to very high capacities, they incur a large worst-case packet reordering that is at best quadratic to the switch size. In this paper, we propose a Uniform Fine-grain Frame Spreading (UFFS) algorithm to avoid packet reordering throughout the load-balanced switch by assigning cells of the same flow to the fixed successive intermediate inputs. In order to distribute traffic equally among the intermediate inputs, a rotation mapping algorithm is used to construct a fixed mapping relationship between flows of different inputs and intermediate inputs in a round-robin fashion. The UFFS algorithm is distributed and can operate independently in each input. It spreads each flow to intermediate inputs according to the mapping relationship that is precomputed by the rotation mapping algorithm. We show that the UFFS algorithm can enforce packet ordering and achieve 100 % throughput with no additional communication of information among linecards.

关键词： Packet switching Switches Throughput Internet Traffic control Round robin Communication switching Computer architecture Scalability scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Feedback Mechanism for Load Balanced Two-Stage Switches

A Novel Feedback Mechanism for Load Balanced Two-Stage Switc...

引用

IEEE International Conference on Communications (ICC)

作者： K. L. Yeung B. Hu N. H. Liu Department of Electrical and Electronic Engineering University of Hong Kong Hong Kong China

A novel feedback mechanism is proposed in this paper to enhance the performance of load-balanced two-stage switches. The key idea is to properly select and coordinate the two sequences of TV deterministic configurations used by the two stages of switch fabrics, thereby forming a joint sequence with both staggered symmetry property and in-order packet delivery property . With a single-packet-buffer-per-middle-stage VOQ, a joint sequence with both properties is first constructed. Then based on it, an efficient feedback mechanism is designed to allow the right piece of middle-stage port occupancy information to be delivered to the right input port at the right time. In each time slot, an input selects a packet for sending based on its port-based scheduling algorithm. To this end, three simple port-based scheduling algorithms, RR, LQF and EDF, are also proposed. Simulation results show that with our proposed feedback mechanism, the three scheduling algorithms gives an unbeatable delay-throughput performance under various traffic conditions.

关键词： Feedback Switches Fabrics Packet switching Communication switching Traffic control Throughput Load management scheduling algorithm Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Automatic Software Hardware Co-Design for Reconfigurable Computing Systems

Automatic Software Hardware Co-Design for Reconfigurable Com...

引用

International Conference on Field Programmable Logic and Applications

作者： Proshanta Saha NSF Center for High-Performance Reconfigurable Computing (CHREC) ECE Department George Washington University USA

A formal methodology for automatic hardware-software partitioning and co-scheduling between the muP and the field programmable gate array (FPGA) has not yet been established. Current work in automatic task partitioning and scheduling for the reconfigurable systems strictly addresses the FPGA hardware, and does not take advantage of the synergy between the microprocessor and the FPGA. In this research, we consider the problem of formalizing a co-scheduling methodology and develop a set of intuitive tools to assist users in realizing the full potential of an RC architecture. scheduling is critical for efficient resource utilization and achieving speedup in high performance reconfigurable computers (HPRC). The primary targets of this research are reconfigurable computing (RC) systems that have both microprocessors and FPGAs.

关键词： scheduling algorithm Field programmable gate arrays Processor scheduling Microprocessors Routing Hardware design languages Cryptography Embedded computing Computer architecture Resource management

来源：评论

学校读者我要写书评

暂无评论

Achievable Rate Region for Wireless Systems with Time Varying Channels

Achievable Rate Region for Wireless Systems with Time Varyin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： M. Kodialam T. V. Lakshman Alcatel-Lucent Bell Laboratories Holmdel NJ USA

We consider a wireless system comprising of multiple users that communicate with a base station. When there are a large number of users with time varying channels, it has been shown that multiuser diversity can be exploited to achieve high throughput in these systems. In a system employing multiuser diversity, the base station estimates the channel quality for each user during each time slot, and schedules the user with the best channel condition for that time slot. There has been a considerable amount of work towards developing scheduling mechanisms to provide quality of service guarantees to the individual users in addition to maximizing total throughput. In this paper, we consider the achievable rate region of a multiuser TDM system when the average transmit power is bounded. Our objective is to develop efficient algorithms to determine if a given rate vector is achievable within the average power bound. We characterize the achievable rate region when the channel behavior can be approximated by the on-off Gilbert-Elliot channel model. We first show that the problem of determining if a rate vector is achievable can be formulated as a convex optimization problem over a suitably denned polymatroid. We derive optimal waterfilling algorithms for solving the achievable rate region problem.

关键词： Time varying systems Base stations Time division multiplexing Throughput Wireless communication Communications Society USA Councils Quality of service Power system modeling scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-Rate Layered Decoder Architecture for Block LDPC Codes of the IEEE 802.11n Wireless Standard

Multi-Rate Layered Decoder Architecture for Block LDPC Codes...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Kiran Gunnam Gwan Choi Weihuang Wang Mark Yeary Department of Electrical and Computer Engineering Texas A and M University TX USA Department of Electrical and Computer Engineering University of Oklahama Norman OK USA

We present a new multi-rate architecture for decoding block LDPC codes in IEEE 802.11n standard. The proposed architecture utilizes the value-reuse property of offset min-sum, block-serial scheduling of computations and turbo decoding message passing algorithm. Techniques of data-forwarding and out-of-order processing are used to deal with the irregularity of the codes. The decoder has the following advantages when compared to recent state-of-the-art architectures: 55% savings in memory, reduction of routers by 50% and increase of throughput by 2times.

关键词： Parity check codes Code standards Iterative decoding Computer architecture Message passing Bit error rate Iterative algorithms scheduling algorithm Turbo codes Niobium

来源：评论

学校读者我要写书评

暂无评论

Improved Output Jitter Calculation for Compositional Performance Analysis of Distributed Systems

Improved Output Jitter Calculation for Compositional Perform...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Rafik Henia Razvan Racu Rolf Ernst Institute of Computer and Communication Network Engineering Technical University of Braunschweig Brunswick Germany

Compositional performance analysis iteratively alternates local scheduling analysis techniques and output event model propagation between system components to enable performance analysis of heterogeneous distributed systems. In spite of its high scalability and adaptability, the compositional approach may suffer from overestimated results compared with other system performance verification techniques. The main reason is an incomplete consideration of event sequence correlations. In this paper we present a new technique that improves the output jitter calculation by correlating jitter and response times and offers significantly tighter analysis bounds.

关键词： Jitter Performance analysis Processor scheduling Job shop scheduling algorithm design and analysis scheduling algorithm Real time systems Delay Time division multiple access Round robin

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：