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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A Fast and Intelligent resource Allocation Service for Service-Oriented Grid

A Fast and Intelligent Resource Allocation Service for Servi...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： Guopeng Zhao Zhiqi Shen Chunyan Miao Nanyang Technol. Univ. Singapore Singapore

Grid has evolved dramatically into the era of service-oriented grid, which facilitates building of large-scale systems in standard fashions, reusability of essential functions, and interoperability among components. However, grid resource allocation is still a challenging problem for which a grid scheduler has to be operating in a dynamic and uncertain environment. Conventional scheduling algorithms will fail due to the static rules used and much user intervention required. We suggest that learning with neural networks is promising to solve this problem. In this paper we propose a fast and intelligent resource selection algorithm based on neural networks. Extreme Learning Machine (ELM) is exploited as the learning paradigm due to its fast learning speed and satisfactory performance. Moreover, we present an architecture, which defines components of a proposed resource allocation service and also specifies interactions to the other service-oriented grid components. Experiments show that the proposed scheduling algorithm outperforms the conventional algorithm in terms of computing power utilization.

关键词： resource management Neural networks Machine learning Grid computing scheduling algorithm Dynamic scheduling Computer architecture Intelligent structures Large-scale systems Intelligent networks

来源：评论

学校读者我要写书评

暂无评论

A global scheduling framework for virtualization environments

A global scheduling framework for virtualization environment...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Yoav Etsion Tal Ben-Nun Dror G. Feitelson School of Computer Science and Engineering Hebrew University of Jerusalem Jerusalem Israel Barcelona Supercomputing Center Barcelona Spain

A premier goal of resource allocators in virtualization environments is to control the relative resource consumption of the different virtual machines, and moreover, to be able to change the relative allocations at will. However, it is not clear what it means to provide a certain fraction of the machine when multiple resources are involved. We suggest that a promising interpretation is to identify the system bottleneck at each instant, and to enforce the desired allocation on that device. This in turn induces an efficient allocation of the other devices.

关键词： Virtual machining Operating systems Virtual machine monitors resource virtualization resource management Hardware Processor scheduling Computer science Delay Upper bound

来源：评论

学校读者我要写书评

暂无评论

Predictive scheduling in Rate-Adaptive Multi-user Relay Channels with Reconfiguration Delays

Predictive Scheduling in Rate-Adaptive Multi-user Relay Chan...

引用

international Conference on distributed Computing systems workshop

作者： Gokhan Sahin Department of Electrical and Computer Engineering Miami University USA

Opportunistic scheduling and rate-adaptation mechanisms exploit the variations in the channel states experienced by different users through the allocation of resources to users with better channel quality. Opportunistic scheduling has been considered in various contexts, typically with the assumption that rate adaptation and channel reassignment can be implemented with no delay, based on the instantaneous channel state information. This paper considers opportunistic predictive resource allocation in a multi-user rate-adaptive relay system with reconfiguration delays. Specifically, we consider a deterministic predictive scheduling problem in which any change in the channel rate or assignment induces an arbitrary reconfiguration penalty, Delta. We show that the off-line version of this problem is NP-hard, and then present an off-line approximation algorithm, which is shown to be Delta-competitive. We then provide a polynomial-complexity optimal solution for throughput maximization for the offline single-user rate adaptation problem. Finally, we present a family of online algorithms to solve the online version of the multi-user problem. These algorithms, which are amenable to distributed implementation, involve solving a set of small mixed-integer linear programs (MILPs) in parallel. We also discuss the impact of the reconfiguration penalty Delta and the look-ahead on the performance, where look-ahead is defined as the time horizon over which the channel state estimates are available.

关键词： Relays Delay Processor scheduling Throughput resource management State estimation Channel state information Approximation algorithms Polynomials Power system relaying

来源：评论

学校读者我要写书评

暂无评论

resource-aware allocation strategies for divisible loads on large-scale systems

Resource-aware allocation strategies for divisible loads on ...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Anne Benoit Loris Marchal Jean-Francois Pineau Yves Robert Frederic Vivien Université de Lyon France LIP laboratory UMR 5668 ENS Lyon-CNRS-INRIA-UCBL Lyon France CNRS France LIRMM laboratory UMR 5506 CNRS Université Montpelher II France INRIA France

