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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

10,730 篇 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...
945 篇 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,590 篇 英文
82 篇 其他
58 篇 中文

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

共 10730 条记录，以下是4641-4650 订阅

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

详细简洁

排序：

Investigation of implementing a synchronization protocol under multiprocessors hierarchical scheduling

Investigation of implementing a synchronization protocol und...

引用

International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Farhang Nemati Moris Behnam Thomas Nolte Reinder J. Bril Mälardalen Real-Time Research Centre Mälardalen University Sweden Eindhovan University of Technology Netherlands

In the multi-core and multiprocessor domain, there has been considerable work done on scheduling techniques assuming that real-time tasks are independent. In practice a typical real-time system usually share logical resources among tasks. However, synchronization in the multiprocessor area has not received enough attention. In this paper we investigate the possibilities of extending multiprocessor hierarchical scheduling to support an existing synchronization protocol (FMLP) in multiprocessor systems. We discuss problems regarding implementation of the synchronization protocol under the multiprocessor hierarchical scheduling.

关键词： Processor scheduling Access protocols Real time systems Multiprocessing systems scheduling algorithm Energy consumption Multicore processing

来源：评论

学校读者我要写书评

暂无评论

Modeling and Performance Evaluation of Hierarchical Job scheduling on the Grids

Modeling and Performance Evaluation of Hierarchical Job Sche...

引用

第六届网格与协同计算国际会议(The Sixth International Conference on Grid and Cooperative Computing GCC 2007)

作者： Zhiguang Shan Chuang Lin Department of Informatization Research State Information Center Beijing 100045 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China

Job scheduling is a fundamental issue in achieving high performance on the Grids. In this paper, a hierarchical job scheduling architecture has been proposed for the *** stochastic high-level Petri net (SHLPN) model of the proposed architecture and the refined model are *** job scheduling algorithms for an incoming job to be distributed to a waiting queue of any processor in any node of the Grid architecture is integrated by the node-selection algorithm at the global scheduler, the job-dispatching algorithm at the local scheduler, and job-scheduling algorithm at the processor scheduler. The integrated job scheduling policy is investigated using SHLPN performance analysis methods. The performnance metrics concerned include the delay time of jobs in the Grid node and the response time perceived by the *** numerical example shows the efficiency of the performance evaluation technique.

关键词： Processor scheduling scheduling algorithm Performance analysis Grid computing Resource management Stochastic processes Space technology Measurement Delay Quality of service

来源：评论

学校读者我要写书评

暂无评论

Behavioural scheduling to balance the bit-level computational effort

Behavioural scheduling to balance the bit-level computationa...

引用

IEEE Computer Society Annual Symposium on VLSI

作者： M.C. Molina R. Ruiz-Sautua J.M. Mendias R. Hermida DepartmentoArquitectura de Computadores y Automatica Universidad Complustense de Madrid Spain

Conventional synthesis algorithms schedule multiple precision specifications (formed by operations of different widths) by balancing the number of operations of every different type and width executed per cycle. However, totally balanced schedules are not always possible, even for specifications with a unique width, and therefore some hardware waste appears. In this paper a heuristic scheduling algorithm to minimize this hardware waste is presented. It successively transforms specification operations into sets of smaller ones which are scheduled independently, until the most uniform distribution of the computational effort of operations among cycles is achieved. In consequence some specification operations may be executed during a set of non-consecutive cycles, and over several linked hardware resources. In combination with allocation algorithms able to guarantee the bit-level reuse of hardware resources, our approach substantially reduces datapath area. Additionally, in most cases clock cycles length is also lessened.

关键词： Processor scheduling Signal processing algorithms scheduling algorithm Hardware Resource management Digital signal processing Clocks High level synthesis Iterative algorithms Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Flexible scheduling for wireless IP networks with heterogeneous traffic

Flexible scheduling for wireless IP networks with heterogene...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： T. Janevski B. Spasenovski Faculty of Electrical Engineering Institute of Telecommunications University Sv Kiril i Metodij Skopje Macedonia

