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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A Credit Evaluation Model for Computational Grid Nodes

A Credit Evaluation Model for Computational Grid Nodes

引用

IEEE workshop on Future Trends of distributed Computing systems

作者： Tao Wang Xing-she Zhou Yun-lan Wang Jian Hu Centre for High Performance Computing Northwestern Polytechnical University Xi'an Shaanxi China

Computational grid is a cooperative computing environment which collects all kinds of high performance software and hardware computing resources distributed in WAN and provides networked computing services. The computational grid systems that have been the focus of much research activities in the past years for controlled sharing of resources across institutional boundaries. Credit is one major concern in grid resource management that enables remote scheduling and execution. For the sake of improving the self-adaptability of resource management and accelerating the application and development of computational grid, an evaluation model of a computational grid nodepsilas credit is put forward which is based on the execution results of computational grid jobs on the node. Using this model the resource consumers and resource providers should abandon the vicious evaluating voluntarily. Applied in NPU Campus Computational Grid, this model achieves good effect.

关键词： Computational modeling Grid computing Computer networks distributed computing High performance computing resource management Software performance Hardware Wide area networks Control systems

来源：评论

学校读者我要写书评

暂无评论

Well-Balanced Allocation Strategy for Multi-Cluster Computing Environments

Well-Balanced Allocation Strategy for Multi-Cluster Computin...

引用

IEEE workshop on Future Trends of distributed Computing systems

作者： Chao-Tung Yang Hao-Yu Tung Keng-Yi Chou William C. Chu Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

With the rapid proliferation of hardware devices, cluster computing has encountered the problem of heterogeneous resources. We have constructed a multi-cluster system that works with and without storage devices, and evaluated the system performance. We dispatch jobs with the strategy we propose to make the best use of system resources. In this paper we introduce this new scheduling system based on multi-clusters in diskless environments. This work we present is the Well-Balanced Allocation Strategy (WBAS) in which the scheduler dispatches jobs to appropriate resources across multi-clusters. The strategy focuses on dispatching jobs to nodes with similar performance capacities, thus equalizing execution times among all the nodes the jobs require. The WBAS was implemented on a system to evaluate the performance of the scheduling strategy. We use Ganglia to monitor resource statuses, and Condor as the queue system.

关键词： Processor scheduling Dynamic scheduling distributed computing resource management Load management Conferences Chaos Computer science Cities and towns Hardware

来源：评论

学校读者我要写书评

暂无评论

Efficient resource management using advance reservations for heterogeneous Grids

Efficient resource management using advance reservations for...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Claris Castillo George N. Rouskas Khaled Harfoush Department of Computer Science North Carolina State University Raleigh NC USA

Support for advance reservations of resources plays a key role in Grid resource management as it enables the system to meet user expectations with respect to time requirements and temporal dependence of applications, increases predictability of the system and enables co- allocation of resources. Despite these attractive features, adoption of advance reservations is limited mainly due to the fact that related algorithms are typically complex and fail to scale to large and loaded systems. In this work we consider two aspects of advance reservations. First, we investigate the impact of heterogeneity on Grid resource management when advance reservations are supported. Second, we employ techniques from computational geometry to develop an efficient heterogeneity-aware scheduling algorithm. Our main finding is that Grids may benefit from high levels of resource heterogeneity, independently of the total system capacity. Our results show that our algorithm performs well across several user and system performance and overcome the lack of scalability and adaptability of existing mechanisms.

关键词： resource management Application software Computer science Computational geometry scheduling algorithm System performance Scalability resource virtualization Computer network management Disaster management

来源：评论

学校读者我要写书评

暂无评论

Advances in the ProGenGrid Workflow management System

Advances in the ProGenGrid Workflow Management System

引用

IEEE international Conference on parallel and distributed Computing, Applications and Technologies (PDCAT)

作者： Maria Mirto Massimo Cafaro Italo Epicoco Giovanni Aloisio NNL of CNR-INFM Lecce Italy University of Salerno Lecce Italy NNL/CNR-INFM University of Salerno Lecce Italy

A large-scale simulation in e-science experiments can be modeled by using a workflow. The ProGenGrid workflow management system is being developed at the University of Salento in Lecce since 2004 and consists of an editor for designing the experiment and an engine for scheduling the jobs in a computational grid. The initial version was based on wrapping the bioinformatics tools as Web services and scheduling job execution on the grid by using an opportune engine. Then the engine was optimized to support batch, parameter and MPI jobs by using the Globus Toolkit. This component was developed as part of the grid resource broker project. In this paper, we present the latest advances regarding the editorpsilas new features such as on line monitoring, and the enginepsilas support for scheduling jobs on other grid middleware such as gLite and Unicore.