In this paper, we deal with the large-scale divisible load problem studied in. We show how to reduce this problem to a classical preemptive scheduling problem on a single machine, thereby establishing new complexity results, and providing new approximation algorithms and heuristics that subsume those presented in. We also give some hints on how to extend the results to a more realistic framework where communication costs are taken into account.

关键词： resource management Large-scale systems Costs Laboratories Approximation algorithms Heuristic algorithms Single machine scheduling scheduling algorithm Grid computing Context

来源：评论

学校读者我要写书评

暂无评论

resource-efficient Acceleration of 2-Dimensional Fast Fourier Transform Computations on FPGAs

Resource-efficient Acceleration of 2-Dimensional Fast Fourie...

引用

3rd ACM/IEEE international Conference on distributed Smart Cameras

作者： Kee, Hojin Bhattacharyya, Shuvra S. Petersen, Newton Kornerup, Jacob Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA Natl Instruments Corp Austin TX 78759 USA

ISBN: (纸本)9781424446193

The 2-dimensional (2D) Fast Fourier Transform (FFT) is a fundamental, computationally intensive function that is of broad relevance to distributed smart camera systems. In this paper, we develop a systematic method for improving the throughput of 2D-FFT implementations on field-programmable gate arrays (FPGAs). Our method is based on a novel loop unrolling technique for FFT implementation, which is extended from our recent work on FPGA architectures for 1D-FFT implementation [1]. This unrolling technique deploys multiple processing units within a single 1D-FFT core to achieve efficient configurations of data parallelism while minimizing memory space requirements, and FPGA slice consumption. Furthermore, using our techniques for parallel processing within individual 1D-FFT cores, the number of input/output (I/O) ports within a given 1D-FFT core is limited to one input port and one output port. In contrast, previous 2D-FFT design approaches require multiple I/O pairs with multiple FFT cores. This streamlining of 1D-FFT interfaces makes it possible to avoid complex interconnection networks and associated scheduling logic for connecting multiple I/O ports from 1D-FFT cores to the I/O channel of external memory devices. Hence, our proposed unrolling technique maximizes the ratio of the achieved throughput to the consumed FPGA resources under pre-defined constraints on I/O channel bandwidth. To provide generality, our framework for 2D-FFT implementation can be efficiently parameterized in terms of key design parameters such as the transform size and I/O data word length.

关键词： 2-D Fast Fourier Transform Memory management High-level synthesis FPGA-based system design

来源：评论

学校读者我要写书评

暂无评论

MGST: A framework for performance evaluation of Desktop Grids

MGST: A framework for performance evaluation of Desktop Grid...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Majd Kokaly Issam Al-Azzoni Douglas G. Down Department of Computing and Software McMaster University Hamilton ONT Canada

Desktop Grids are rapidly gaining popularity as a cost-effective computing platform for the execution of applications with extensive computing needs. As opposed to grids and clusters, these systems are characterized by having a non-dedicated infrastructure. These unique characteristics need to be considered in developing resource management strategies for Desktop Grids. Several frameworks for the performance evaluation of resource management strategies have been suggested for grids. However, similar projects for Desktop Grids are still lacking. This paper presents MGST, the first performance testing framework for Desktop Grids. We discuss the design of the tool and show how it can be used to analyze and improve the performance of an existing Desktop Grid scheduling policy.

关键词： Performance analysis Automatic testing Grid computing resource management System testing Scalability scheduling Software performance Application software Computer applications

来源：评论

学校读者我要写书评

暂无评论

Broker Selection Strategies in Interoperable Grid systems

Broker Selection Strategies in Interoperable Grid Systems

引用

international Conference on parallel Processing (ICPP)

作者： Ivan Rodero Francesc Guim Julita Corbalan Liana Fong S. Masoud Sadjadi Computer Architecture Department Technical University of Catalonia (UPC) Spain Barcelona Supercomputing Center (BSC-CNS) Spain IBM T.J. Watson Research Center Hawthorne New York USA School of Computing and Information Sciences Florida International University (FIU) Miami Florida USA

The increasing demand for resources of the high performance computing systems has led to new forms of collaboration of distributed systems such as interoperable grid systems that contain and manage their own resources. While with a single grid domain one of the most important tasks is the selection of the most appropriate set of resources to dispatch a job, in an interoperable grid environment this problem shifts to selecting the most appropriate domain containing the requiring resources for the job. In this paper, we present and evaluate broker selection strategies for interoperable grid systems. They use aggregated resource information as well as dynamic performance information of the underlying scheduling layers. From our evaluations performed with simulation tools, we conclude that aggregation techniques do not penalize performance significantly, and that delegating part of the scheduling responsibilities to the underlying scheduling layers is a good way to balance the load among the different grid systems.

