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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Task parameter computations for constraint deadline real-time systems with EDF scheduling

Task parameter computations for constraint deadline real-tim...

引用

International Conference on Computer Design and Applications (ICCDA)

作者： Fengxiang Zhang Alan Burns Sanjoy Baruah Department of Computer Science Southwest University Chongqing China Department of Computer Science University of York York UK Department of Computer Science University of North Carolina Chapel Hill Chapel Hill NC USA

ISBN: (纸本)9781424471645;9781424471638

The correctness of a real-time system depends on not only the system's output but also on the time at which results are produced. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set, it is very useful in an engineering context to know what changes to task relative deadline and period (interarrival time) can be made to a task that will deliver a schedulable system. In this paper, we address the sensitivity analysis (task parameter computations) of relative deadline and period for EDF scheduled systems on a uniprocessor when the ratio of deadline to period is a fixed value. We show that a task relative deadline and period which will result in a system that is borderline schedulable can be determined by a single pass of the QPA algorithm. This algorithm provides exact and efficient sensitivity analysis for arbitrary deadline real-time systems. The approaches developed for task parameter computations are therefore as efficient as QPA, and are easily incorporated into a system design support tool.

关键词： Real time systems Processor scheduling Job shop scheduling Sensitivity analysis scheduling algorithm Computer science Timing Embedded system Chemical industry Chemical technology

来源：评论

学校读者我要写书评

暂无评论

Routing and scheduling in multi-hop wireless networks

Routing and scheduling in multi-hop wireless networks

引用

IEEE Conference on Vehicular Technology (VTC)

作者： A. Puri P. Varaiya Department of Electrical Engineering and Computer Sciences University of California Berkeley CA USA

We consider the problem of routing and scheduling in a multi-hop wireless network where the wireless links may interfere with each other. The objective of the network operator is to maximize the total amount of traffic carried. We present algorithms for computing traffic flow and the schedule in the wireless network to meet demand and maximize the total traffic carried.

关键词： Routing Intelligent networks Spread spectrum communication Wireless networks Telecommunication traffic Processor scheduling Computer networks Communication system traffic control scheduling algorithm Packet radio networks

来源：评论

学校读者我要写书评

暂无评论

Power reduction through specific instruction scheduling based on Hardware/Software Co-Design

Power reduction through specific instruction scheduling base...

引用

International Conference on ASIC

作者： Kang Zhao Jinian Bian Chenqian Jiang Sheqin Dong Satoshi Goto Department of Computer Science and Technology Tsinghua University Beijing China Graduate School of Information Production and Systems Waseda University Kitakyushu Japan

In this paper, an instruction-level power reduction model for the low power system-on-a-chip is proposed, which combines the hardware and software design together. Firstly, to reduce the power consumption via hardware design, this model is equipped with a specific instruction extraction process, which utilizes a sub-graph matching algorithm. Then a scheduling algorithm is integrated in this model to achieve power compression via reducing the memory access number. Finally, a set of Fir filter programs are power-driven optimized using the proposed model based on hardware/software co-design strategy, and the experimental results indicate that this model can reduce the power consumption effectively.

关键词： Hardware Energy consumption Job shop scheduling Power system modeling Processor scheduling scheduling algorithm Software design System-on-a-chip Power dissipation Constraint optimization

来源：评论

学校读者我要写书评

暂无评论

Fast and efficient voltage scheduling by evolutionary slack distribution

Fast and efficient voltage scheduling by evolutionary slack ...

引用

Asia and South Pacific Design Automation Conference

作者： B. Gorji-Ara Pai Chou N. Bagherzadeh M. Reshadi D. Jensen Center of Embedded Computer Systems University of California Irvine USA Rockwell-Collins Cedar Rapids IA USA

To minimize energy consumption by voltage scaling in design of heterogeneous real-time embedded systems, it is necessary to perfom two distinct tasks: task scheduling (TS) and voltage selection (VS). Techniques propased to date either are fast hut yield inetlicient results, or output efficient solutions after many slow iterations. As a core problem to solve in the inner Iwp of a system-level optimization cycle, it is critical that the algorithm he fast while producing high quality results. This paper presents a new technique called EvolutioMry Relative Slack Distribution Voltage scheduling (ERSD-VS) that achieves both speed and etrciency. It addresses priority adjustment and slack distribution issues with low cost heuristics. Experimental results from running publicly available testhenches show up to 42% energy saving compared to a published technique called EVEN-VS. It also shows up to 70 times speed improvement compared to an efficient technique called EE-GLSA.

