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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Providing 100% Throughput in a Buffered Crossbar Switch

Providing 100% Throughput in a Buffered Crossbar Switch

引用

IEEE Workshop on High Performance Switching and Routing

作者： Yanming Shen Shivendra S. Panwar H. Jonathan Chao Department of Electrical and Computer Engineering Polytechnic University Japan

Buffered crossbar switches have received great attention recently because they have become technologically feasible, have simpler scheduling algorithms, and achieve better performance than a bufferiess crossbar switch. Buffered crossbar switches have a buffer placed at each crosspoint. A cell is first delivered to a crosspoint buffer and then transferred to the output port. With a speedup of two, a buffered crossbar switch has previously been proved to provide 100% throughput. We propose what we believe is the first feasible scheduling scheme that can achieve 100% throughput without speedup and a finite crosspoint buffer. The proposed scheme is called SQUISH: a Stable Queue Input-output Scheduler with Hamiltonian walk. With SQUISH, each input/output first makes decisions based on the information from the virtual output queues and crosspoint buffers. Then it is compared with a Hamiltonian walk schedule to avoid possible "bad" states. We then prove that SQUISH can achieve 100% throughput with a speedup of one. Our simulation results also show good delay performance for SQUISH.

关键词： Throughput Switches scheduling algorithm Traffic control Delay Telecommunication traffic Fabrics Chaos Internet Packet switching

来源：评论

学校读者我要写书评

暂无评论

Modelling Alternatives in Temporal Networks

Modelling Alternatives in Temporal Networks

引用

IEEE Symposium on Computational Intelligence in scheduling, CISCHED, SCIS

作者： Roman Bartak Ondirej Cepek Pavel Surynek Charles University Praque Czech Republic Charles University Czech Republic

Temporal networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative paths in the network; in particular, it is motivated by modelling alternative process routes in manufacturing scheduling. We show that deciding which nodes can be consistently included in this extended temporal network is an NP-complete problem. To simplify solving this problem, we propose a pre-processing step whose goal is to identify classes of equivalent nodes. The ideas are presented using precedence networks, but we also show how they can be extended to simple temporal networks

关键词： Job shop scheduling Resource management Manufacturing processes Mathematics Physics Processor scheduling Virtual manufacturing scheduling algorithm Computational intelligence NP-complete problem

来源：评论

学校读者我要写书评

暂无评论

Improving Performance Isolation on Chip Multiprocessors via an Operating System Scheduler 07

Improving Performance Isolation on Chip Multiprocessors via ...

引用

International Conference on Parallel Architecture and Compilation Techniques (PACT)

作者： Alexandra Fedorova Margo Seltzer Michael D. Smith Simon Fraser University Harvard University

ISBN: (纸本)9780769529448

We describe a new operating system scheduling algorithm that improves performance isolation on chip multiprocessors (CMP). Poor performance isolation occurs when an application's performance is determined by the behaviour of its co-runners, i.e., other applications simultaneously running with it. This performance dependency is caused by unfair, co- runner-dependent cache allocation on CMPs. Poor performance isolation interferes with the operating system 's control over priority enforcement and hinders QoS provisioning. Previous solutions required modifications to the hardware. We present a new software solution. Our cache-fair algorithm ensures that the application runs as quickly as it would under fair cache allocation, regardless of how the cache is actually allocated. If the thread executes fewer instructions per cycle than it would under fair cache allocation, the scheduler increases that thread's CPU time slice. This way, the thread's overall performance does not suffer because it is allowed to use the CPU longer. We describe our implementation of the algorithm in Solaristrade 10, and show that it significantly improves performance isolation for SPEC CPU, SPEC JBB and TPC-C.

关键词： System-on-a-chip Operating systems Yarn Hardware scheduling algorithm Application software Control systems Processor scheduling Partitioning algorithms Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Single-Hop All-to-All Broadcast in Optical Star Networks with Breakdown or Power-Off Transceivers

Single-Hop All-to-All Broadcast in Optical Star Networks wit...

引用

