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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

874 篇 会议
36 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

654 篇 工学
- 590 篇 计算机科学与技术...
- 181 篇 软件工程
- 105 篇 电气工程
- 77 篇 信息与通信工程
- 53 篇 控制科学与工程
- 34 篇 电子科学与技术（可...
- 24 篇 仪器科学与技术
- 15 篇 网络空间安全
- 11 篇 机械工程
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 8 篇 动力工程及工程热...
- 7 篇 测绘科学与技术
- 6 篇 交通运输工程
- 5 篇 力学（可授工学、理...
- 5 篇 石油与天然气工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 土木工程
139 篇 理学
- 100 篇 数学
- 14 篇 物理学
- 12 篇 生物学
- 10 篇 系统科学
- 9 篇 统计学（可授理学、...
- 7 篇 地球物理学
- 6 篇 化学
62 篇 管理学
- 41 篇 管理科学与工程(可...
- 25 篇 图书情报与档案管...
- 12 篇 工商管理
14 篇 医学
- 14 篇 临床医学
3 篇 经济学
2 篇 法学
2 篇 农学

主题

89 篇 parallel process...
46 篇 graphics process...
46 篇 distributed comp...
40 篇 computer archite...
40 篇 computational mo...
37 篇 graphics process...
32 篇 hardware
31 篇 parallel process...
28 篇 kernel
27 篇 optimization
24 篇 parallel program...
23 篇 benchmark testin...
23 篇 instruction sets
23 篇 multicore proces...
22 篇 libraries
20 篇 parallel algorit...
20 篇 runtime
20 篇 concurrent compu...
20 篇 distributed data...
19 篇 parallel computi...

机构

6 篇 tsinghua univ de...
6 篇 virginia tech de...
4 篇 univ chinese aca...
4 篇 ohio state univ ...
3 篇 nanyang technol ...
3 篇 college of compu...
3 篇 georgia inst tec...
3 篇 georgia inst tec...
3 篇 pacific northwes...
3 篇 univ hamburg ham...
3 篇 univ calif irvin...
3 篇 pacific northwes...
3 篇 oak ridge natl l...
3 篇 univ calif irvin...
3 篇 lawrence berkele...
3 篇 department of co...
2 篇 university of ot...
2 篇 universidad cató...
2 篇 univ pisa dept c...
2 篇 shanghai jiao to...

作者

5 篇 buluc aydin
4 篇 franca felipe m....
4 篇 bader david a.
4 篇 liu jie
4 篇 torquati massimo
4 篇 panda dhabaleswa...
4 篇 wang qinglin
4 篇 owens john d.
4 篇 danelutto marco
3 篇 pearce roger
3 篇 hirmer pascal
3 篇 ferner clayton
3 篇 nakano koji
3 篇 marco danelutto
3 篇 azzedine boukerc...
3 篇 harshvardhan
3 篇 mitschang bernha...
3 篇 gerndt michael
3 篇 simmhan yogesh
3 篇 marzulo leandro ...

语言

907 篇 英文
4 篇 中文
1 篇 其他

检索条件"任意字段=23rd IEEE International Parallel and Distributed Processing Symposium"

共 912 条记录，以下是111-120 订阅

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

详细简洁

排序：

Clock Gate on Abort: Towards Energy-Efficient Hardware Transactional Memory

Clock Gate on Abort: Towards Energy-Efficient Hardware Trans...

引用

23rd ieee international parallel and distributed processing symposium

作者： Sanyal, Sutirtha Roy, Sourav Cristal, Adrian Unsal, Osman S. Valero, Mateo Barcelona Supercomp Ctr Barcelona Spain Freescale Semicond Hyderabad Andhra Pradesh India

ISBN: (纸本)9781424437511

Transactional Memory (TM) is an emerging technology which promises to make parallel programming easier compared to earlier lock based approaches. However, as with any form of speculation, Transactional Memory too wastes a considerable amount of energy when the speculation goes wrong and transaction aborts. For Transactional Memory this wastage will typically be quite high because programmer will often mark a large portion of the code to be executed transactionally[4]. We are proposing to turn-off a processor dynamically by gating all its clocks, whenever any transaction running in it is aborted. We have described a novel protocol which can be used in the Scalable-TCC like Hardware Transactional Memory systems. Also in the protocol we are proposing a gating-aware contention management policy to set the duration of the clock gating period precisely so that both performance and energy can be improved. With our proposal we got an average 19% savings in the total consumed energy and even an average speed-up of 4%.

关键词： Hardware Transactional Memory Clock Gating distributed Shared Memory architecture Transaction Abort Low-power architecture

来源：评论

学校读者我要写书评

暂无评论

Scavenger: A Cloud Service for Optimizing Cost and Performance of DL Training 23

Scavenger: A Cloud Service for Optimizing Cost and Performan...

引用

23rd ieee/ACM international symposium on Cluster, Cloud and Internet Computing (CCGrid)

作者： Tyagi, Sahil Indiana Univ Bloomington Bloomington IN 47405 USA

ISBN: (纸本)9798350302080

Deep learning (DL) models learn non-linear functions and relationships by iteratively training on given data. To accelerate training further, data-parallel training [1] launches multiple instances of training process on separate partitions of data and periodically aggregates model updates. With the availability of VMs in the cloud, choosing the 'right' cluster configuration for data-parallel training presents non-trivial challenges. We tackle this problem by considering both the parallel and statistical efficiency of distributed training w.r.t. the cluster size configuration and batch-size in training. We build performance models to evaluate the pareto-relationship between cost and time of DL training across different cluster and batch-size configurations and develop Scavenger as a cloud service for searching optimum cloud configurations in an online, blackbox manner. © 2023 ieee.

关键词： data parallel training deep learning distributed training machine learning performance modeling

来源：评论

学校读者我要写书评

暂无评论

Minimizing Total Busy Time in parallel Scheduling with Application to Optical Networks

Minimizing Total Busy Time in Parallel Scheduling with Appli...

引用

23rd ieee international parallel and distributed processing symposium

作者： Flammini, Michele Monaco, Gianpiero Moscardelli, Luca Shachnai, Hadas Shalom, Mordechai Tamir, Tami Zaks, Shmuel Univ Aquila Dept Comp Sci I-67100 Laquila Italy Univ G dAnnunzio Dept Sci Pescara Italy Technion Israel Inst Technol Dept Comp Sci I-32000 Haifa Israel Tel Hai Acad Coll I-12210 Upper Gallilee Israel Interdisciplinary Ctr Sch Comp Sci Herzliyya Israel

ISBN: (纸本)9781424437511

We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J(1),..., J(n)}. Each job, J(j), is associated with an interval [s(j), c(j)] along which it should be processed. Also given is the parallelism parameter g >= 1, which is the maximal number of jobs that can be processed simultaneously by a single machine. Each machine operates along a contiguous time interval, called its busy interval, which contains all the intervals corresponding to the jobs it processes. The goal is to assign the jobs to machines such that the total busy time of the machines is minimized. The problem is known to be NP-hard already for, g = 2. We present a 4-approximation algorithm for general instances, and approximation algorithms with improved ratios for instances with bounded lengths, for instances where any two intervals intersect, and for instances where no interval is properly contained in another. Our study has important application in optimizing the switching costs of optical networks.

