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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Maximizing throughput multicast routing forwireless networks

Maximizing throughput multicast routing forwireless networks

引用

International Conference on Wireless algorithms, Systems and Applications (WASA)

作者： Xiang-Yang Li Yanwei Wu Department of Computer Science Illinois Institute of Technology Chicago IL USA

Multicast routing for wireless networks has been widely studied in the literature. In this paper, we design efficient algorithm for maximizing multicast throughput in wireless networks. We assume that we are given a set of wireless devices. All wireless devices are assumed to have the uniform (or quasi-uniform) transmission ranges and have the uniform interference range (or quasi-uniform interference range). We further assume that each wireless node V i will have a capacity W i when no interference occurred during its transmission and it can transmit continuously. We present an efficient routing and node scheduling algorithms such that the achieved multicast capacity is within a constant factor of the optimum. Our theoretical throughput performance guarantees are proved under a various number interference models.

关键词： Throughput Routing Interference Wireless networks Time division multiple access scheduling algorithm Multicast algorithms algorithm design and analysis Application software

来源：评论

学校读者我要写书评

暂无评论

Delivery of Guaranteed Rate Internet Traffic with Very Low Delay Jitter

Delivery of Guaranteed Rate Internet Traffic with Very Low D...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

作者： Ted H. Szymanski Dave Gilbert Bell Canada Chair in Data Communications Canada Department ECE McMaster University Hamilton ONT Canada

ISBN: (纸本)9781424411894;1424411890

Telerobotic control systems can tolerate a fixed delay in the control loop, but are highly sensitive to delay jitter. Before such systems can be widely deployed over the Internet, packet switching techniques which ensure a high 'Quality of Service' (QoS) and low delay jitter will be required. It is shown that guaranteed-rate traffic flows can be delivered over the Internet backbone with very low delay jitter, provided that each IP router (and the destination playback buffer) have the capacity to buffer a small number of switch cells per flow. An RSVP or DiffServ algorithm must be used to reserve guaranteed bandwidth and buffer space in the IP routers. Each IP router must schedule the guaranteed rate traffic for transmission according to a recently proposed QoS switch scheduling algorithm, which exploits a Recursive Fair Stochastic Matrix Decomposition algorithm. Computer simulations illustrate that very low delay jitters can be achieved.

关键词： Delay Jitter Switches Quality of service Control systems scheduling algorithm Telerobotics Web and internet services Packet switching Spine

来源：评论

学校读者我要写书评

暂无评论

Design Space Exploration of Media Processors: A Parameterized Scheduler

Design Space Exploration of Media Processors: A Parameterize...

引用

International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (IC-SAMOS)

作者： Guillermo Paya-Vaya Javier Martin-Langerwerf Piriya Taptimthong Peter Pirsch Institute of Microelectronic Systems Gottfried Wilhelm Leibniz University of Hannover Hannover Germany

This paper describes an enhanced list scheduling algorithm used on a parameterized assembler. The assembler, which is configurable in terms of architectural parameters, is used on a new environment system for exploring and optimizing VLIW architectures for multimedia applications. A generic VLIW architecture with a novel register file structure is used as a base architecture. The proposed scheduling algorithm includes sophisticated features. A backtracking technique allows to undo inappropriate scheduling decisions, while an advanced resource conflict function allows to work with different VLIW architecture configurations. Moreover, local register allocation in conjunction with the instruction scheduling process is also implemented for obtaining better code compaction. Two different multimedia tasks are implemented to check the correctness of the generated code for different architecture configurations. The code compaction efficiency, when scheduling these applications for different VLIW architecture configurations with a partitioned register file and limited number of functional units, reaches up to 94% of the compaction efficiency for the same configuration with an unconstrained register file and unlimited number of functional units.

关键词： Space exploration Processor scheduling VLIW Registers scheduling algorithm Compaction Hardware Job shop scheduling Assembly systems algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

VolunteerLive: Introducing Volunteer Nodes into P2P Live Streaming

VolunteerLive: Introducing Volunteer Nodes into P2P Live Str...

引用

International Conference on Intelligent Pervasive Computing (IPC)

作者： Xuping Tu Hai Jin Xiaofei Liao Qi Huang Hong Yao Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9780769530062;0739530060

In P2P live streaming system, service will be degraded when thousands of semi-riders, peers with very limited outbound bandwidth, concurrently join. Due to the limited outbound bandwidth, a semi-rider peer always gets more data than its contributions. In this paper, we propose VolunteerLive, an incentive-based P2P live streaming model, to address this issue. In VolunteerLive, these asymmetrical users are encouraged to "deposit" their bandwidth resources to relay data using their network bandwidth resources. They can enjoy the services as semi-riders in the future. We also propose ContriMax, a heuristics data scheduling algorithm designed for volunteers to collect and maximize the contributions of them. Simulations have been conducted to evaluate the performance of the proposed VolunteerLive and ContriMax. The results show that VolunteerLive model is feasible to support more semi-riders and greatly decrease the stress on the media server.