关键词： Workflow management software Engines Processor scheduling Large-scale systems Computational modeling Job design Grid computing Wrapping Bioinformatics Web services

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of tabu search method for job scheduling in distributed environments

Design and evaluation of tabu search method for job scheduli...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Fatos Xhafa Javier Carretero Enrique Alba Bernabe Dorronsoro Department of Languages and Informatics Systems Polytechnic University of Catalonia Spain Department of Languages and Informatics Systems University of Màlaga Spain Faculty of Science Technology and Communication University of Luxembourg Luxembourg

The efficient allocation of jobs to grid resources is indispensable for high performance grid-based applications. The scheduling problem is computationally hard even when there are no dependencies among jobs. Thus, we present in this paper a new tabu search (TS) algorithm for the problem of batch job scheduling on computational grids. We consider the job scheduling as a bi-objective optimization problem consisting of the minimization of the makespan and flowtime. The bi-objectivity is tackled through a hierarchic approach in which makespan is considered a primary objective and flowtime a secondary one. An extensive experimental study has been first conducted in order to fine-tune the parameters of our TS algorithm. Then, our tuned TS is compared versus two well known TS algorithms in the literature (one of them is hybridized with an ant colony optimization algorithm) for the problem. The computational results show that our TS implementation clearly outperforms the compared algorithms. Finally, we evaluated the performance of our TS algorithm on a new set of instances that better fits with the concept of computational grid. These instances are composed of a higher number of -heterogeneous- machines (up to 256) and emulate the dynamic behavior of these systems.

关键词： Job design Search methods Processor scheduling Grid computing resource management distributed computing Large-scale systems scheduling algorithm Optimization methods Informatics

来源：评论

学校读者我要写书评

暂无评论

Experimental Study of Thread scheduling Libraries on Degraded CPU

Experimental Study of Thread Scheduling Libraries on Degrade...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： Christophe Cerin Hazem Fkaier Mohamed Jemni Laboratoire dInformatique de luniversité Paris-Nord UMR CNRS 7030 Institut Galilée Villetaneuse France École Supérieure des Sciences et Techniques de Tunis Unité de recherche en Technologies de I''Infomation et de la Communication Tunisia

In this paper, we compare four libraries for efficiently running threads when the performance of a CPU cores are degraded. First, we are interested by 'brute performance' of the libraries when all the CPU resources are available and second, we would like to measure how the scheduling strategy impacts also the memory management in order to revisit, in the future, scheduling strategies when we artificially degrade the performance in advance. It is well known that work stealing, when done in an anarchic way, may lead to poor cache performance. It is also known that the migration of threads may induce penalties if they are too frequent. We study, at the processor level, the memory management in order to find trade-offs between active thread number that an application should start and the memory hierarchy. Our implementations, coded with the different libraries, were compared against a Pthread one where the threads are scheduled by the Linux kernel and not by a specific tool. Our experimental results indicate that scheduler may perfectly balance loads over cores but execution time is impacted in a negative way. We also put forward a relation between the L1 cache misses, the number of steals and the execution time that will allow to focus on specific points to improve 'work stealing' schedulers in the future.

关键词： Yarn Libraries Degradation Job shop scheduling Processor scheduling Multicore processing Memory management Central Processing Unit parallel processing resource management

来源：评论

学校读者我要写书评

暂无评论

Recent Progress in Miniature Microwave Filters

Recent Progress in Miniature Microwave Filters

引用

IEEE MTT-S international Microwave workshop Series (IMWS)

作者： Jia-Sheng Hong Department of Electrical Electronic and Computer Engineering Heriot-Watt University Edinburgh UK

This paper aims to review some miniature microwave filters developed recently, including dual-mode microstrip open-loop resonator filters, folded waveguide resonator filters, multilayer filters and superconducting fil... 详细信息

关键词： Microwave filters resource management distributed computing Grid computing Bioinformatics Processor scheduling Computer networks Optical computing Supercomputers parallel processing

来源：评论

学校读者我要写书评

暂无评论

An Alternative Model for ERP Maintenance Strategy

An Alternative Model for ERP Maintenance Strategy

引用

ACIS international Conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed Computing (SNPD)

