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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

25 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

13 篇 工学
- 11 篇 计算机科学与技术...
- 6 篇 软件工程
- 2 篇 信息与通信工程
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 网络空间安全
6 篇 理学
- 4 篇 数学
- 2 篇 系统科学
- 1 篇 统计学（可授理学、...
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 图书情报与档案管...

主题

8 篇 parallel process...
7 篇 grid computing
6 篇 quality of servi...
5 篇 resource managem...
3 篇 runtime
3 篇 computer archite...
3 篇 middleware
2 篇 application soft...
2 篇 metacomputing
2 篇 redundancy
2 篇 bandwidth
2 篇 energy consumpti...
2 篇 processor schedu...
2 篇 computational mo...
2 篇 context-aware se...
2 篇 distributed comp...
2 篇 virtual machinin...
2 篇 delay
1 篇 computer science
1 篇 probability dens...

机构

3 篇 paderborn center...
2 篇 heinz nixdorf in...
2 篇 paderborn center...
2 篇 paderborn center...
2 篇 faculty of compu...
2 篇 paderborn center...
1 篇 pc2-paderborn ce...
1 篇 paderborn center...
1 篇 paderborn center...
1 篇 department of co...
1 篇 sni - siemens ni...
1 篇 paderborn center...
1 篇 technische unive...
1 篇 paderborn center...
1 篇 pc2 - paderborn ...
1 篇 paderborn center...
1 篇 cnuce institute ...
1 篇 computer enginee...
1 篇 paderborn center...
1 篇 paderborn center...

作者

3 篇 o. kao
3 篇 wierum jens-mich...
3 篇 andre brinkmann
3 篇 simon jens
3 篇 m. hovestadt
2 篇 georg birkenheue...
2 篇 matthias grawink...
2 篇 brinkmann andré
2 篇 streit achim
2 篇 b. linnert
2 篇 l.-o. burchard
2 篇 a. streit
2 篇 a. keller
2 篇 odej kao
1 篇 michael sievers
1 篇 matthias bolte
1 篇 axel keller
1 篇 baraglia r.
1 篇 markus pargmann
1 篇 römke thomas

语言

26 篇 英文

检索条件"机构=Paderborn Center for Parallel Computing PC2"

共 26 条记录，以下是1-10 订阅

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

详细简洁

排序：

Hierarchical video-on-demand servers for TV-anytime services 8

Hierarchical video-on-demand servers for TV-anytime services

引用

8th International Conference on Computer Communications and Networks, ICCCN 1999

作者： Lüling, Reinhard Paderborn Center for Parallel Computing - PC2 University of Paderborn Germany

ISBN: (纸本)0780357949

This paper presents algorithms and principles for the implementation of a novel broadband multimedia service called "TV-anytime". The basic idea of this service is to store broadcast media assets on media server systems and allow people to access this information at any time. Using a given user profile the recording of media assets can be personalized allowing the implementation of "personal TV" in this way. Within this paper we present the basic mechanisms for the implementation of TV-anytime services on an hierarchical network of media servers. The basic question of how to handle and manage the broadband media assets on such a hierarchical network of media servers is addressed in this paper. We present methods that take up concepts from a graph for the mangement of media assets and verify these methods using sample applications. The results show that the methods provide near to optimal performance in terms of the "quality of service" for the TV-daytime scenario. © 1999 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

On job scheduling for Hpc-clusters and the dynP scheduler 8th

引用

8th International Conference on High Performance computing, Hipc 2001

作者： Streit, Achim PC2- Paderborn Center for Parallel Computing Paderborn33102 Germany

ISBN: (纸本)3540430091

Efficient job-scheduling strategies are important to improve the performance and usability of Hpc-clusters. In this paper we evaluate job-scheduling strategies (FCFS, SJF, and LJF) used in the resource management system CCS (computing center Software). As input for our simulations we use two job sets that are generated from trace files of CCS. Based on the evaluation we introduce the dynP scheduler which combines the three scheduling strategies and dynamically changes between them online. The average estimated runtime of jobs in the waiting queue and two bounds are used as the criterion whether or not dynP switches to a new policy. Obviously the performance of dynP depends on the setting of the two bounds. Diverse parameter pairs were evaluated, and with the proper setting dynP achieves an equal or even better (+9%) performance. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

The self-tuning dynP job-scheduler 16

The self-tuning dynP job-scheduler

引用

16th International parallel and Distributed Processing Symposium, IPDPS 2002