关键词： Bandwidth Peer to peer computing scheduling algorithm Streaming media algorithm design and analysis Pervasive computing Grid computing Computer science Degradation Relays

来源：评论

学校读者我要写书评

暂无评论

Work-Conserving Fair-Aggregation Across Multiple Core Networks

Work-Conserving Fair-Aggregation Across Multiple Core Networ...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Jorge A. Cobb Zhe Xu Department of Computer Science University of Texas Dallas Richardson TX USA

In the effort of reducing or eliminating per-flow state at routers, hence making QoS schedulers scalable in the core Internet, flow aggregation outperforms dynamic packet state by providing better end-to-end delay guarantee. Work-conserving flow aggregation (WCFA) has the advantage of gaining work-conserving property at the cost of an extra per-hop delay. Most research on work-conserving flow aggregation so far has focused on a single level of flow aggregation within a single aggregation domain. In this paper, we investigate the per-hop behavior of flow aggregation over multiple aggregation domains. Moreover, in each aggregation domain, multiple aggregation levels are considered. We show that the aggregating cost happens only once in each aggregation domain over all aggregation levels, and higher level of flow aggregation provides lower per-hop delay guarantee.

关键词： Quality of service Delay Aggregates scheduling algorithm Dynamic scheduling Costs Video on demand Diffserv networks Clocks Virtual colonoscopy

来源：评论

学校读者我要写书评

暂无评论

Multi-Thread Polling: A Dynamic Bandwidth Distribution Scheme in Long-Reach PON

Multi-Thread Polling: A Dynamic Bandwidth Distribution Schem...

引用

IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference

作者： Huan Song Amitabha Banerjee Byoung-Whi Kim Biswanath Mukherjee Department of Computer Science University of California Davis USA Electronics and Telecommnications Research Institute Daejeon South Korea

With the development of optical technology, the span of a broadband access network using passive optical network (PON) technology can be increased from today's standard of 20 km to 100 km or higher. As a result, we have the long-reach (LR) PON which not only has extended reach, but which can also support a large base of users by employing wavelength-division multiplexing (WDM) for its data transmissions. However, a major challenge in the LR-PON is that the propagation delay (for data as well as control signals) between the telecom central office (CO) and the end user is increased by a very significant amount. Now, traditional PON algorithms for scheduling the upstream transmission, such as dynamic bandwidth allocation (DBA) algorithms, may not be sufficient; actually, they may lead to degraded performance because of the long delay of the "control loop" between the CO and the users. This challenge motivates us to investigate a multi-thread polling algorithm to distribute the upstream bandwidth dynamically in the LR-PON. In this study, we analyze key parameters of the algorithm, such as initiating and tuning multiple threads. We then demonstrate the algorithm's advantage to decrease the average packet delay under varying offered loads.

关键词： Bandwidth Passive optical networks Wavelength division multiplexing Telecommunication control scheduling algorithm Optical fiber networks Standards development Data communication Propagation delay Centralized control

来源：评论

学校读者我要写书评

暂无评论

Comparing the latency performance of the DTable and DRR schedulers

Comparing the latency performance of the DTable and DRR sche...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Raul Martinez Francisco J. Alfaro Jose L. Sanchez Computing Systems Department University of Castilla La Mancha Albacete Spain

A key component for networks with quality of service (QoS) support is the egress link scheduling algorithm. An ideal scheduling algorithm implemented in a high performance network with QoS support should satisfy two main properties: good end-to-end delay and implementation simplicity. The deficit round robin (DRR) algorithm is known to have a very little implementation complexity. However, depending on the situation, its latency performance can be very bad. On the other hand, table-based schedulers try to offer a simple implementation and good latency bounds. Some of the latest proposals of network technologies, like advanced switching and infiniband, include in their specifications one of these schedulers. However, these table-based schedulers do not work properly with variable packet sizes and face the problem of bounding the bandwidth and latency assignments. We have proposed a new table-based scheduler, which we have called deficit table (DTable) scheduler, that works properly with variable packet sizes. Moreover, we have proposed a methodology to configure this table-based scheduler to decouple the bounding of bandwidth and latency assignments. In this paper, we review these proposals and present simulation results that show that the DTable scheduler is able to provide a better latency performance than the DRR scheduler, with only a slightly higher implementation and computational complexity.

关键词： Delay Processor scheduling Quality of service scheduling algorithm Round robin Bandwidth Job shop scheduling Proposals Computational complexity Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Fast Fair Crossbar Scheduler for On-chip Router

