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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

LOOFA-PB: A Modified LOOFA Scheduler for Variable-Length Packet Switching

LOOFA-PB: A Modified LOOFA Scheduler for Variable-Length Pac...

引用

IEEE International Conference on Communications (ICC)

作者： A. Shiravi P. S. Min Department of Electrical and Systems Engineering Washington University Saint Louis USA

The LOOFA algorithm is a cell-based scheduler for CIOQ crossbar switches that can guarantee the work-conserving property in a cell-based switch if the crossbar switch works twice as fast as the line rate (speedup of two). Unfortunately, the cell based LOOFA algorithm is not work-conserving for variable- length packet switches because it interleaves the cells from different inputs to a particular output and does not necessarily serve cells belonging to a packet contiguously. Thus, the cells belonging to a variable- length packet must be reassembled at the output port before the packet can be transmitted. This requires a large buffer at the output stage, and causes extra delays. PLF, which is another suggested scheduling algorithm for variable-length packet switches, has its own limitations. PLF must use a considerable amount of memory at every crosspoint of the buffered crossbar, making the overall complexity high. In this paper we examine the work conserving property of the LOOFA and the PLF algorithms in variable-length packet switches and propose a packet-based version of the LOOFA (called the LOOFA-PB) for variable-length packets. The proposed algorithm is a (L max /2)-work- conserving algorithm and does not need a buffered crossbar or a speedup greater than two. In addition, the LOOFA-PB algorithm eliminates the need for reassembly and serves packets contiguously. As a result, it reduces the overall packet delay. Finally, eliminating the SAR functionality from the algorithm results in a smaller die size when implemented in an ASIC, and cheaper cost.

关键词： Packet switching Switches scheduling algorithm Delay Communications Society Systems engineering and theory Communication switching Application specific integrated circuits Cost function Hardware

来源：评论

学校读者我要写书评

暂无评论

DLX gold: design and implementation of a DLX microprocessor with single precision floating- point operations

DLX gold: design and implementation of a DLX microprocessor ...

引用

IEEE Region 10 International Conference TENCON

作者： John Edrian H. Aguilar Rosario M. Reas John Benedict B. Villangca Anastacia P. Ballesil Joy Alinda P. Reyes Intel Microprocessors Laboratory Department of Electrical and Electronics Engineering University of Philippines Philippines

Floating point (FP) arithmetic is an integral part of modern processors because numerous programs need to perform FP operations. The project aimed to implement a 32-bit pipelined DLX microprocessor that can handle single precision FP operations. This project made use of the class 1 architecture for FP operations, which has an independent unit for addition, multiplication, and division. Furthermore, dynamic scheduling, specifically the speculative Tomasulo algorithm, was employed to effectively handle the parallel execution of instructions. The structural model was implemented using VHDL (VHSIC hardware description language). Afterwards, the functionality was verified using the Cadencereg design system software. Finally, the schematic and layout were produced also using Cadencereg. The implemented microprocessor was then characterized in terms of speed, area, and power consumption. The addition of the FP Units resulted in a 53% decrease in execution time, with an area and power overheads of 98% and 65% respectively.

关键词： Gold Microprocessors Floating-point arithmetic Dynamic scheduling scheduling algorithm Power system modeling Very high speed integrated circuits Hardware design languages Software design System software

来源：评论

学校读者我要写书评

暂无评论

Embedded linux scheduler monitoring

Embedded linux scheduler monitoring

引用

12th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2007), vol.2

作者： Zdenek Slanina Vilem Srovnal Technical University of Ostrava Ostrava Czech Republic

The article deals with a design of application for scheduling and process behavior monitoring in operating systems Linux and RTLinux. Described application gathers data by remote machines (targets) with ethernet connection possibility and shows processes and scheduler activities. The monitoring application stores data in database and allows diagrammatizing target system behavior for online or offline analysis.