作者： Streit, A. PC2 - Paderborn Center for Parallel Computing Paderborn University Paderborn33102 Germany

ISBN: (纸本)0769515738

In modern resource management systems for supercomputers and Hpc-clusters the job-scheduler plays a major role in improving the performance and usability of the system. The performance of the used scheduling policies (e.g. FCFS, SJF, LJF) depends on the characteristics of the queued jobs. Hence we developed the dynP scheduler family. The basic idea was to change between different scheduling policies during runtime. The basic dynP scheduler uses the average estimated runtime of all queued jobs together with two input parameters to decide when a policy change may be benefical. A disadvantage is that the performance of the basic dynP scheduler strongly depends on the right setting of the two input parameters. Therefore we present the self-tuning dynP scheduler, which is totally independent from any parameter values. The basic concept is that the self-tuning dynP scheduler computes the full (virtual) schedule for each of the three policies in every scheduling step. Each computed schedule is rated by a criterion. Then the scheduler switches to that policy which generated the best schedule for the currently queued jobs. In this paper we are using simulations with trace based job sets to evaluate the performance of the scheduler. The achieved results are reasonably good compared to the parameterized dynP variant and the basic policies FCFS, SJF, and LJF. © 2002 IEEE.

关键词： evaluation Hpc-cluster job-scheduling self-tuning simulation

来源：评论

学校读者我要写书评

暂无评论

MOL project: An open, extensible metacomputer

MOL project: An open, extensible metacomputer

引用

Proceedings of the 1997 6th Heterogeneous computing Workshop, HCW'97

作者： Reinefeld, A. Baraglia, R. Decker, T. Gehring, J. Laforenza, D. Ramme, F. Roemke, T. Simon, J. PC2 - Paderborn Cent for Parallel Computing Germany

Distributed high-performance computing - so-called metacomputing - refers to the coordinated use of a pool of geographically distributed high-performance computers. The user's view of an ideal metacomputer is that of a powerful monolithic virtual machine. The implementor's view, on the other hand, is that of a variety of interacting services implemented in a scalable and extensible manner. In this paper, we present MOL, the Metacomputer Online environment. In contrast to other metacomputing environments, MOL is not based on specific programming models or tools. It has rather been designed as an open, extensible software system comprising a variety of software modules, each of them specialized in serving one specific task such as resource scheduling, job control, task communication, task migration, user interface, and much more. All of these modules exist and are working. The main challenge in the design of MOL lies in the specification of suitable, generic interfaces for the effective interaction between the modules.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Accurate performance prediction for massively parallel systems and its applications 2nd

引用

2nd International Euro-Par Conference on parallel Processing, Euro-Par 1996

作者： Simon, Jens Wierum, Jens-Michael Paderborn Center for Parallel Computing-PC2 Fürstenallee 11 Paderborn33095 Germany

ISBN: (纸本)3540616276

A performance prediction method is presented, which accurately predicts the expected program execution time on massively parallel systems. We consider distributed-memory architectures with SMD nodes and a fast communication network. The method is based on a relaxed task graph model, a queuing model, and a memory hierarchy model. The relaxed task graph is a compact representation of communicating processes of an appfication mapped onto the target machine. Simultaneous accesses to the resources of a multi-processor node are modeled by a queuing network. The execution time of the appfication is computed by an evaluation algorithm. An example application implemented on a massively parallel computer demonstrates the high accuracy of our model. Furthermore, two applications of our accurate prediction method are presented. © 1996, Springer Verlag. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Sequential performance versus scalability: Optimizing parallel LU-decomposition

Sequential performance versus scalability: Optimizing parall...

引用

International Conference and Exhibition on High-Performance computing and Networking, HpcN EUROPE 1996

作者： Simon, Jens Wierum, Jens-Michael Paderborn Center for Parallel Computing - PC2 Fürstenallee 11 Paderborn33095 Germany

ISBN: (纸本)9783540611424

High efficient implementations of parallel algorithms need high efficient sequential kernels. Therefore, libraries like BLAS are successfully used in many numerical applications. In this paper we show the tradeoff between the performance of these kernels and the scalability of parallel applications. It turns out that the fastest routine on a single node does not necessarily lead to the fastest parallel program and that the structure of the kernels have be adapted to the communication parameters of the machine. As an example application we present an optimized parallel LU-decomposition for dense systems on a distributed memory machine. Here, the size of submatrices of the blocked-algorithm determines the performance of the matrix-matrix multiplication and with a contrary effect the scalability behavior. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