Integration of wireless networks and the Internet is an ongoing process. Quality of service (QoS) provisioning is essential for wireless IP networks, due to unpredictable errors in the wireless link and coexistence of multiple traffic classes. We propose a scheduling algorithm, a wireless class-based flexible-fair queuing (WCFQ), intended to support QoS demands of different traffic classes and at time varying error rates. It uses priorities to distinguish between best-effort class and class with guaranteed bandwidth, which is further divided into CBR, VBR and guaranteed best-effort subclasses. WFQ is applied within each class/subclass in an error-free state. During error-state, CBR flows receive their guaranteed service rate until a predefined limit is reached by weight adjustment. The algorithm swaps a portion of bandwidth shares between erroneous and error-free best-effort flows what leads to their maximized throughput over long time scales.

关键词： IP networks Telecommunication traffic Traffic control Wireless networks Quality of service scheduling algorithm Error analysis Bandwidth Computer errors Throughput

来源：评论

学校读者我要写书评

暂无评论

Proportional fairness packet scheduling with transmit beamforming for multi-user MIMO systems

Proportional fairness packet scheduling with transmit beamfo...

引用

IEEE Radio and Wireless Symposium (RWS formerly RAWCON)

作者： Masoomeh Torabzadeh Wessam Ajib Department of Computer Sciences University of Quebec Montreal (UQAM) Montreal QUE Canada

In this paper, the well known proportional fairness scheduling is investigated when we joint transmit beamforming and packet level scheduling taking into consideration the traffic arrival process with different packet lengths for the downlink of multiple-input multiple-output (MIMO) multi-user systems. The new scheduler called the proportional fairness zero-forcing beamforming (PF-ZB) can perform at the packet level and provide low average packet transmission delay as well as fairness to users. The scheduler is work conserving. We compare the performance of our scheduler with another well known MIMO scheduler when it is performing in the packet level with transmit beamforming. Simulations that consider the traffic characteristics show the low average packet transmission delay and demonstrate the fairness capabilities of PF-ZB.

关键词： scheduling algorithm Array signal processing MIMO Downlink Delay Throughput Transmitting antennas Processor scheduling Traffic control Base stations

来源：评论

学校读者我要写书评

暂无评论

Resource-constrained scheduling of partitioned algorithms on processor arrays

Resource-constrained scheduling of partitioned algorithms on...

引用

Euromicro Workshop on Parallel and Distributed Processing

作者： M. Dion T. Risset Y. Robert CNRS URA Laboratoire LIP Lyon France

We deal with the problem of partitioning and mapping uniform loop nests onto physical processor arrays. Resource constraints are taken into account: not only we assume a limited number of available processors, but we also assume that the communication capabilities of the physical processors are restricted (in particular, the number of communication links in each direction is bounded). This paper is motivated by the recent work of Chou and Kung and of Thiele. Our main contributions are a new formulation of the complex optimization problem to be solved in terms of a single integer linear programming problem, as well as optimal scheduling algorithms and complexity results in the case of linear processor arrays.< >

关键词： Processor scheduling Partitioning algorithms scheduling algorithm Optimal scheduling Integer linear programming Tiles Very large scale integration Concurrent computing Distributed computing algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Assignment constrained scheduling under max/min logic/interconnect delays for placed datapath

Assignment constrained scheduling under max/min logic/interc...

引用

IEEE Asia-Pacific Conference on Circuits and Systems

作者： M. Kaneko K. Ohashi Graduate School of Information Science Japan Advanced Institute of Science and Technology Japan

RT level scheduling under max/min logic/interconnect delays for placed datapath is proposed, which can be a useful tool for interconnect delay aware RTL optimization. Clockless datapath (only controller is clocked) is our target, and peculiar features of our scheduler are; (1) it handles uncertainty/fluctuation of signal delay in the form of max/min delay, and generates guaranteed schedule under those uncertainty/fluctuation, (2) wave pipeline is supported, and (3) communication delay between a controller and components in data-part is also handled

关键词： Logic Propagation delay High level synthesis Clocks Communication system control Pipelines scheduling algorithm Multiplexing Wire Information science

来源：评论

学校读者我要写书评

暂无评论

Loop based scheduling for high level synthesis

Loop based scheduling for high level synthesis

引用

International Phoenix Conference on Computers and Communications (IPCCC)

