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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6 篇 会议

馆藏范围

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

日期分布

学科分类号

4 篇 管理学
- 4 篇 管理科学与工程(可...
- 4 篇 工商管理
3 篇 工学
- 3 篇 计算机科学与技术...
- 2 篇 软件工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
1 篇 理学
- 1 篇 数学
- 1 篇 物理学
- 1 篇 统计学（可授理学、...

主题

3 篇 scheduling
1 篇 graphics process...
1 篇 metadata

机构

1 篇 cesnet a.l.e. br...
1 篇 department of co...
1 篇 hermann-von-helm...
1 篇 department of co...
1 篇 department of co...
1 篇 in2p3 computing ...

作者

1 篇 abdelmoamen ahme...
1 篇 suter frédéric
1 篇 chlumský václav
1 篇 lebeck alvin r.
1 篇 streit achim
1 篇 soysal mehmet
1 篇 wang dezhong
1 篇 klusáček dalibor
1 篇 li yuxuan
1 篇 bashizade ramin
1 篇 berghoff marco
1 篇 gombert luc
1 篇 jamali nadeem
1 篇 azevedo frédéric

语言

6 篇 英文

检索条件"任意字段=22nd International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2018"

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

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

详细简洁

排序：

22nd international workshop on job scheduling strategies for parallel processing, jsspp 2018

22nd International Workshop on Job Scheduling Strategies for...

引用

22nd international workshop on job scheduling strategies for parallel processing, jsspp 2018

ISBN: (纸本)9783030106317

The proceedings contain 7 papers. The special focus in this conference is on job scheduling strategies for parallel processing. The topics include: Reducing the human-in-the-loop component of the scheduling of large HTC workloads;using pilot systems to execute many task workloads on supercomputers;Adaptive simultaneous multi-tenancy for GPUs;stochastic programming approach for resource selection under demand uncertainty;approaching actor-level resource control for akka.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evaluating the impact of soft walltimes on job scheduling performance 1

引用

22nd international workshop on job scheduling strategies for parallel processing, jsspp 2018

作者： Klusáček, Dalibor Chlumský, Václav CESNET a.l.e. Brno Czech Republic

ISBN: (数字)9783030106324

ISBN: (纸本)9783030106317

For two decades researchers have been analyzing the impact of inaccurate job walltime (runtime) estimates on the performance of job scheduling algorithms, especially in case of backfilling. Several studies analyzed the pros and cons of using accurate vs. inaccurate estimates. Some researchers focused on the ways users of the system can be motivated to provide more accurate runtime estimates. The recent addition of so-called "soft walltime" parameter in the widely used PBS Professional enables a system administrator to actually use some of these techniques to refine user-provided walltime estimates. The obvious question of a system administrator is whether such walltime predictions are useful and "safe" and what will be the impact on the overall system performance. In this work, we use several detailed simulations to analyze the actual impact of using soft walltimes in a job scheduler, discussing the scenarios when such "refined" estimates can be meaningfully used. © Springer Nature Switzerland AG 2019.

关键词： scheduling

来源：评论

学校读者我要写书评

暂无评论

Analysis of job metadata for enhanced wall time prediction 1

引用

22nd international workshop on job scheduling strategies for parallel processing, jsspp 2018

作者： Soysal, Mehmet Berghoff, Marco Streit, Achim Hermann-von-Helmholtz-Platz 1 Eggenstein-Leopoldshafen76344 Germany

ISBN: (数字)9783030106324

ISBN: (纸本)9783030106317

For efficient utilization of large-scale HPC systems, the task of resource management and job scheduling is of highest priority. Therefore, modern job scheduling systems require information about the estimated total wall time of the jobs already at submission time. Proper wall time estimates are a key for reliable scheduling decisions. Typically, users specify these estimates, already at submission time, based on either previous knowledge or certain limits given by the system. Real-world experience shows that user given estimates are far away from accurate. Hence, an automated system is desirable that creates more precise wall time estimates of submitted jobs. In this paper, we investigate different job metadata and their impact on the wall time prediction. For the job wall time prediction, we used machine learning methods and the workload traces of large HPC systems. In contrast to previous work, we also consider the jobname and in particular the submission directory. Our evaluation shows that we can better predict the accuracy of jobs per user by a factor of seven than most users, without any in-depth analysis of the job. © Springer Nature Switzerland AG 2019.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Approaching actor-level resource control for akka 1

引用

22nd international workshop on job scheduling strategies for parallel processing, jsspp 2018

作者： Abdelmoamen, Ahmed Wang, Dezhong Jamali, Nadeem Department of Computer Science Prairie View A&M University Prairie ViewTX United States Department of Computer Science University of Saskatchewan SaskatoonSK Canada

ISBN: (数字)9783030106324

ISBN: (纸本)9783030106317

Although there are models and prototype implementations for controlling resource use in Actor systems, they are difficult to implement for production implementations of Actors such as Akka. This is because the messaging and scheduling infrastructures of runtime systems are increasingly complex and significantly different from one system to another. This paper presents our efforts in implementing resource control support for Actor systems implemented using the Akka library. Particularly, given the lack of support in Akka for direct scheduling of actors, we compare two different ways of approximating actor-level control support. The first implementation expects messages to actors to provide estimates of resources likely to be consumed for processing them;these estimates are then relied upon to make scheduling decisions. In the second implementation, resource use of scheduled actors is tracked, and compared against allocations to decide when they should be scheduled next. We present experimental results on the performance cost of these resource control mechanisms, as well as their impact on resource utilization. © Springer Nature Switzerland AG 2019.

关键词： scheduling

来源：评论

学校读者我要写书评

暂无评论

Adaptive simultaneous multi-tenancy for GPUs 1

引用

22nd international workshop on job scheduling strategies for parallel processing, jsspp 2018

作者： Bashizade, Ramin Li, Yuxuan Lebeck, Alvin R. Department of Computer Science Duke University DurhamNC United States

ISBN: (数字)9783030106324

ISBN: (纸本)9783030106317

Graphics processing Units (GPUs) are energy-efficient massively parallel accelerators that are increasingly deployed in multi-tenant environments such as data-centers for general-purpose computing as well as graphics applications. Using GPUs in multi-tenant setups requires an efficient and low-overhead method for sharing the device among multiple users that improves system throughput while adapting to the changes in workload. This requires mechanisms to control the resources allocated to each kernel, and an efficient policy to make decisions about this allocation. In this paper, we propose adaptive simultaneous multi-tenancy to address these issues. Adaptive simultaneous multi-tenancy allows for sharing the GPU among multiple kernels, as opposed to single kernel multi-tenancy that only runs one kernel on the GPU at any given time and static simultaneous multi-tenancy that does not adapt to events in the system. Our proposed system dynamically adjusts the kernels’ parameters at run-time when a new kernel arrives or a running kernel ends. Evaluations using our prototype implementation show that, compared to sequentially executing the kernels, system throughput is improved by an average of 9.8% (and up to 22.4%) for combinations of kernels that include at least one low-utilization kernel. © Springer Nature Switzerland AG 2019.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Reducing the human-in-the-loop component of the scheduling of large HTC workloads 1

引用

22nd international workshop on job scheduling strategies for parallel processing, jsspp 2018

作者： Azevedo, Frédéric Gombert, Luc Suter, Frédéric IN2P3 Computing Center CNRS Lyon-Villeurbanne France

ISBN: (数字)9783030106324

ISBN: (纸本)9783030106317

A common characteristic to major physics experiments is an ever increasing need of computing resources to process experimental data and generate simulated data. The IN2P3 Computing Center provides its 2,500 users with about 35,000 cores and processes millions of jobs every month. This workload is composed of a vast majority of sequential jobs that corresponds to Monte-Carlo simulations and related analysis made on data produced on the Large Hadron Collider at CERN. To schedule such a workload under specific constraints, the CC-IN2P3 relied for 20 years on an in-house job and resource management system complemented by an operation team who can directly act on the decisions made by the job scheduler and modify them. This system has been replaced in 2011 but legacy rules of thumb remained. Combined to other rules motivated by production constraints, they may act against the job scheduler optimizations and force the operators to apply more corrective actions than they should. In this experience report from a production system, we describe the decisions made since the end of 2016 to either transfer some of the actions done by operators to the job scheduler or make these actions become unnecessary. The physical partitioning of resources in distinct pools has been replaced by a logical partitioning that leverages scheduling queues. Then some historical constraints, such as quotas, have been relaxed. For instance, the number of concurrent jobs from a given user group allowed to access a specific resource, e.g., a storage subsystem, has been progressively increased. Finally, the computation of the fair-share by the job scheduler has been modified to be less detrimental to small groups whose jobs have a low priority. The preliminary but promising results coming from these modifications constitute the beginning of a long-term activity to change the operation procedures applied to the computing infrastructure of the IN2P3 Computing Center. © Springer Nature Switzerland AG 2019.

关键词： scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：