关键词： Linux Kernel Operating systems scheduling algorithm Real time systems Delay Yarn Embedded computing Remote monitoring Control systems

来源：评论

学校读者我要写书评

暂无评论

Reuse Efficiency of Point-To-Point Connections in Ad Hoc Networks

Reuse Efficiency of Point-To-Point Connections in Ad Hoc Net...

引用

IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference

作者： Luca Campelli Matteo Cesana Flaminio Borgonovo Dipartimento Elettronica e Informazione Politecnico di Milano Milan Italy

The efficiency of point-to-point (PTP) connections in ad hoc networks highly depends on the capability of the medium access control (MAC) layer to reuse the shared wireless resource. One of the most critical impairments to the reuse capability is the exposed terminal problem which may prevent feasible PTP communications to run in parallel. In this paper we evaluate the impact of the exposed terminal on the reuse efficiency of PTP communications in ad hoc random networks. To this end, we propose a scheduling algorithm for PTP connections within the framework of ADHOC MAC, a recently proposed MAC scheme. The simulative results we gather show that the solution of the exposed terminal problem provides a reuse efficiency gain around the 40% in the network scenario we considered.

关键词： Ad hoc networks Media Access Protocol Access protocols scheduling algorithm Bandwidth Data communication Auditory system Radio transmitters Throughput Testing

来源：评论

学校读者我要写书评

暂无评论

Distributed Power Control in Multihop Ad Hoc CDMA Networks

Distributed Power Control in Multihop Ad Hoc CDMA Networks

引用

IEEE International Conference on Communications (ICC)

作者： G. Kesidis A. Neishaboori CSE and EE Departments Pennsylvania State University University Park PA USA

In this paper, we propose a distributed power control algorithm for multihop ad hoc CDMA networks. The algorithm attempts to maximize the QoS of each user as well as a global network utility, given a set of routes and link schedules. By defining the local objective of each node as a summation of its own utility and that of the "bottleneck" nodes in its vicinity, users are considered partially cooperative. Since the overall QoS of a single flow is determined by the minimum received QoS among all of its subflows, the global network utility is defined only based on these bottleneck QoS's for each user.

关键词： Power control Spread spectrum communication Multiaccess communication Ad hoc networks scheduling algorithm Utility programs Peer to peer computing Signal to noise ratio Frequency Communications Society

来源：评论

学校读者我要写书评

暂无评论

Schedules Cluster Recognition with Use Conditional Probability

Schedules Cluster Recognition with Use Conditional Probabili...

引用

IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications

作者： Witkowski Tadeusz Antczak Arkadiusz Antczak Pawel Production Engineering Warsaw University of Technology Warsaw Poland

This paper presents use conditional probability for schedules cluster recognition problem. Task scheduling in this approach are generated with the function, which defines the dependence between random parameter of priority rule and the operation number. There are some algorithms, which differ from each other in type and in the manner of change value of these functions. The paper gives the formulation of schedules cluster recognition problem and basic grid-based clustering algorithm is described. Schedules are generated too by the optimization algorithms (for example: simulated annealing, taboo method, genetic algorithm, and other mataheuristic) many times in the clustering process. Structures for some of schedules are considered.

关键词： Clustering algorithms scheduling algorithm Processor scheduling Optimization methods Simulated annealing Conferences Data acquisition Production engineering Random number generation Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Sorting Packets by Packet Schedulers Using a Connected Trie Data Structure

Sorting Packets by Packet Schedulers Using a Connected Trie ...

引用

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

作者： M. E. Kounavis A. Kumar R. Yavatkar Intel Corporation USA

