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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Preemptive maximum stretch optimization scheduling for wireless on-demand data broadcast

Preemptive maximum stretch optimization scheduling for wirel...

引用

International Symposium on Database Engineering and Applications (IDEAS)

作者： Xiao Wu V.C.S. Lee Department of Computer Science City University of Hong Kong Kowloon Hong Kong China

On-demand broadcast is an attractive data dissemination method for mobile and wireless computing. We need an on-demand broadcast scheduling algorithm which can balance individual and overall performance, at the same time avoid the starvation of data items, and scale in terms of client population, database size, and data size in heterogeneous settings. As stretch is regarded as a fair performance metric for variable-sized data requests, in this paper, we propose a new preemptive, heuristic online scheduling algorithm, called PRS for on-demand broadcast system to optimize the worst case stretch across all criteria. We have done a series of simulation experiments to evaluate the performance of our algorithm as compared with other recently proposed methods under a range of scenarios. The experimental results show that our algorithm can substantially reduce the maximum stretch without jeopardizing the overall system performance.

关键词： Broadcasting scheduling algorithm Processor scheduling Databases Measurement Design optimization Computer science algorithm design and analysis Mobile computing System performance

来源：评论

学校读者我要写书评

暂无评论

Frequency-Time scheduling for streaming services in OFDMA systems

Frequency-Time Scheduling for streaming services in OFDMA sy...

引用

IFIP Wireless Days, WD

作者： Mohamad Assaad Ecole Superieure d''Electricite Gif-sur-Yvette France

This paper proposes a novel Frequency Time scheduler, called Frequency Time Scheduler with Delay Constraints (FTSDC), in order to handle streaming traffic in OFDMA (Orthogonal Frequency Division Multiple Access) system. Streaming technique, widely developed and used in the internet to convey multimedia application (e.g., audio, video clip, etc.), is supposed to occupy a large share of bandwidth in future wireless systems (e.g. WiMAX, LTE ldquoLong Term Evolutionrdquo, etc.). The stringent QoS constraints of these services may be reached at the expense of the system capacity and therefore a trade off between Fairness and capacity should be achieved. The novel opportunistic scheduler proposed in this paper balances this trade off and allows thus OFDMA systems to handle streaming services without losing much cell capacity. Results afforded by this scheduler are promising and show that it outperforms the existing scheduling algorithms.

关键词： Frequency conversion Resource management Delay Streaming media OFDM Bandwidth WiMAX Long Term Evolution scheduling algorithm Downlink

来源：评论

学校读者我要写书评

暂无评论

QoS-based adaptive scheduling for a mixed service in HDR system

QoS-based adaptive scheduling for a mixed service in HDR sys...

引用

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

作者： Kapseok Chang Youngnam Han Information and Communications University Daejeon South Korea

ISBN: (纸本)0780375890

We propose an efficient methodology to support the maximum possible throughput of NRT (non-real time) users while satisfying the QoS (quality of service) requirements of all ART (almost real time) for a mixed service in HDR (high data rate). Moreover, we present the modified exponential rule that can improve the total throughput and individual average throughput while guaranteeing the minimum throughput and delay requirement for ART service alone. A token-based mechanism to guarantee each minimum throughput of all users is employed. Simulation results are shown in terms of both average packet delay and throughput according to the choice of total or individual user. Our main conclusion is that adaptive scheduling algorithm in conjunction with both the token bucket and the adaptive rule provides an effective foundation for supporting a mixed service in the system.

关键词： Adaptive scheduling Throughput Optimal scheduling scheduling algorithm Subspace constraints Analytical models algorithm design and analysis Streaming media Delay effects Quality of service

来源：评论

学校读者我要写书评

暂无评论

Adaptive multi-user fair packet scheduling in HSDPA network

Adaptive multi-user fair packet scheduling in HSDPA network

引用

International Conference on Innovations in Information Technology