关键词： parallel job scheduling busy time interval graphs optical networks

来源：评论

学校读者我要写书评

暂无评论

New sequential and parallel algorithm for dynamic resource constrained project scheduling problem

New sequential and parallel algorithm for dynamic resource c...

引用

23rd ieee international parallel and distributed processing symposium, IPDPS 2009

作者： Da Silva, André Renato Villela Ochi, Luiz Satoru Computing Institute Federal Fluminense University Niterói Brazil

ISBN: (纸本)9781424437504

This paper proposes a new Evolutionary Algorithm for the Dynamic Resource Constrained Project Scheduling Problem. This algorithm has new features that get around some problems like premature convergence and other ones. The indirect representation approach was used because it allows the construction of a feasible solution from any input priorities. A parallel version is also proposed, making good use of multicore processors available nowadays. The results of sequential and parallel versions were very significant, improving in almost all ways the best results present in literature. © 2009 ieee.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Robust Sequential Resource Allocation in Heterogeneous distributed Systems with Random Compute Node Failures

Robust Sequential Resource Allocation in Heterogeneous Distr...

引用

23rd ieee international parallel and distributed processing symposium

作者： Shestak, Vladimir Chong, Edwin K. P. Maciejewski, Anthony A. Siegel, Howard Jay InfoPrint Solut Co 6300 Diagonal Highway Boulder CO 80301 USA Colorado State Univ Dept Elect & Comp Engn Ft Collins CO 80523 USA Colorado State Univ Dept Comp Sci Ft Collins CO 80523 USA Colorado State Univ Dept Math Ft Collins CO 80523 USA