Fast Fair Crossbar Scheduler for On-chip Router

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Shyue-Wen Yang Ming-Hwa Sheu Chun-Kai Yeh Chih-Yuen Wen Chih-Chieh Lin Wen-Kai Tsai Graduate School of Engineering Science & Technology National Yunlin University of Science and Technology Yunlin Taiwan Department and Institute of Electronic Engineering National Yunlin University of Science and Technology Yunlin Taiwan

This paper proposed a scheduling algorithm for a low-cost crossbar switch design in on-chip packet-switched micro-network. The scheduling algorithm is based on a distributed arbitration scheme over crossbar fabric. Each input port is designed with a mask circuit which can provide fair arbitration. As a result, our scheduler has lower power consumption because it does not need to toggle each node frequently. Experimental results show that designs utilizing our approach can reduce scheduling delay and hardware costs more than 43% and 49% respectively, as compared to those of the popular round robin algorithm. Based on the proposed scheme for 8-input scheduling circuit design, the critical delay is 0.98 ns and the power consumption is 98 muW with 50% traffic load at 100 MHz grant signal frequency in TSMC 0.18 mum technology

关键词： scheduling algorithm Switches algorithm design and analysis Energy consumption Delay Round robin Packet switching Fabrics Circuits Hardware

来源：评论

学校读者我要写书评

暂无评论

Bus Network Optimization Through Time-Dependent Hybrid algorithm

Bus Network Optimization Through Time-Dependent Hybrid Algor...

引用

International Conference on Intelligent Systems Design and Applications (ISDA)

作者： Ana C. Olivera Mariano Frutos Jessica A. Carballido Nelida B. Brignole Departamento de Ciencias e Ingeniería de la Computación Universidad Nacional del Sur Bahia Blanca Argentina Departamento de Ciencias e Ingeniería Universidad Nacional del Sur Bahia Blanca Argentina Planta Piloto Ingeniería Química (PLAPIQUI) Camino la Carrindanga Universidad Nacional del Sur Bahia Blanca Argentina

This paper focuses on a new hybrid technique that combines a genetic algorithm with simulation to solve the bus-network scheduling problem (BNSP). The BNSP has several factors that complicate both the problem formulation and the selection of efficient algorithms for its resolution. This problem is challenging because not only the BNSP is NP-complete, but also the existing methods fail to contemplate environment dependent dynamic variables. The hybrid algorithm proposed in this article comprises two stages: a modified GRASP (greedy randomized adaptive search procedures) as an initialization method, and the genetic algorithm with simulation to find the values of the environment- dependent dynamic variables. The final goal consisted in designing a meta-heuristic technique that yields an adequate scheduling to solve this general problem. The BNSP, chosen as case study, satisfies both the demand and the offer of transport. The method was applied to a solution of experimental examples with good results.

关键词： Genetic algorithms Equations Computer networks Computational modeling Hybrid intelligent systems Intelligent networks Design optimization scheduling algorithm Urban areas Environmental economics

来源：评论

学校读者我要写书评

暂无评论

Fair bandwidth allocation framework for heterogeneous multi-radio Wireless Mesh Networks

Fair bandwidth allocation framework for heterogeneous multi-...

引用

International Conference on Broadband Networks (BroadNets)

作者： Shree Raman Aura Ganz Ramgopal R. Mettu Department of Electrical and Computer Engineering University of Massachusetts Amherst Amherst MA USA

To reap the benefits of advances in wireless technologies as well as provide backward compatibility with current investments, future wireless routers that constitute the backbone of Wireless Mesh Networks (WMNs) will be equipped with multiple radios of different technology standards. The multiplicity of channels, radios and technology standards makes the problem of efficient network utilization in a WMN more challenging. Unlike previous works that focused only on homogeneous WMNs, in this paper, we focus on determining an effective routing, channel assignment and scheduling scheme that maximizes the network capacity, while maintaining node level fairness in a heterogeneous network setting. We first introduce a novel graph model that captures the WMN heterogeneity in terms of the number of radios and radio technologies. Using this model, we provide an optimization formulation that determines the effective routing scheme and traffic values on each edge. To determine an interference-free channel assignment of these traffic values, we introduce a joint channel assignment and scheduling algorithm that preserves node level fairness. We perform an extensive evaluation of our solution in homogeneous and heterogeneous networks and study the impact of the number of orthogonal channels, radios, gateways and the aggregate traffic demand on the performance of our solution. Our results show that the proposed scheme obtains node level fairness while maximizing the network capacity.

关键词： Channel allocation Wireless mesh networks Telecommunication traffic Routing Traffic control Investments Spine Interference scheduling algorithm Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 452 453 454 455 456 457 458 459 460 461 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：