作者： Rola Naja Jean-Pierre Claude Samir Tohme PRiSM-CNRS UMR 8114 University of Versailles Versailles France Faculty of Science Lebanese University Lebanon

Next generation mobile networks are expected to provide seamless personal mobile communications and quality of service (QoS) guaranteed services. In this paper, the focus is on the packet scheduling of data generated by exhaustive applications. The performance of a new packet scheduling called adaptive proportional fair with user multiplexing (APFUM) is proposed and compared to the proportional fair scheduling. Bandwidth adaptation enables to increase network capacity while keeping a reasonable mean throughput of adapted users. Performance results show that the proposed algorithm is more effective in reducing the access delay and the rejection probability and in enhancing fairness. This benefit is obtained at the expense of introducing an adaptation rate.

关键词： scheduling algorithm Multiaccess communication Throughput Quality of service Feedback Round robin Availability GSM Proposals Dynamic range

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Grid scheduling Using Tabu Search

Fuzzy Grid Scheduling Using Tabu Search

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： Carole Fayad Jonathan M. Garibaldi Djamila Ouelhadj School of Computer Science and IT University of Nottingham Nottingham UK

This paper considers the problem of grid scheduling in which different jobs are assigned to different processors, and a scheduling algorithm is devised, using tabu search, to find optimal solutions in order to maximize the number of scheduled jobs. However, inherent in the nature of the application, the processing times of jobs are not precise but are estimates that vary between minimal values, in case of premature failure of jobs, to maximal values as specified 'a priori' by well-experienced users. Fuzzy methodology becomes instrumental in this application as it allows the use of fuzzy sets to represent the processing times of jobs, modelling their uncertainty. This work presents the implementation of a tabu search algorithm to create good schedules and explores the robustness of the schedule when processing times do vary by assessing its performance in both fuzzy and crisp modes. Finally, the impact of changing the shapes of fuzzy completion times and the average job length on the schedule performance is discussed.

关键词： Processor scheduling Fuzzy sets Grid computing Genetic algorithms scheduling algorithm Uncertainty Simulated annealing Instruments Robustness Shape

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling of real-time aperiodic tasks on multiprocessor architectures

Dynamic scheduling of real-time aperiodic tasks on multiproc...

引用

Annual Hawaii International Conference on System Sciences (HICSS)

作者： B. Hamidzadeh Y. Atif Department of Computer Science Hong Kong University of Science and Technology Kowloon Hong Kong China

The application of static optimization techniques such as branch-and-bound to real-time task scheduling has been investigated. Few pieces of work, however, have been reported which propose and investigate online optimization techniques for dynamic scheduling of real-time tasks. In such task domains, the difficulty of scheduling is exacerbated by the fact that the cost of scheduling itself contributes directly to the performance of the algorithms and that it cannot be ignored. The paper proposes a class of algorithms that employ novel, on-line optimization techniques to dynamically schedule a set of sporadic real-time tasks. These algorithms explicitly account for the scheduling cost and its effect on the ability to meet deadlines. The paper addresses issues related to real-time task scheduling in the context of a general graph-theoretic framework. Issues related to where and when the task of scheduling is performed are also addressed. We compare two online scheduling strategies, namely an inter-leaving strategy and an overlapping strategy. In the former strategy, scheduling and execution are inter-leaving in time. Each scheduling phase performed by one processor of the system is followed by an execution phase. In the latter strategy, scheduling and execution are overlapping in time. A specified processor, in this strategy, is dedicated to perform scheduling. Results of experiments show that the proposed algorithms perform better than existing approaches, in terms of meeting deadlines and total execution costs, over a large range of workloads.

关键词： Dynamic scheduling Processor scheduling scheduling algorithm Computer architecture Costs Resource management Delay Real time systems Time factors Computer science

来源：评论

学校读者我要写书评

暂无评论

Broadcast transaction scheduling in mobile computing environments

引用

International Conference on Mobile Data Management

作者： S. Wu V.C.S. Lee Kwok-wa Lam Department of Computer Science City University of Hong Kong Hong Kong China