关键词： Voltage Processor scheduling Runtime Iterative algorithms Embedded system Testing Delay scheduling algorithm Partitioning algorithms Embedded computing

来源：评论

学校读者我要写书评

暂无评论

Cycle-Accurate Test Power Modeling and its Application to SoC Test scheduling

Cycle-Accurate Test Power Modeling and its Application to So...

引用

IEEE International Test Conference

作者： Soheil Samii Erik Larsson Krishnendu Chakrabarty Zebo Peng Embedded Systems Laboratory Linkoping University Sweden Department of Electrical and Computer Engineering Duke University USA

Concurrent testing of the cores in a modular core-based system-on-chip reduces the test application time but increases the test power consumption. Power models and scheduling algorithms have been proposed to schedule the tests as concurrently as possible while respecting the power budget. The commonly used global peak power model, with a single value capturing the power dissipated by a core when tested, is pessimistic but simple for a scheduling algorithm to handle. In this paper, we propose a cycle-accurate power model with a power value per clock cycle and a corresponding scheduling algorithm. The model takes into account the switching activity in the scan chains caused by both the test stimuli and the test responses during scan-in, launch-and-capture and scan-out. Further, we allow a unique power model per wrapper chain configuration as the activity in a core will be different depending on the number of wrapper chains at a core. Extensive experiments on ITC'02 benchmarks and an industrial design show that the testing time can be substantially reduced (on average 16.5% reduction) by using the proposed cycle-accurate test power model

关键词： System testing Job shop scheduling scheduling algorithm Power system modeling Energy consumption Clocks Sequential analysis Application software Processor scheduling Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Using multiple feedback loops for object profiling, scheduling and migration in soft real-time distributed object systems

Using multiple feedback loops for object profiling, scheduli...

引用

International Symposium on Object-Oriented Real-Time Distributed Computing

作者： V. Kalogeraki P.M. Melliar-Smith L.E. Moser Department of Electrical and Computer Engineering University of California Santa Barbara CA USA

Complex soft real time distributed object systems require object profiling, scheduling and migration algorithms to respond to transient changes in the load or in the availability of the resources. We have developed a resource management system for a soft real time distributed object system that is based on a three level feedback loop which employs a profiling algorithm that monitors the usage of the resources, a least laxity scheduling algorithm that schedules the tasks, and hot spot and cooling algorithms that allocate and migrate objects to balance the load on the resources. The resource management system consists of a single (but possibly replicated and distributed) resource manager, and profilers and schedulers located on each of the processors in the distributed system.

关键词： Feedback loop Resource management Electrical capacitance tomography Processor scheduling scheduling algorithm Availability Real time systems Fault tolerance Monitoring Control systems

来源：评论

学校读者我要写书评

暂无评论

Integrating admission control and packet scheduling for quality controlled streaming services in HSDPA networks

Integrating admission control and packet scheduling for qual...

引用

International Conference on Broadband Networks (BroadNets)

作者： Joseph S. Gomes Hyeong-Ah Choi Jae-Hoon Kim JungKyo Sohn Hyeong In Choi Department of Computer Science George Washington University WA USA SK Telecom Access Network and Mobile Terminal Research and Development Center Seoul South Korea Department of Mathematics Seoul National University Seoul South Korea

High-Speed Downlink Packet Access (HSDPA) uses a shared forward link packet data channel that can achieve peak data rates up to 14.4 Mbps. The newly introduced features that are key to reaching such high rates are link adaptation, Hybrid ARQ (HARQ) and fast scheduling. The decision to admit new users is still taken by the Radio Network Controller (RNC); however, the scheduling role has been moved to the base station (Node-B) for fast adaptability. Although in high speed cellular networks, opportunistic scheduling can exploit multi-user diversity to maximize throughput, with the growing need for strict QoS guarantees for services such as streaming, gaming, and VoIP, a balance should be struck between maximizing throughput and providing user satisfaction. Service operators can enforce their own policies in providing user satisfaction. In this paper, we consider a QoS-aware policy driven scheduling algorithm and its interaction with the admission control mechanism at the RNC. We developed a dynamic HSDPA network simulator in OPNET with link adaptation, HARQ, fast scheduling and quality based admission control. Our simulations show that even with the presence of an admission controller at RNC, the well-known proportional fairness (PF) algorithm dismally fails to provide user satisfaction for streaming services, whereas our Strict Policy scheduling (SPS) algorithm substantially increases user satisfaction as intended by the admission controller while providing a significant cell capacity gain.

