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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

10,833 篇 scheduling algor...
4,083 篇 processor schedu...
2,061 篇 delay
1,663 篇 throughput
1,575 篇 algorithm design...
1,387 篇 computer science
1,319 篇 resource managem...
1,312 篇 quality of servi...
1,309 篇 real time system...
1,192 篇 bandwidth
1,099 篇 traffic control
974 篇 job shop schedul...
956 篇 dynamic scheduli...
789 篇 costs
742 篇 telecommunicatio...
703 篇 switches
685 篇 optimal scheduli...
589 篇 application soft...
589 篇 heuristic algori...
534 篇 hardware

机构

39 篇 department of el...
31 篇 department of co...
30 篇 department of co...
30 篇 department of co...
30 篇 department of el...
30 篇 department of co...
29 篇 department of el...
29 篇 scuola superiore...
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
22 篇 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
15 篇 j.a. stankovic
15 篇 i. ahmad
15 篇 j.w.s. liu
15 篇 r. srikant
15 篇 binoy ravindran

语言

10,688 篇 英文
87 篇 其他
58 篇 中文

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

共 10833 条记录，以下是4851-4860 订阅

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

详细简洁

排序：

Communication infrastructure of scheduling agents

Communication infrastructure of scheduling agents

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： B.P.-C. Yen K.-W. Chow Department of Industrial Engineering and Engineering Management Hong Kong University of Science and Technology Hong Kong China

scheduling involves the allocation of limited resources to tasks over time. Due to the high complexity of scheduling problems, most scheduling algorithms and procedures are only suitable for specific cases and most scheduling systems are very application-oriented. Until now, no single scheduling system has been able to handle all types of scheduling problems. With the development of the client/server architecture and Internet technology, distributed problem solving by a group of systems becomes feasible where systems can exchange information, share resources and cooperate to solve large and complicated problems. Moreover, intensive research into intelligent software agents and agent technology has offered tools for solving problems and coordination between systems. These tools allow systems to be represented as agents and coordinate their activities through message passing. However, most of the concepts and approaches have been applied to general applications and very little research has been studied the distributed approach to scheduling systems development. In this research, the framework of agent-based distributed scheduling is presented. The research is divided into three parts: Internet scheduling systems; the establishment of communication infrastructure; and the distributed problem solving policy.

关键词： Internet Problem-solving Resource management scheduling algorithm Web server Computer architecture Intelligent agent Software agents Message passing Application software

来源：评论

学校读者我要写书评

暂无评论

An empirical study of conservative scheduling

An empirical study of conservative scheduling

引用

Workshop on Principles of Advanced and Distributed Simulation (PADS)

作者： Ha Yoon Song R.A. Meyer R. Bagrodia UCLA Computer Science Department Los Angeles CA USA

It is well known that the critical path provides an absolute lower bound on the execution time of a conservative parallel discrete event simulation. It stands to reason that optimal execution time can only be achieved by immediately executing each event on the critical path. However, dynamically identifying the critical event is difficult, if not impossible. We examine several heuristics that might help to determine the critical event, and conduct a performance study to determine the effectiveness of using these heuristics for preferential scheduling.

关键词： Processor scheduling Discrete event simulation Electrical capacitance tomography scheduling algorithm Computer science Computational modeling Computer simulation Electronic switching systems Parallel processing Atherosclerosis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Distributed Data Aggregation scheduling in Wireless Sensor Networks

Distributed Data Aggregation Scheduling in Wireless Sensor N...

引用

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

作者： B. Yu J. Li Y. Li School of Computer Science and Technology Harbin Institute of Technology China Department of Computer Science GA USA

ISBN: (纸本)9781424435128

Data aggregation is an essential operation in wireless sensor network applications. This paper focuses on the data aggregation scheduling problem. Based on maximal independent sets, a distributed algorithm to generate a collision-free schedule for data aggregation in wireless sensor networks is proposed. The time latency of the aggregation schedule generated by the proposed algorithm is minimized using a greedy strategy. The latency bound of the schedule is 24D + 6 Delta + 16, where D is the network diameter and Delta is the maximum node degree. The previous data aggregation algorithm with least latency has the latency bound (Delta- Delta 1)R, where R is the network radius. Thus in our algorithm Delta contributes to an additive factor instead of a multiplicative factor, which is a significant improvement. To the best of our knowledge, the proposed algorithm is the first distributed algorithm for data aggregation scheduling. This paper also proposes an adaptive strategy for updating the schedule when nodes fail or new nodes join in a network. The analysis and simulation results show that the proposed algorithm outperforms other aggregation scheduling algorithms.