关键词： High performance computing Processor scheduling resource management Performance evaluation parallel processing Computer architecture distributed computing Grid computing international collaboration Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Double-layer scheduling Strategy of Load Balancing in Scientific Workflow

Double-layer Scheduling Strategy of Load Balancing in Scient...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： Yan Ma Bin Gong School of Computer Science and Technology Shandong University Jinan Shandong China

Complicated method and technology have been introduced into business workflow to solve their cooperation and load balancing. However, as combination of data management and flow management, scientific workflow's load balancing is less researched. So the phenomena of conflicting scheduling and load unbalance often occur. In this paper, we analyze functional framework and load consumption of scientific workflow engine in detail, and then introduce the load models of workflow application, workflow runtime engine and grid node. More importantly, utility function quantifying various loads and performance is introduced to lay foundation for engine selection and task scheduling. The collection and evaluation of real-time status are implemented by monitor and high-layer planner. Considering load balancing of both scientific workflow engine and grid node, we propose a double-layer scheduling algorithm based on performance model. Results from experiments demonstrate that our proposed models and double-layer scheduling algorithm can well avoid load unbalancing and conflicting scheduling in engine and grid node. Moreover, completion time of scientific workflow application can reduce greatly owning to full and even utilization of engine and grid node.

关键词： Load management Engines scheduling algorithm Workflow management software resource management Processor scheduling Load modeling Application software Collaborative work Costs

来源：评论

学校读者我要写书评

暂无评论

A Runtime Reputation Based Grid resource Selection Algorithm on the Open Science Grid

A Runtime Reputation Based Grid Resource Selection Algorithm...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： Zhengxiong Hou Xingshe Zhou Mike Wilde Jianhua Gu Mihael Hategan Center of High Performance Computing Northwestern Polytechnical University Xi'an China Computation Institute University of Chicago Chicago IL USA

The scheduling and execution for grid application is an important problem in the grid environment. To get the high reliability and efficiency, we propose a runtime reputation based grid resource selection algorithm. According to the accumulated raw score, the runtime reputation degree for a grid resource is quantified as an evaluating score in the runtime of an application. Instead of being dependent on the historical experiences, it is dynamically adaptive to the runtime availability, load, and performance of the grid resources. The execution framework on the grid is based on Globus Toolkit and Swift system. In a real production grid, Open Science Grid (OSG), a typical grid application with large scale independent jobs was experimented, which was based on BLAST application. The experimental results for the performance of different policies are presented, with a benchmarking workload size of 10,000 jobs. The runtime reputation and behavior statistics for the grid resources are also presented.

关键词： Processor scheduling Availability Large-scale systems Grid computing resource management Application software Job listing service Runtime environment scheduling algorithm High performance computing

来源：评论

学校读者我要写书评

暂无评论

A Forwarding-Based Task scheduling Algorithm for distributed Web Crawling over DHTs

A Forwarding-Based Task Scheduling Algorithm for Distributed...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： Xiao Xu Wei-Zhe Zhang Hong-Li Zhang Bin-Xing Fang Xin-Ran Liu School of Computer Science and Technology Harbin Institute of Technology Harbin China Technical TeamCoordination Center National Computer Network Emergency Response Beijing China

distributed Web crawling (DWC) over DHTs is proposed to solve the bottlenecks in the traditional Web crawling. The core of this kind of system is its fully distributed task scheduling mechanism in which the crawlers are treated as peers and the crawlees are treated as resources maintained by the peers. A system model based on the content addressable network (CAN) can further optimize the scheduling mechanism by exploiting the network proximity of the crawlers and the crawlees. In this paper, we propose a new method for CAN in order to achieve load balancing in the CAN-based DWC system. The method not only keeps the load balancing among peers but also keeps the distance between peers and resources very short in our simulations. The shortened peer-resource distance fulfills the need of shortening crawler-crawlee latencies.

关键词： scheduling algorithm Peer to peer computing Load management Crawlers Delay Scalability Computer science Computer networks Processor scheduling Robustness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共95页 << < 43 44 45 46 47 48 49 50 51 52 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：