IFIP International Conference on Wireless and Optical Communications Networks (WOCN)

作者： JungChun Liu Hann-Jang Ho SingLing Lee Department of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan Department of Information Management Department of Computer Science and Information Engineering Wu Feng Institute of Technology Chiayi Taiwan

Packet scheduling provides a way to reduce routing control and guarantee overall throughput. An interesting special case of the packet scheduling is all-to-all broadcast in which every transmitter/receiver pair has exactly one packet to be transferred. Several optimal scheduling algorithms have been proposed for the all-to-all broadcast problem in wavelength division multiplexed (WDM) optical star networks. However, these algorithms do not fit anymore when failures occur in some transceivers. In this paper, we consider the all-to-all broadcast problem in WDM optical star network with some breakdown or power-off transceivers. We focus on the all-optical scheduling problem where the traffic reaches its destination in single-hop without being converted to electronic form for reaching high data transmission rates. The transmitters are tunable with an associated tuning delay, and the receivers are fixed-tuned to one of the available wavelengths. In this model, we first identify the lower bounds of the scheduling length for the problem. Then, we propose single-hop scheduling algorithms to find the optimal solution in both terms of arbitrary number of wavelengths and value of tuning latency.

关键词： Broadcasting All-optical networks Optical fiber networks Electric breakdown Transceivers Optical receivers Optical transmitters scheduling algorithm Optimal scheduling Wavelength division multiplexing

来源：评论

学校读者我要写书评

暂无评论

Resource-Locking Durations in EDF-Scheduled Systems

Resource-Locking Durations in EDF-Scheduled Systems

引用

IEEE Symposium on Real-Time and Embedded Technology and Applications

作者： Nathan Fisher Marko Bertogna Sanjoy Baruah

The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared "open" platform. The concept of resource hold time (RHT) - the largest length of time that may elapse between the instant that an application system locks a resource and the instant that it subsequently releases the resource - is formally defined and studied in this paper. An algorithm is presented for computing resource hold times for every resource in an application that is scheduled using earliest deadline first scheduling, with resource access arbitrated using the stack resource policy. An algorithm is presented for decreasing these RHT's without changing the semantics of the application or compromising application feasibility

关键词： Processor scheduling Real time systems scheduling algorithm Timing Admission control Runtime environment

来源：评论

学校读者我要写书评

暂无评论

An Architecture for IEEE 802.16 MAC Scheduler Design

An Architecture for IEEE 802.16 MAC Scheduler Design

引用

IEEE International Conference on Networks

作者： Tze Wei Tang David Green Michael Rumsewicz Nigel Bean School of Electrical & Electronic Engineering University of Adelaide SA Australia School of Mathematical Sciences University of Adelaide SA Australia

ISBN: (纸本)9781424412297;1424412293

The scheduling algorithm for IEEE 802.16 broadband wireless access system has been left open in the standard. In this paper, we consider three criteria that we have identified as important criteria for an 802.16 scheduler: Service Type differentiation, dynamic sub-frame partition and Subscriber Station differentiation. We investigate the scheduler design from a general perspective, based on these three criteria.

关键词： Dynamic scheduling Portable media players scheduling algorithm Data communication Downlink Round robin algorithm design and analysis Design engineering Australia Internet

来源：评论

学校读者我要写书评

暂无评论

Joint Source Coding and Data Rate Adaptation for Multi-User Wireless Video Transmission

Joint Source Coding and Data Rate Adaptation for Multi-User ...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Fan Zhai Zhu Li Aggelos K. Katsaggelos Digital Entertainment Products Texas Instrumenits Inc. Dallas TX USA Motorola Laboratories Multimedia Research Laboratory Schaumburg IL USA Department of EECS Northwestern University Evanston IL USA