关键词： Wireless sensor networks scheduling algorithm Delay Processor scheduling Computer science Peer to peer computing algorithm design and analysis Energy consumption Distributed algorithms Analytical models

来源：评论

学校读者我要写书评

暂无评论

Lower bounds on precedence-constrained scheduling for parallel processors

Lower bounds on precedence-constrained scheduling for parall...

引用

International Conference on Parallel Processing (ICPP)

作者： I.D. Baev W.M. Meleis A. Eichenberger Department of Electrical and Computer Engineering Northeastern University Boston MA USA Department of Electrical and Computer Engineering North Carolina State University Raleigh NC USA

We consider two general precedence-constrained scheduling problems that have wide applicability in the areas of parallel processing, high performance compiling, and digital system synthesis. These problems are intractable so it is important to be able to compute tight bounds on their solutions. A tight lower bound on makespan scheduling can be obtained by replacing precedence constraints with release and due dates, giving a problem that can be efficiently solved. We demonstrate that recursively applying this approach yields a bound that is provably tighter than other known bounds, and experimentally shown to achieve the optimal value at least 86.5% of the time over a synthetic benchmark. We compute the best known lower bound on weighted completion time scheduling by applying the recent discovery of a new algorithm for solving a related scheduling problem. Experiments show that this bound significantly outperforms the linear programming-based bound. We have therefore demonstrated that combinatorial algorithms can be a valuable alternative to linear programming for computing tight bounds on large scheduling problems.

关键词： Processor scheduling scheduling algorithm Concurrent computing High performance computing Parallel processing Digital systems Linear programming

来源：评论

学校读者我要写书评

暂无评论

Delay-Optimal Opportunistic scheduling and Approximations: The Log Rule

Delay-Optimal Opportunistic Scheduling and Approximations: T...

引用

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

作者： B. Sadiq S. J. Baek G. de Veciana Department of Electrical and Computer Engineering University of Texas Austin USA College of Information and Communication Korea University South Korea

ISBN: (纸本)9781424435128

This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firstly, for a simplified model falling in the classical Markov decision process framework where arrival and channel statistics are known, we numerically compute and evaluate the characteristics of mean-delay-optimal scheduling policies. The computed policies exhibit radial sum-rate monotonicity (RSM), i.e., when users' queues grow linearly (i.e. scaled up by a constant), the scheduler allocates service in a manner that de-emphasizes the balancing of unequal queues in favor of maximizing current system throughput (being opportunistic). This is in sharp contrast to previously proposed policies, e.g., MaxWeight and Exp rule. The latter, however, are throughput-optimal, in that without knowledge of arrival/channel statistics they achieve stability if at all feasible. To meet performance and robustness objectives, secondly, we propose a new class of policies, called the Log rule, that are radial sum-rate monotone and provably throughput optimal. Our simulations for realistic wireless channels confirm the superiority of the Log rule which achieves up to 80% reduction in mean packet delays. However, recent asymptotic analysis showed that Exp rule is optimal in terms of minimizing the asymptotic probability of max-queue overflow. In turn, in a companion paper we have shown that an RSM policy minimizes the asymptotic probability of sum-queue overflow. Finally, we use extensive simulations to explore the various possible design objectives for opportunistic schedulers. When users see heterogenous channels, we find that minimizing the worst asymptotic exponent across users may excessively compromise the overall delay. Our simulations show that only if perfectly tuned to the load will the Exp rule achieve low homogenous tails across users. Otherwise the Log rule achieves a 20-75% reduction in the 99 th perc

关键词： Delay Robustness Statistics Processor scheduling Throughput scheduling algorithm Stability Tail Resource management Degradation

来源：评论

学校读者我要写书评

暂无评论

scheduling and Binding algorithms for High-Level Synthesis

Scheduling and Binding Algorithms for High-Level Synthesis

引用

Design Automation Conference

作者： P.G. Paulin J.P. Knight BNR Limited Ottawa Canada Department of Electronics Carleton University Ottawa Canada

New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques by making use of a global priority function. A new design-space exploration technique, which combines this algorithm with an existing one based on time constraints, is also presented. A second algorithm is used for register and bus allocation to satisfy two criteria: the minimization of interconnect costs as well as the final register (bus) cost. A clique partitioning approach is used where the clique graph is pruned using interconnect affinities between register (bus) pairs. Examples from current literature were chosen to illustrate the algorithms and to compare them with four existing systems.

