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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

883 篇 会议
46 篇 期刊文献
12 册 图书
3 篇 学位论文

馆藏范围

944 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

413 篇 工学
- 396 篇 计算机科学与技术...
- 164 篇 软件工程
- 59 篇 电气工程
- 40 篇 信息与通信工程
- 29 篇 控制科学与工程
- 11 篇 动力工程及工程热...
- 9 篇 电子科学与技术（可...
- 9 篇 建筑学
- 9 篇 环境科学与工程（可...
- 8 篇 机械工程
- 4 篇 土木工程
- 3 篇 航空宇航科学与技...
- 3 篇 生物工程
- 2 篇 仪器科学与技术
- 2 篇 网络空间安全
151 篇 管理学
- 145 篇 管理科学与工程(可...
- 107 篇 工商管理
- 15 篇 图书情报与档案管...
58 篇 理学
- 40 篇 数学
- 10 篇 系统科学
- 7 篇 物理学
- 4 篇 生物学
- 4 篇 统计学（可授理学、...
12 篇 经济学
- 11 篇 应用经济学
- 1 篇 理论经济学
4 篇 法学
- 3 篇 社会学
- 1 篇 法学
2 篇 艺术学
- 2 篇 设计学（可授艺术学...
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学

主题

428 篇 resource managem...
229 篇 processor schedu...
111 篇 grid computing
107 篇 scheduling
95 篇 dynamic scheduli...
93 篇 distributed comp...
66 篇 computational mo...
65 篇 scheduling algor...
62 篇 computer science
55 篇 parallel process...
54 篇 computer archite...
53 篇 quality of servi...
49 篇 concurrent compu...
49 篇 large-scale syst...
48 篇 application soft...
44 篇 operating system...
44 篇 real time system...
43 篇 load management
40 篇 runtime
38 篇 cloud computing

机构

5 篇 inria
5 篇 department of co...
5 篇 colorado state u...
4 篇 school of comput...
4 篇 university of ch...
4 篇 tadaam team inri...
3 篇 college of compu...
3 篇 lawrence livermo...
3 篇 colorado state u...
3 篇 univ chicago dep...
3 篇 lawrence livermo...
3 篇 grid computing a...
3 篇 high performance...
3 篇 computer enginee...
3 篇 tech univ munich...
3 篇 university of cr...
3 篇 national laborat...
3 篇 institute of com...
3 篇 aristotle univ t...
2 篇 sun microsystems...

作者

6 篇 rajkumar buyya
6 篇 siegel howard ja...
5 篇 h.j. siegel
5 篇 maciejewski anth...
5 篇 buyya rajkumar
5 篇 t. kidd
5 篇 albert y. zomaya
4 篇 d.p. spooner
4 篇 s.a. jarvis
4 篇 carmen carrión
4 篇 koenig gregory a...
4 篇 g.r. nudd
4 篇 blanca caminero
4 篇 r. buyya
4 篇 nudd gr
4 篇 wentong cai
4 篇 trystram denis
4 篇 chen yong
4 篇 elmroth erik
4 篇 g. manimaran

语言

939 篇 英文
5 篇 其他

检索条件"任意字段=International Workshop on Scheduling and Resource Management for Parallel and Distributed Systems"

共 944 条记录，以下是601-610 订阅

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

详细简洁

排序：

Efficient compile-time task scheduling for heterogeneous distributed computing systems

Efficient compile-time task scheduling for heterogeneous dis...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： M.I. Daoud N. Kharma Department of Electrical and Computer Engineering Concordia University Montreal QUE Canada

Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling algorithms have been proposed in the literature, which are mainly for homogeneous processors. Few scheduling algorithms are developed for HeDCSs. In this paper, we present a novel task scheduling algorithm, called the longest dynamic critical path (LDCP) algorithm, for HeDCSs. The LDCP algorithm is a list-based scheduling algorithm that uses a new attribute to effectively compute the priorities of tasks in HeDCSs. At each scheduling step, the LDCP algorithm selects the task with the highest priority and assigns the selected task to the processor that minimizes its finish execution time using an insertion-based scheduling policy. The LDCP algorithm successfully generates task schedules that outperform, to the best of our knowledge, two of the best scheduling algorithms for HeDCSs

关键词： Processor scheduling distributed computing scheduling algorithm Dynamic scheduling Costs High performance computing High-speed networks Computer networks Concurrent computing resource management

来源：评论

学校读者我要写书评

暂无评论

Interceptor: middleware-level application segregation and scheduling for P2P systems 06

Interceptor: middleware-level application segregation and sc...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： C. Anglano Dipartimento di Informatica Università del Piemonte Orientale Alessandria Italy

ISBN: (纸本)9781424400546

Very large size peer-to-peer systems are often required to implement efficient and scalable services, but usually they can be built only by assembling resources contributed by many independent users. Among the guarantees that must be provided to convince these users to join the P2P system, particularly important is the ability of ensuring that P2P applications and services run on their nodes will not unacceptably degrade the performance of their own applications because of an excessive resource consumption. In this paper we present Interceptor, a middleware-level application segregation and scheduling system that is able to strictly enforce quantitative limitations on node resource usage and, at same time, to make P2P applications achieve satisfactory performance even in face of these limitations.

关键词： Peer to peer computing Operating systems Application software resource management scheduling Degradation Streaming media Availability Assembly systems Organizing

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource allocation of computer clusters with probabilistic workloads 06

Dynamic resource allocation of computer clusters with probab...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： M. Sleiman L. Lipsky R. Sheahan Department of Computer Science and Engineering University of Connecticut Storrs CT USA

ISBN: (纸本)9781424400546

Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-time systems, it is desirable and more efficient for jobs to finish as close to a target time as possible. This work models the execution time for such a stochastic environment and proposes a dynamic algorithm for optimizing the job completion times by dynamically allocating resources to jobs that are behind schedule and taking resources from jobs that are ahead of schedule. We validate our analytical model with simulations that represent the real computing environment. The results of our simulations show that our alternative is the best estimate to predict the time remaining by using earlier data. Emphasis is placed on where variance enters the system and how well it can be controlled. Also our dynamic algorithm involves modifying the architecture to help reduce the peak number of servers used to execute a job and thus optimize the computation cost.

关键词： resource management Processor scheduling Heuristic algorithms Dynamic scheduling Analytical models Computational modeling parallel processing Real time systems Stochastic processes Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A new distributed deadlock avoidance strategy for flexible manufacturing systems using digraph models

A new distributed deadlock avoidance strategy for flexible m...

引用

international workshop on Discrete Event systems, WODES

作者： Zhonghua Huang Zhiming Wu Department of Automation Shanghai Jiaotong University China

ISBN: (纸本)1424400538

This paper proposes a distributed deadlock avoidance policy for flexible manufacturing systems. The whole digraph model is decomposed into subsystems, which could be controlled locally and independently by a suitable deadlock avoidance policy. The flexibility of the deadlock avoidance policy is demonstrated and the complexity analysis is given

关键词： System recovery Flexible manufacturing systems resource management Control systems Manufacturing systems Automation Job shop scheduling Productivity Real time systems Control system synthesis

来源：评论

学校读者我要写书评

暂无评论

Ensuring fairness among participating clusters during multi-site parallel job scheduling

Ensuring fairness among participating clusters during multi-...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： W.M. Jones W.B. Ligon Electrical and Computer Engineering Department Clemson University Clemson SC USA National Science Foundation USA

Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully mapping job's across potentially many clusters, jobs that would otherwise wait in the queue for local cluster resources can begin execution much earlier; thereby improving system utilization and reducing average queue waiting time. In this paper, we demonstrate that these multi-site scheduling techniques can be successfully integrated with fairness policies to ensure that participation in the multi-cluster is beneficial under extremely disparate workload intensities. Furthermore, we demonstrate that the trade-off between fairness and performance is relatively small

关键词： Job shop scheduling Processor scheduling Switches Concurrent computing Computer networks Bandwidth Internet resource management Grid computing Computer industry

来源：评论

学校读者我要写书评

暂无评论

On-line evolutionary resource matching for job scheduling in heterogeneous grid environments

On-line evolutionary resource matching for job scheduling in...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： V.K. Naik P. Garbacki K. Kummamuru Yong Zhao IBM Thomas J. Watson Research Center Yorktown Heights NY USA Delft University of Technology Delft Netherlands IBM India Research Lab EGL Business Park Bangalore India Computer Science Dept University of Chicago Chicago IL USA

In this paper, we describe a resource matcher (RM) developed for the on-line resource matching in heterogeneous grid environments. RM is based on the principles of evolutionary algorithms (EA) and supports dynamic resource sharing, job priorities and preferences, job dependencies on multiple resource types, and resource specific and site-wide policies. We describe the evolutionary algorithm and the models used for representing the resource requirements, preferences, and policies. We evaluate three different methods for bootstrapping RM. We then describe a evolutionary matcher (EM) service $a Web service implementation of RM for on-line resource matching. Preliminary performance results indicate that the EM service is efficient in speed and accuracy and can keep up with high job arrival rates - an important criterion for on-line resource matching systems. The service oriented architecture makes the EM service scalable and extensible and can be integrated with already existing grid services in a straightforward manner

关键词： Evolutionary computation resource management Web services Service oriented architecture Computer science Environmental management Load management Throughput Prototypes Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

A Multi-agent Framework for resource Brokering of Multiple Concurrent Jobs in Grid Environment

A Multi-agent Framework for Resource Brokering of Multiple C...

引用

international Symposium on parallel and distributed Computing

作者： Sarbani Roy Sohini Dasgupta Nandini Mukherjee Department of Computer Science and Engineering Jadavpur University Kolkata India

ISBN: (纸本)9780769526381;0769526381

In this paper we present the design and implementation of a multiagent framework for executing multiple concurrent jobs in a grid environment. resource broker plays an imperative role in our framework. The aim of the resource broker is to find, select, reserve and allocate suitable resources to each job submitted by the client. resource broker always tries to optimize resource utilization and ensure fairness. The multiagent framework assists in executing multiple concurrent jobs in an adaptive execution environment. Services offered by the framework include resource brokering, performance analysis, local tuning and more importantly rescheduling depending on the changing resource requirements. Part of the framework makes use of mobile agents for scheduling and rescheduling purposes. The paper discusses the implementation of the resource brokering and also describes the implementation of a part of the framework which schedules and reschedules the jobs and manages the resources on the basis of some performance monitoring data

关键词： resource management Monitoring distributed computing Grid computing Multiagent systems Job design Performance analysis Environmental management Middleware Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

resource allocation framework for distributed real-time end-to-end tasks

Resource allocation framework for distributed real-time end-...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： Chin-Fu Kuo Chi-Sheng Shih Tei-Wei Kuo Graduate Institute of Networking and Multimedia Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan

Traditional resource allocation algorithms such as Q-RAM (Rajkumar et al., 1997) assume that importance (or weight) or utility values for distributed real-time tasks is a totally ordered set to measure the rewards for completing every task. Hence, resource allocation problem can be viewed as the problem of maximizing total utility values. However, in several real-time applications such as multi-function phased array radar (MFPAR) systems, totally ordered importance are not available. We develop a two-level resource allocation framework. The framework allows the schedulers for subsystems or processors in distributed realtime systems to autonomously schedule local sub-tasks and the system performance is enhanced without heavy global optimization overhead. In addition, the framework can trade the run-time overhead including time and memory space with the optimality of resource allocation. We evaluate our framework by extensive simulations for MFPAR systems. The experimental results show that the developed framework outperforms the traditional priority-based approach

关键词： resource management Radar tracking Target tracking Real time systems Phased arrays Runtime Filtering algorithms Signal processing algorithms Processor scheduling System performance

来源：评论

学校读者我要写书评

暂无评论

Policy-directed data movement in grids

Policy-directed data movement in grids

引用

international Conference on parallel and distributed systems (ICPADS)

作者： Jun Feng Lingling Cui G. Wasson M. Humphrey Computer Science Department University of Virginia Charlottesville VA USA

One of the guiding principles of the grid is local (site) autonomy. resource owners maintain control over their resources even when those resources are part of a larger grid. In other words, resource sharing in grids must be subject to the policies of the (local) resource owners. To date, not enough attention has been paid to describing, manipulating or enforcing explicit resource usage policies. Most existing grid systems have either implicit resource usage policies (with ad-hoc enforcement mechanisms) or support only limited types of policies (e.g., security policies). systems that do provide some support for resource usage policies typically consider only CPU resources, leaving the provisioning of other resources on the grid unconstrained. This paper focuses on policies for grid storage resources. We have identified classes of policies for grid storage resource providers and have implemented an explicit policy-based architecture to manage and enforce them. This architecture consists of two components, MyPolMan, a service to express and manage policies, and .NET GridFTP, an enforcement mechanism for policy-based grid data movement. We show how this system allows grid users to access storage resources through a familiar API while allowing local system administrators to control resource utilization

关键词： resource management Security Grid computing Computer science Control systems Collaborative work Engineering profession scheduling Authentication Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

Price-based user-optimal job allocation scheme for grid systems 06

Price-based user-optimal job allocation scheme for grid syst...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： S. Penmatsa A.T. Chronopoulos Dept. of Computer Science The University of Texas at San Antonio San Antonio Texas USA

ISBN: (纸本)9781424400546

In this paper, we propose a price-based user-optimal job allocation scheme for grid systems whose nodes are connected by a communication network. The job allocation problem is formulated as a noncooperative game among the users who try to minimize the expected cost of their own jobs. We use the concept of Nash equilibrium as the solution of our noncooperative game and derive a distributed algorithm for computing it. The prices that the grid users has to pay for using the computing resources owned by different resource owners are obtained using a pricing model based on a game theory framework. Finally, our scheme is compared with a system-optimal job allocation scheme under simulations with various system loads and configurations and conclusions are drawn

关键词： Grid computing Costs distributed computing Computer networks Processor scheduling Pricing Game theory Communication networks Computational modeling resource management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共95页 << < 57 58 59 60 61 62 63 64 65 66 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：