On the quality of partitions based on space-filling curves

引用

International Conference on Computational Science, ICCS 2002

作者： Hungershöfer, Jan Wierum, Jens-Michael Paderborn Center for Parallel Computing PC2 Fürstenallee 11 Paderborn33102 Germany

ISBN: (纸本)3540435948

This paper presents bounds on the quality of partitions induced by space-filling curves. We compare the surface that surrounds an arbitrary index range with the optimal partition in the grid, i. e. the square. It is shown that partitions induced by Lebesgue and Hilbert curves behave about 1.85 times worse with respect to the length of the surface. The Lebesgue indexing gives better results than the Hilbert indexing in worst case analysis. Furthermore, the surface of partitions based on the Lebesgue indexing are at most (formula presented) times larger than the optimal in average case. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

Workload analysis of computation intensive tasks: Case study on SPEC CPU95 benchmarks

引用

3rd International Conference on parallel Processing, Euro-Par 1997

作者： Simon, Jens Vieth, Marco Weicker, Reinhold PC2 - Paderborn Center for Parallel Computing Germany SNI - Siemens Nixdorf Informationssysteme AG Germany

ISBN: (纸本)9783540634409

Several performance analysis tools have been developed with the drawback of dedicated hardware solutions or the compute intenseness of simulations. The modern microprocessors, with hardware support for counting of system hardware events, now make possible universal software tools for the performance analysis of complex application programs such as the SPEC benchmarks. In this paper, we present a new method to determine system resource utilization (cache miss ratios, CPI values, branch miss predictions) of arbitrary programs, based on a sampling technique, combined with access to processor-internal event counter registers. We present the sprof tool set that is based on this method and enables also the detailed analysis of individual subroutines of a program, as they are executed over time. The high accuracy and the negligible overhead of the tool set is demonstrated. We used the SPEC95 benchmark suite, consisting of 8 integer and 10 floating-point intensive non-trivial programs that are commonly used to define the performance of workstations and servers. As an example, we present the analysis of a SPEC CPU95 benchmark program on different processor architectures.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Evaluation of applied intra-disk redundancy schemes to improve single disk reliability

Evaluation of applied intra-disk redundancy schemes to impro...

引用

IEEE Annual International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

作者： Grawinkel, Matthias Schäfer, Thorsten Brinkmann, André Hagemeyer, Jens Porrmann, Mario Paderborn Center for Parallel Computing PC2 University of Paderborn Germany Heinz Nixdorf Institute System and Circuit Technology University of Paderborn Germany

ISBN: (纸本)9780769544304

Exponentially growing capacities of disk drives have increased the problem that not only a complete disk can fail, but also individual, small groups of sectors can be erroneous. These sector errors are especially critical during RAID rebuilds because they can only be detected when the corresponding sectors are read. Mechanisms to cope with sector errors, therefore, have become an important way to improve disk reliability. One approach to deal with sector errors is the introduction of intra-disk redundancy, where additional redundancy blocks are calculated and stored for each set of disk sectors. Previous studies have introduced intra-disk redundancy schemes and have evaluated their impact on disk reliability. None of these studies has evaluated the influence on disk drive performance or the underlying energy consumption. The study presented in this paper benchmarks existing schemes concerning these metrics. It shows the surprising result that weaker codes combined with newly introduced scrambling techniques can produce faster layouts with similar reliability properties than previously proposed strong codes. © 2011 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

On advantages of grid computing for parallel job scheduling

On advantages of grid computing for parallel job scheduling

引用

2nd IEEE/ACM International Symposium on Cluster computing and the Grid, CCGrid 2002

作者： Ernemann, Carsten Hamscher, Volker Schwiegelshohn, Uwe Yahyapour, Ramin Streit, Achim Computer Engineering Institute University Dortmund 44221 Dortmund Germany PC2 - Paderborn Center for Parallel Computing 33102 Paderborn Germany

ISBN: (纸本)0769515827

This paper addresses the potential benefit of sharing jobs between independent sites in a grid computing environment. Also the aspect of parallel multi-site job execution on different sites is discussed. To this end, various scheduling algorithms have been simulated for several machine configurations with different workloads which have been derived from real traces. The results showed that a significant improvement in terms of a smaller average response time is achievable. The usage of multi-site applications can additionally improve the results as long as the increase of the execution time due to communication overhead is limited to about 25%. © 2002 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共3页 << < 1 2 3 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：