ISBN: (纸本)0769515002

Most of the recent studies on broadcast based data dissemination approach have an implicit assumption that the server is able to broadcast consistent data to the mobile clients. However, this assumption may not be valid unless there is a special algorithm to handle broadcasting data in a consistent and timely manner. In this work, we address a number of issues related to this problem. An efficient algorithm called the read-write set test is adopted to read the entire database, which causes little interference with the update transactions at the server. For broadcast transaction scheduling, an algorithm based on a mixed strategy is proposed to handle the case of flat broadcast disks. Using these two algorithms together with some fine tuning, the objectives of reading entire database consistently with minimum impact to the system, broadcasting fresh data, and meeting the periodicity requirement can be met.

关键词： Broadcasting Processor scheduling Mobile computing Transaction databases scheduling algorithm Image databases Interference Concurrency control System testing Computer science

来源：评论

学校读者我要写书评

暂无评论

The scheduling Model for Disabilitise Transfer in Airports

The Scheduling Model for Disabilitise Transfer in Airports

引用

International Workshop on Computer Science and Engineering (WCSE)

作者： Xuejun Wu College of Science Zhejiang University of Technology Hangzhou Zhejiang China

The difficulties of accessibility still exist in air travel, although it has been available to most people today. This paper is aiming to construct an economical scheduling algorithm of the movement of wheelchairs and escorts throughout a day, and find the minimum budget of costs. After describing the general situation in Epsilon Company, this paper divided the costs into five parts. For each part, we established a cost model to estimate minimum cost. This paper determined the optimal position of pilling up wheel chairs via geometrical analysis. And we carried out real-time simulation the process of scheduling wheel chairs to find minimum number of wheel chairs and escorts.

关键词： Airports Costs Wheelchairs scheduling algorithm Economic forecasting Computer science Processor scheduling Educational institutions Ethics Total quality management

来源：评论

学校读者我要写书评

暂无评论

Packet scheduling and resource allocation for downlink multicarrier systems with quality-of-service constraints

Packet scheduling and resource allocation for downlink multi...

引用

International Workshop on Cross Layer Design, IWCLD

作者： Qing Bai Yao Hao Josef A. Nossek Institute for Circuit Theory and Signal Processing Technische Universität München Munich Germany

We consider the scheduling and resource allocation problem in the downlink of multicarrier systems where data is processed and transmitted in unit of packets. This involves the allocation of transmit power as well as time and frequency slots to packets generated by different service flows, which consequently have various lengths and allows for various latency time in delivery. An optimization to maximize system throughput under frequency division multiple access (FDMA) and available resources restrictions is formulated, and an interactive scheduling and resource allocation approach is proposed to solve this combinatorial-natured problem. The paper especially focuses on the design of packet scheduling algorithms and introduces the concept of virtual packet size and anxious scheduler, which allows for simple implementation and high flexibility. Simulation results show the efficient collaboration of the proposed scheduling algorithm with the resource allocation scheme, and the effectiveness of the system as a whole which favorably exhibits low complexity.

关键词： Resource management scheduling algorithm scheduling Throughput Minimization Quality of service algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Job scheduling for grid computing on metacomputers

Job scheduling for grid computing on metacomputers

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： K. Li Department of Computer Science State University of New York New Paltz NY USA

ISBN: (纸本)0769523129

scheduling is a fundamental issue in achieving high performance on metacomputers and computational grids. For the first time, the job scheduling problem for grid computing on metacomputers is studied as a combinatorial optimization problem. It is proven that the list scheduling algorithm can achieve reasonable worst-case performance bound in grid environments supporting distributed super computing with large applications. It is also observed that communication heterogeneity does have significant impact on schedule lengths.

关键词： Processor scheduling Grid computing scheduling algorithm High performance computing Application software Computer networks Distributed computing Concurrent computing Costs Bandwidth

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 458 459 460 461 462 463 464 465 466 467 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：