ISBN: (纸本)9781424437511

The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of compute nodes may change spontaneously over time. Therefore, the resource-allocation policy must be designed to be robust with respect to absence and re-emergence of compute nodes so that the performance of the system is maximized. Such a policy is developed in this work, and its performance is evaluated on a model of a dedicated system composed of a limited set of heterogeneous Web servers. Assuming that each HTML request results in a "reward" if completed before its hard deadline, the goal is to maximize a cumulative reward obtained in the system. A failure rate for each server is set relatively high to simulate its operation under harsh conditions. The results demonstrate that the proposed approach based on the concepts of the Derman-Lieberman-Ross theorem outperforms other policies compared in our experiments for inconsistent, processor-consistent, and task-processor-consistent types of heterogeneity.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Small-File Access in parallel File Systems

Small-File Access in Parallel File Systems

引用

23rd ieee international parallel and distributed processing symposium

作者： Carns, Philip Lang, Sam Ross, Robert Vilayannur, Murali Kunkel, Julian Ludwig, Thomas Argonne Natl Lab Div Math & Comp Sci 9700 S Cass Ave Argonne IL 60439 USA VMware Inc Palo Alto CA 94304 USA Heidelberg Univ Inst Comp Sci Heidelberg Germany

ISBN: (纸本)9781424437511

Today's computational science demands have resulted in ever larger parallel computers, and storage systems have grown to match these demands. parallel file systems used in this environment are increasingly specialized to extract the highest possible performance for large I/O operations, at the expense of other potential workloads. While some applications have adapted to I/O best practices and can obtain good performance on these systems, the natural I/O patterns of many applications result in generation of many small files. These applications are not well served by current parallel file systems at very large scale. This paper describes five techniques for optimizing small-file access in parallel file systems for very large scale systems. These five techniques are all implemented in a single parallel file system (PVFS) and then systematically assessed on two test platforms. A microbenchmark and the mdtest benchmark are used to evaluate the optimizations at an unprecedented scale. We observe as much as a 905% improvement in small-file create rates, 1,106% improvement in small-file stat rates, and 727% improvement in small-file removal rates, compared to a baseline PVFS configuration on a leadership computing platform using 16,384 cores.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

A new mechanism to deal with process variability in NoC links

A new mechanism to deal with process variability in NoC link...

引用

23rd ieee international parallel and distributed processing symposium

作者： Hernandez, Carles Silla, Federico Santonja, Vicente Duato, Jose Univ Politecn Valencia Parallel Architecture Grp Valencia 46022 Spain

ISBN: (纸本)9781424437511

Associated with the ever growing integration scale of VLSI technologies is the increase in process variability, which makes silicon devices to become less predictable. In the context of network-on-chip (NoC), this variability affects the maximum frequency that could be sustained by each wire of the link that interconnects two cores in a CMP system. Reducing the clock frequency so that all wires can properly work is a trivial solution but, as variability increases, this approach causes at? unacceptable performance penalty. In this paper we propose a new technique to deal with the effects of variability on the links of the NoC that interconnects cores in a CMP system. This technique, called Phit Reduction (PR), retrieves most of the bandwidth still available in links containing wires that are not able to operate at the designed operating frequency,. More precisely our mechanism discards these slow wires and uses all the wires that can work at the design frequency. Two implementations are presented: Local Phit Reduction (LPR), oriented to fabrication processes with very high variability, which requires more hardware but provides higher performance;and Global Phit Reduction (GPR), that requires less additional hardware but is not able to extract all the available bandwidth. The performance evaluation presented it? the paper confirms that LPR obtains good results both for low and high variability scenarios. Moreover, in most of our experiments LPR practically achieves the same performance than the ideal network. On the other hand, GPR is appropriate for systems where whithin-die variations are expected to be low.

关键词： Wire

来源：评论

学校读者我要写书评

暂无评论

A Scheduling Algorithm for Hyperledger Fabric Based on Transaction Batch processing 23

A Scheduling Algorithm for Hyperledger Fabric Based on Trans...

引用