Packet scheduling is a critical component of router data paths because it allows routers to divide bandwidth intelligently between competing flows. A large number of scheduling algorithms annotate packets with time stamps and subsequently sort these packets according to their annotated time stamp values. For these algorithms the problems of efficiently tagging and sorting packets are still open to investigation. In this paper we propose a data structure and algorithm that reduces the latency of determining the packet with the smallest time stamp to a single memory access time and a small constant number of computation steps, independent of the number of flows serviced by the scheduler. The complexity of inserting a packet into our sorting data structure is logarithmic as a function of the ratio between the maximum packet size and minimum connection weight. The latency of inserting a packet can be hidden by performing insertions of several packets in parallel. This is the fastest sorting data structure known to us. One of the most efficient alternative implementation techniques proposed by Chao et. al. [20] is associated with logarithmic complexity of the scheduling decision time, as a function of the maximum value of packet time stamps. Our solution applies to many different packet fair queuing algorithms including Weighted Fair Queuing [28], Self-Clocked Fair Queuing (SCFQ) [28] and Start Time Fair Queuing [4].

关键词： Sorting scheduling algorithm Data structures Delay Processor scheduling Bandwidth Costs Data flow computing Communications Society USA Councils

来源：评论

学校读者我要写书评

暂无评论

New Schedulability Conditions for Real-Time Multiframe Tasks

New Schedulability Conditions for Real-Time Multiframe Tasks

引用

Euromicro Conference on Real-Time Systems

作者： Wan-Chen Lu Kwei-Jay Lin Hsin-Wen Wei Wei-Kuan Shih Department of Computer Science National Tsing Hua University Hsinchu Taiwan Department of Electrical Engineering and Computer Science University of California Irvine CA USA

ISBN: (纸本)9780769529141;0769529143

The real-time multiframe task model first studied by Mok and Chen assumes that the computation times of a periodic task vary instance by instance. They have derived an utilization bound for verifying the schedulability of multiframe task sets. Their schedulability test has since been improved by other researchers. In this paper we use the information about the relative period ratios between tasks in a system to derive a new schedulability condition. By considering the smallest and the largest period values in a system, we can show that the RM schedulability bound can be improved significantly. This method also can be applied to other test methods studied earlier to improve the schedulability of real-time multiframe systems.

关键词： Processor scheduling Real time systems Computer science System testing scheduling algorithm Terminology

来源：评论

学校读者我要写书评

暂无评论

Deadline-based QoS algorithms for High-performance Networks

Deadline-based QoS Algorithms for High-performance Networks

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Alejandro Martinez Francisco J. Alfaro Jose L. Sanchez Jose Duato DSI University of Castilla La Mancha Albacete Spain DISCA Technical University of Valencia Valencia Spain

Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because it could allow a more efficient use of resources. Deadline-based algorithms can provide powerful QoS provision. However, the cost associated with keeping ordered lists of packets makes them impractical for high-performance networks. In this paper, we explore how to adapt efficiently the earliest deadline first family of algorithms to the high-speed networks environments. The results show excellent performance using just two virtual channels, FIFO queues, and a cost feasible with today's technology.

关键词： Quality of service Switches Telecommunication traffic Traffic control Packet switching Ethernet networks Parallel machines Costs Virtual colonoscopy scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

The Theoretical Framework of the Optimization of Public Transport Travel

The Theoretical Framework of the Optimization of Public Tran...

引用

Computer Information Systems and Industrial Management Applications (CISIM)

作者： Jolanta Koszelew Faculty of Computer Science Bialystok Technical University Poland

With the increase of cars on the streets, more and more people in big cities, decide to move from one place to another by public transport, such as tram, metro or bus. Public transport users need detail informations about network connections. Therefore, some urban portals offer to use systems of optimization of public transport travel. However, finding one or several optimal routes, according to user preferences, is a difficult problem. This paper presents an original method for determining optimal paths in public transportation network. Author describes a network model with time- dependent and bi-modal links, defines the problem of finding optimal routes with users' preferences and proposes algorithm, which can be a solution of this problem.

关键词： Cities and towns Road transportation scheduling algorithm Computer science Portals Foot Labeling Legged locomotion Management information systems Computer industry

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：