Much attention has been paid to the problem of optimally utilizing resources such as spectrum, power and time in order to achieve the best video delivery quality in wireless communications system, due to the fueling demand for such applications. In this work, we present a joint source coding and data adaptation scheme for downlink video transmission in a multi-user wireless network. We formulate a rate-distortion optimization problem, where the source coding and data rate are jointly designed according to the changing channel conditions. In addition, transmissions of video packets are optimally scheduled through exploiting the multi-user diversity. We solve the problem using a backward stochastic dynamical programming approach, and the simulation results have shown the advantage of the joint selection of source coding parameter and transmission rate coupled with optimal packet scheduling.

关键词： Source coding Wireless communication Downlink Wireless networks Rate-distortion Design optimization Stochastic processes Dynamic programming Couplings scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Network Calculus Modeling and QoS Analysis for Wireless Packet Networks

Network Calculus Modeling and QoS Analysis for Wireless Pack...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Xu Haibo Gao Youjun Tian Hui Ji Yang Key Laboratory of Universal Wireless Communication Ministry of Education Wireless Technology Innovation Institute Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Universal Wireless Communication Beijing University of Posts & Telecommunications Haidian District Beijing P.R.China Beijing University of Posts and Telecommunications Beijing Beijing CN

A modeling method for wireless packet networks based on network calculus (NC) theory, employing the concatenation of NC components to represent the effects of the modules constituting wireless packet networks model, is proposed in this paper. Three well-known scheduling algorithms are modified to agree with the proposed NC model. A new scheduling algorithm for packet networks is proposed in the context of NC. Simulations then are done to study the end-to-end QoS characteristics of the networks with different scheduling algorithms. The result shows that, in terms of the criterions defined in NC model, the scheduling algorithm proposed in this paper outperforms the existing three algorithms.

关键词： Calculus scheduling algorithm Wireless networks Round robin Context modeling Performance analysis Telecommunication traffic Traffic control Network servers Context-aware services

来源：评论

学校读者我要写书评

暂无评论

Adaptive cross-layer techniques for cellular systems and WLANs: simulative results within NEWCom Proj.C

Adaptive cross-layer techniques for cellular systems and WLA...

引用

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

作者： Alessandro Bazzi Nikos Dimitriou Andrea Conti CNIT research units University of Bologna Ferrara Italy IASA research unit National and Kapodistrian University of Athens Greece

This work reports some results of a joint activity research pursued within the Project C of NEWCom (European network of excellence in communications). The aim of the activity is to investigate adaptive cross-layer techniques for heterogeneous wireless networks and try to obtain some general rules. In particular the singular or joint adaptation of scheduling and link adaptation algorithms is studied by means of simulation platforms for which proper scenarios and metrics have been defined.

关键词： Wireless networks Wireless LAN scheduling algorithm Frequency Quality of service Job shop scheduling 3G mobile communication Resource management Wireless application protocol Cellular networks

来源：评论

学校读者我要写书评

暂无评论

Load balanced distributed schedulers for WASPNET Optical packet switches maintaining packet order

Load balanced distributed schedulers for WASPNET Optical pac...

引用

ICTON Mediterranean Winter Conference

作者： Miguel Rodelgo-Lacruz Cristina Lopez-Bravo Francisco J. Gonzalez-Castano Departamento de Ingeniería Telemática ETSI Telecomunicación Universidad de Vigo Vigo Spain

Previously the author's (Lopez-Bravo et al., 2007) proposed the Load Balanced WASPNET Scheduler (LBWS), a novel scheduling approach for WASPNET optical packet switching (OPS) nodes. Unlike the original WASPNET description, LBWS is fully distributed and its computational cost is independent from switch size. Since it predicts packet delays at packet ingress based on a deterministic evolution of the switch configuration, it is not necessary to emulate RAM memories. However, LBWS does not maintain the packet sequence. In this paper we present the LBWS algorithm with packet ordering (OLBWS), the first step to prevent mis-sequencing in a LBWS scheduler. We show that despite the algorithm simplicity a reasonable throughput can be achieved.

关键词： Optical packet switching Optical buffering Packet switching Optical switches Delay Processor scheduling WDM networks scheduling algorithm Wavelength division multiplexing Wavelength conversion

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 455 456 457 458 459 460 461 462 463 464 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：