作者： H.F. Al-Sukhni H. Youssef S.M. Sait M.S.T. Benten Department of Computer Engineering King Fahd University of Petroleum and Minerals Dhahran Saudi Arabia

This paper describes a new loop based scheduling algorithm. The algorithm aims at reducing the runtime processing complexity of path based scheduling techniques. It partitions the control flow graph of the input specification into subgraphs before scheduling the different paths of each subgraph. Benchmark tests as well as simulation results on the scheduling algorithm indicate that the proposed algorithm results in sizeable reduction in runtime.< >

关键词： High level synthesis scheduling algorithm Flow graphs Processor scheduling Benchmark testing Circuit testing Partitioning algorithms Runtime Petroleum Minerals

来源：评论

学校读者我要写书评

暂无评论

Dynamic Control of Tunable Sub-Optimal algorithms for scheduling of Time-Varying Wireless Networks

Dynamic Control of Tunable Sub-Optimal Algorithms for Schedu...

引用

International Workshop on Quality of Service

作者： Mahdi Lotfinezhad Ben Liang Elvino S. Sousa Department of Electrical and Computer Engineering University of Toronto Canada

ISBN: (纸本)9781424420841

It is well known that the generalized max-weight matching (GMWM) scheduling policy, and in general throughput-optimal scheduling policies, often require the solution of a complex optimization problem, making their implementation prohibitively difficult in practice. This has motivated many researchers to develop distributed sub-optimal algorithms that approximate the GMWM policy. One major assumption commonly shared in this context is that the time required to find an appropriate schedule vector is negligible compared to the length of a timeslot. This assumption may not be accurate as the time to find schedule vectors usually increases polynomially with the network size. On the other hand, we intuitively expect that for many sub-optimal algorithms, the schedule vector found becomes a better estimate of the one returned by the GMWM policy as more time is given to the algorithm. We thus, in this paper, consider the problem of scheduling from a new perspective through which we carefully incorporate channel variations and time-efficiency of sub-optimal algorithms into the scheduler design. Specifically, we propose a dynamic control policy (DCP) that works on top of a given sub-optimal algorithm, and dynamically but in a large time-scale adjusts the time given to the algorithm according to queue backlog and channel correlations. This policy does not require the knowledge of the structure of the given sub-optimal algorithm, and with low-overhead can be implemented in a distributed manner. Using a novel Lyapunov analysis, we characterize the stability region induced by DCP, and show that our characterization can be tight. We also show that the stability region of DCP is at least as large as the one for any other static policy. Finally, we provide two case studies to gain further intuition into the performance of DCP.

关键词： scheduling algorithm Dynamic scheduling Wireless networks Polynomials Stability analysis algorithm design and analysis Heuristic algorithms Performance gain Distributed algorithms Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Task scheduling of Parallel Processing in CPU-GPU Collaborative Environment

Task Scheduling of Parallel Processing in CPU-GPU Collaborat...

引用

International Conference on Computer Science and Information Technology (CSIT)

作者： Lei Wang Yong-zhong Huang Xin Chen Chun-yan Zhang Zhengzhou Information Science and Technology Institute Zhengzhou Henan China School of Information Science and Engineering Henan University of Technology Zhengzhou Henan China

With the rapid development of GPU (Graphics Processor Unit) in recent years, GPGPU (General-Purpose computation on GPU) has become an important technique in scientific research. However GPU might well be seen more as a cooperator than a rival to CPU. Therefore, we focus on exploiting the power of CPU and GPU in solving generic problems based on collaborative and heterogeneous computing environment. In this work we present a parallel processing paradigm based on CPU-GPU collaborative computing model to optimize the performance of task scheduling. In addition, we evaluate a new task scheduling algorithm using NVIDIA GeForce 7600GT compare with traditional task scheduling algorithm. The results show that our algorithm increase average performance of 26.5% compared with traditional algorithm. Based on our results and current trends in microarchitecture, we believe that efficient use of CPU-GPU collaborative environment will become increasingly important to high-performance computing.

关键词： Collaboration Computational modeling scheduling algorithm Graphics Processor scheduling algorithm design and analysis scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 461 462 463 464 465 466 467 468 469 470 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：