23rd international symposium on parallel and distributed Computing (ISPDC)

作者： Jial, Junyu Wu, Ou Li, Shanshan Mao, Rufei Zhang, He Anhui Normal Univ Wuhu Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing Peoples R China Nanjing Univ Software Inst Nanjing Peoples R China PLA Army Engn Univ Dept Basic Courses Beijing Peoples R China

ISBN: (纸本)9798350369205;9798350369199

Hyperledger Fabric (Fabric for short), is a consortium blockchain platform that adopts the smart contract paradigm and provides complete operational functions. Although it has become the system with the highest throughput among open source blockchain systems, its performance cannot meet the needs of industrial-grade application scenarios. To further expand the application scenarios of blockchain, this paper proposes a Transaction Batch processing Scheduling (TBPS) algorithm for multi-channel Fabric networks based on Lyapunov optimization theory. The algorithm maximizes the consensus efficiency of the system while ensuring the minimum transaction accumulation, and provides stability conditions and optimal performance for the system under transaction batch processing. Finally, we built a blockchain network of Fabric's latest stable version v2.0 via the cloud platform, providing an order of magnitude of algorithmic parameters by testing transaction processing rates. To simulate the distribution of performance indicators such as transaction delay, system transaction accumulation and average transaction processing rate under different impact factors, and verify the effectiveness of the proposed TBPS algorithm.

关键词： Blockchain Hyperledger Fabric Optimization Scheduling Algorithm

来源：评论

学校读者我要写书评

暂无评论

D-Storm: Dynamic Resource-Efficient Scheduling of Stream processing Applications 23

D-Storm: Dynamic Resource-Efficient Scheduling of Stream Pro...

引用

23rd ieee international Conference on parallel and distributed Systems (ICPADS)

作者： Liu, Xunyun Buyya, Rajkumar Univ Melbourne Sch Comp & Informat Syst Cloud Comp & Distributed Syst CLOUDS Lab Melbourne Vic Australia

ISBN: (纸本)9781538621295

Scheduling streaming applications in Data Stream Management Systems (DSMS) has been investigated for years. However, there lacks an intelligent system that is capable of monitoring application execution, modelling its resource usages, and then adjusting the scheduling plan under different sizes of inputs without requiring users' intervention. In this paper, we model the scheduling problem as a bin-packing variant and propose a heuristic-based algorithm to solve it with minimised inter-node communication. We also implement the D-Storm prototype to validate the efficacy and efficiency of our scheduling algorithm, by extending the Apache Storm framework into a self-adaptive MAPE (Monitoring, Analysis, Planning, Execution) architecture. The evaluation carried out on both synthetic and realistic applications proves that D-Storm outperforms the existing resource-aware scheduler and the default Storm scheduler by at least 16.25% in terms of the inter-node traffic reduction and yields a significant amount of resource savings through consolidation.

关键词： Task analysis Dynamic scheduling Storms Runtime Monitoring Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Faster parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

A Faster Parallel Algorithm and Efficient Multithreaded Impl...

引用

23rd ieee international parallel and distributed processing symposium

作者： Madduri, Kamesh Ediger, David Jiang, Karl Bader, David A. Chavarria-Miranda, Daniel Lawrence Berkeley Natl Lab Computat Res Div Berkeley CA 94720 USA Georgia Inst Technol Coll Comp Atlanta GA 30332 USA High Performance Comp Pacif Northwest Natl Lab Richland WA USA

ISBN: (纸本)9781424437511

We present a new lock free parallel algorithm for computing betweenness centrality, of massive complex networks that achieves better spatial locality compared with previous approaches. Betweenness centrality is a key kennel in analyzing the importance of vertices (or edges) in applications ranging from social networks, to power grids, to the influence of jazz musicians, and is also incorporated into the DARPA HPCS SSCA#2, a benchmark extensively used to evaluate the performance of emerging high-performance computing architectures for graph analytics. We design an optimized implementation of betweenness centrality for the massively multithreaded Cray XMT system with the Thread-storm processor. For a small-world network of 268 million vertices and 2.147 billion edges, the 16-processor XMT system. achieves a TEPS rate (an algorithmic performance count for the number of edges traversed per second) of 160 million per second, which corresponds to more than a 2x performance improvement over the previous parallel implementation. We demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for the large IMDb movie-actor network.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共92页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：