作者： Muhammad Rofi Imtihan Mohd. Salihin Ngadiman Habibollah Haron Research Lab Department of Modelling and Industrial ComputingFaculty Computer Science and Information Technology Universiti Teknologi Malaysia Malaysia Department of Modelling and Industrial Computing Faculty of Computer Science and Information System Universiti Teknologi Malaysia Skudai Johor Malaysia

ISBN: (纸本)9780769532636

For the past few years, it has been possible to buy a business application including transaction processing systems for such tasks as accounting, manufacturing, or human resources as a packaged product. Packages to do this collection of work are generally referred to as enterprise resource planning (ERP) systems. Most ERP systems are huge because of the diversity of tasks they must perform. The ERP systems are providing an integration of several tasks, and the flexibility to perform those tasks at enterprises with vastly varying needs. But, only few of these ERP systems developed have actually considered maintenance strategies. Maintenance is a complex process that is triggered by planned periodic repair (scheduled or planned maintenance), equipment breakdown or deterioration indicated by a monitored parameter (unplanned or emergency maintenance). This process includes planning, scheduling, monitoring, quality assurance and the development of necessary resources such as workshop, labor, machines, equipment, tools, spare parts and materials.

关键词： Maintenance engineering Planning Load modeling Business Job shop scheduling Materials Materials requirements planning

来源：评论

学校读者我要写书评

暂无评论

Adaptive B-Greedy (ABG): A simple yet efficient scheduling algorithm

Adaptive B-Greedy (ABG): A simple yet efficient scheduling a...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Hongyang Sun Wen-Jing Hsu School of Computer Engineering Nanyang Technological University Singapore

In order to improve processor utilizations on parallel systems, adaptive scheduling with parallelism feedback was recently proposed. A-Greedy, an existing adaptive scheduler, offers provably-good job execution time and processor utilization. Unfortunately, it suffers from unstable feedback and hence unnecessary processor reallocations even when the job has constant parallelism. This problem may cause difficulties in the management of system resources. We propose a new adaptive scheduler called ABG (for Adaptive B-Greedy), which ensures both performance and stability. In a direct comparison with A-Greedy using simulated data- parallel jobs, ABG shows an average 50% reduction in wasted processor cycles and an average 20% improvement in running time. For a set of jobs, ABG also outperforms A-Greedy by 10% to 15% on average in terms of both makespan and mean response time, provided the system is not heavily loaded. Our detailed analysis shows that ABG indeed offers improved transient and steady-state behaviors in terms of control-theoretic metrics. Using trim analysis, we show that ABG provides nearly linear speedup for individual jobs and good processor utilizations. Using competitive analysis, we also show that ABG offers good makespan and mean response time bounds.

关键词： scheduling algorithm Processor scheduling Adaptive scheduling parallel processing Feedback Delay Transient analysis resource management Steady-state Sun

来源：评论

学校读者我要写书评

暂无评论

Large-scale experiment of co-allocation strategies for Peer-to-Peer supercomputing in P2P-MPI

Large-scale experiment of co-allocation strategies for Peer-...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Stephane Genaud Choopan Rattanapoka Algorille/LORIA Vandoeuvre-les-Nancy France LSIIT-ICPS UMR 7005 CNRS-ULP France

High Performance computing generally involves some parallel applications to be deployed on the multiples resources used for the computation. The problem of scheduling the application across distributed resources is termed as co-allocation. In a grid context, co-allocation is difficult since the grid middleware must face a dynamic environment. Middleware architecture on a peer-to-peer (P2P) basis have been proposed to tackle most limitations of centralized systems. Some of the issues addressed by P2P systems are fault tolerance, ease of maintenance, and scalability in resource discovery. However, the lack of global knowledge makes scheduling difficult in P2P systems. In this paper, we present the new developments concerning locality awareness as well as co-allocation strategies available in the latest release of P2P-MPI. i) The spread strategy tries to map processes on hosts so as to maximize the total amount of available memory while maintaining locality of processes as a secondary objective, ii) The concentrate strategy tries to maximize locality between processes by using as many cores as hosts offer. The co-allocation scheme has been devised to be simple for the user and meets the main high performance computing requirement which is locality. Extensive experiments have been conducted on Grid5000 with up to 600 processes on 6 sites throughout France. Results show that we achieved the targeted goals in these real conditions.

关键词： Large-scale systems Peer to peer computing Processor scheduling Middleware resource management Computer architecture Floods High performance computing Grid computing Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共95页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：