关键词： scheduling algorithm High level synthesis Job shop scheduling Partitioning algorithms Costs Concurrent computing Hardware Time factors Permission algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Hybrid uplink scheduling in an integrated 3G/WLAN network with relaying

Hybrid uplink scheduling in an integrated 3G/WLAN network wi...

引用

International Conference on Distributed Computing Systems Workshop

作者： J. Wang J. Liu

We investigate the optimum uplink traffic scheduling algorithm in an hybrid 3G/WLAN network with relaying mobile terminals (RMTs). The proposed scheduling algorithm consists of two levels: (1) we use a proportional scheduling algorithm to coordinate the transmission among RMTs, where the main objectives are to achieve high spectrum efficiency and reasonable fairness; (2) within RMT, packets from different leaf nodes are further scheduled via a link-adaptive CDMA transmission scheme. We demonstrate that power/code allocation inside of the RMT scheduler can effectively reassign slack power among packets according to their BER requirements, which allows some BER-stringent packets to be transmitted at a higher data rate. The simulation results are promising, showing a 28% or higher increase in overall throughput for different traffic patterns.

关键词： Intelligent networks Wireless LAN Relays scheduling algorithm Multiaccess communication Bit error rate Base stations Telecommunication traffic Computational modeling Throughput

来源：评论

学校读者我要写书评

暂无评论

Achieve constant performance guarantees using asynchronous crossbar scheduling without speedup

Achieve constant performance guarantees using asynchronous c...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Deng Pan Kia Makki Niki Pissinou Florida International University Miami FL USA TUM Miami FL USA

Buffered crossbar switches are special crossbar switches with a small exclusive buffer at each crosspoint of the crossbar. They demonstrate unique advantages, such as variable length packet handling and distributed scheduling, over traditional unbuffered crossbar switches. The current main approach for buffered crossbar switches to provide performance guarantees is to emulate push-in-first-out output queued switches. However, such an approach has several drawbacks, and in particular it has difficulty in providing tight constant performance guarantees. To address the issue, we propose in this paper the guaranteed-performance asynchronous packet scheduling (GAPS) algorithm for buffered crossbar switches. GAPS intends to provide tight performance guarantees, and requires no speedup. It directly handles variable length packets without segmentation and reassembly, and makes scheduling decisions in a distributed manner. We show by theoretical analysis that GAPS achieves constant performance guarantees. We also prove that GAPS has a bounded crosspoint buffer size of 3L, where L is the maximum packet length. Finally, we present simulation data to verify the analytical results and show the effectiveness of GAPS.

关键词： Switches Packet switching scheduling algorithm Global Positioning System Bandwidth Performance analysis Throughput Delay Round robin Analytical models

来源：评论

学校读者我要写书评

暂无评论

A token-based admission control and request scheduling in lane reservation systems

A token-based admission control and request scheduling in la...

引用

International Conference on Intelligent Transportation

作者： Kai Liu Sang H. Son Victor C. S. Lee Krasimira Kapitanova Department of Computer Science City University of Hong Kong Hong Kong China Department of Computer Science University of Virginia Charlottesville VA USA

In many parts of the world, the ever-expanding traffic congestion problem has become a major source of wasted fuel, economic burden, and environmental pollution. Alleviating traffic congestion is not only a matter of expanding the transportation capacity, such as adding more lanes or building new roads, but also the problem of providing good traffic management and polices. Recently, the concept of road reservation systems has been widely discussed. With this system, in order to use the lanes and roads controlled by the transportation operators, drivers make reservations in advance. The goal of the system is to provide certain quality of services to the drivers, e.g., guaranteed end to end travel delay. In this work, we focus on the admission control and request scheduling for a reservation system. Specifically, we consider a high-priority lane reservation scenario, in which the system has to determine which vehicles could be allowed to enter the high-priority lane, so that the traffic workload does not exceed the lane capacity. We present a token-based admission control policy that implements the reservation scheme. We have also designed an on-line scheduling algorithm that selects which reservation requests can be allowed based on the admission control policy. Using a simulation model to evaluate the system performance in a variety of scenarios, we show that the proposed algorithm can achieve efficient utilization of the high priority lane.

关键词： Vehicles Admission control Roads scheduling algorithm Traffic control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 482 483 484 485 486 487 488 489 490 491 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：