关键词： Admission control scheduling algorithm Multiaccess communication Throughput Proportional control Downlink Automatic repeat request Radio network Radio control Base stations

来源：评论

学校读者我要写书评

暂无评论

Efficient task scheduling with duplication for bounded number of processors

Efficient task scheduling with duplication for bounded numbe...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： S. Pasham Wei-Ming Lin Department of Electrical Engineering University of Texas San Antonio San Antonio TX USA

Task scheduling has been known to be one of the challenging issues in parallel and distributed computing. There have been many scheduling algorithms proposed for scheduling tasks onto unlimited number of processors, while, in practical situations, there are only a limited number of processors available. Thus, the goal of this work is to propose several new features to vastly improve the already-efficient bounded-CPFD algorithm (Ahmad and Kwok, 1998). The proposed technique, instead of considering only parent processors when scheduling a task in the original bounded-CPFD algorithm, allows other processors to be considered as well. This heuristic intends to provide a better load balance among the processors in leading to a shorter overall schedule length by allowing potentially more task duplication. Results from an extensive simulation show significant performance improvement from the proposed techniques over the bounded-CPFD.

关键词： Processor scheduling scheduling algorithm Distributed computing Computational modeling NP-complete problem Delay Polynomials Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Minimum energy fixed-priority scheduling for variable voltage processors

Minimum energy fixed-priority scheduling for variable voltag...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Gang Quan X.S. Hu Department of Computer Science & Engineering University of Notre Dame Notre Dame IN USA

ISBN: (纸本)0769514715

To fully exploit the benefit of variable voltage processors, voltage schedules must be designed in the context of work load requirement. In this paper, we present an approach to finding the least-energy voltage schedule for executing real-time jobs on such a processor according to a fixed priority, preemptive policy. The significance of our approach is that the theoretical limit in terms of energy saving for such systems is established, which can thus serve as the standard to evaluate the performance of various heuristic approaches. Two algorithms for deriving the optimal voltage schedule are provided. The first one explores fundamental properties of voltage schedules while the second one builds on the first one to further reduce the computational cost. Experimental results are shown to compare the results of this paper with previous ones.

关键词： Processor scheduling Voltage Real time systems Timing Energy consumption scheduling algorithm Testing Stochastic processes Energy management Power system management

来源：评论

学校读者我要写书评

暂无评论

An Integrated Approach for Processor Allocation and scheduling of Mixed-Parallel Applications

An Integrated Approach for Processor Allocation and Scheduli...

引用

International Conference on Parallel Processing (ICPP)

作者： N. Vydyanathan S. Krishnamoorthy G. Sabin U. Catalyurek T. Kurc P. Sadayappan J. Saltz Department of Computer Science and Engineering Ohio State Uinversity USA Department of Biomedical Informatics Ohio State Uinversity USA

Computationally complex applications can often be viewed as a collection of coarse-grained data-parallel tasks with precedence constraints. Researchers have shown that combining task and data parallelism (mixed parallelism) can be an effective approach for executing these applications, as compared to pure task or data parallelism. In this paper, we present an approach to determine the appropriate mix of task and data parallelism, i.e., the set of tasks that should be run concurrently and the number of processors to be allocated to each task. An iterative algorithm is proposed that couples processor allocation and scheduling of mixed-parallel applications on compute clusters so as to minimize the parallel completion time (makespan). Our algorithm iteratively reduces the makespan by increasing the degree of data parallelism of tasks on the critical path that have good scalability and a low degree of potential task parallelism. The approach employs a look-ahead technique to escape local minima and uses priority based backfill scheduling to efficiently schedule the parallel tasks onto processors. Evaluation using benchmark task graphs derived from real applications as well as synthetic graphs shows that our algorithm consistently performs better than CPR and CPA, two previously proposed scheduling schemes, as well as pure task and data parallelism

关键词： Processor scheduling Parallel processing Application software scheduling algorithm Iterative algorithms Computer applications Computer science Biomedical engineering Data engineering Biomedical informatics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 473 474 475 476 477 478 479 480 481 482 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：