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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,925 篇 会议
282 篇 期刊文献
26 册 图书
1 篇 科技报告

馆藏范围

11,234 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,466 篇 工学
- 5,207 篇 计算机科学与技术...
- 2,309 篇 软件工程
- 885 篇 电气工程
- 573 篇 信息与通信工程
- 252 篇 控制科学与工程
- 221 篇 电子科学与技术（可...
- 137 篇 网络空间安全
- 91 篇 机械工程
- 60 篇 生物工程
- 58 篇 动力工程及工程热...
- 52 篇 生物医学工程（可授...
- 46 篇 环境科学与工程（可...
- 45 篇 仪器科学与技术
- 41 篇 安全科学与工程
- 40 篇 建筑学
- 40 篇 测绘科学与技术
- 34 篇 化学工程与技术
- 33 篇 土木工程
- 32 篇 交通运输工程
1,033 篇 理学
- 813 篇 数学
- 121 篇 系统科学
- 116 篇 统计学（可授理学、...
- 83 篇 物理学
- 70 篇 生物学
- 48 篇 化学
- 41 篇 地球物理学
988 篇 管理学
- 843 篇 管理科学与工程(可...
- 285 篇 工商管理
- 176 篇 图书情报与档案管...
57 篇 经济学
- 54 篇 应用经济学
36 篇 法学
26 篇 医学
21 篇 农学
9 篇 教育学
6 篇 文学
3 篇 艺术学
2 篇 军事学

主题

1,705 篇 concurrent compu...
1,583 篇 distributed comp...
1,152 篇 parallel process...
986 篇 computer science
963 篇 computational mo...
873 篇 computer archite...
860 篇 application soft...
725 篇 grid computing
598 篇 high performance...
591 篇 hardware
530 篇 processor schedu...
488 篇 computer network...
456 篇 resource managem...
428 篇 scalability
399 篇 costs
395 篇 bandwidth
394 篇 runtime
383 篇 parallel program...
367 篇 peer to peer com...
356 篇 delay

机构

47 篇 college of compu...
40 篇 institute of com...
30 篇 oak ridge natl l...
29 篇 ibm thomas j. wa...
25 篇 institute of com...
23 篇 inria
23 篇 oak ridge nation...
22 篇 school of comput...
21 篇 mathematics and ...
18 篇 argonne natl lab...
18 篇 department of co...
18 篇 department of co...
18 篇 tokyo institute ...
17 篇 department of co...
17 篇 georgia inst tec...
17 篇 iit dept comp sc...
16 篇 univ chinese aca...
16 篇 lawrence berkele...
16 篇 department of co...
15 篇 department of co...

作者

32 篇 dongarra jack
30 篇 jack dongarra
23 篇 p. sadayappan
21 篇 a. choudhary
21 篇 david a. bader
20 篇 maciejewski anth...
19 篇 feng wu-chun
18 篇 dhabaleswar k. p...
18 篇 hoefler torsten
17 篇 p. banerjee
17 篇 h. casanova
17 篇 bader david a.
17 篇 howard jay siege...
17 篇 schulz martin
17 篇 panda dhabaleswa...
15 篇 s.k. das
15 篇 h.j. siegel
15 篇 hai jin
14 篇 gopalakrishnan g...
14 篇 alexey lastovets...

语言

11,156 篇 英文
68 篇 其他
10 篇 中文

检索条件"任意字段=International Symposium on Parallel and Distributed Computing"

共 11234 条记录，以下是571-580 订阅

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

详细简洁

排序：

User Allocation for Real-Time Applications with State Sharing in Fog computing Networks

User Allocation for Real-Time Applications with State Sharin...

引用

35th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Sato, Ryohei Kawaguchi, Hidetoshi Nakatani, Yuichi NTT Network Serv Syst Labs Musashino Tokyo Japan

ISBN: (纸本)9781665435772

Applications in which multiple users share the states in real-time over a network have been rapidly spreading, but network latency degrades their quality of service (QoS) and quality of experience (QoE). Although Fog computing effectively mitigates this problem, user allocation methods suitable for these applications with strict latency requirements have not yet been studied. Therefore, this paper proposes both offline and online methods that assume state sharing for user allocation in Fog environments. These methods not only reduce the mean of delays within each group composed of users who share the same states but also guarantee fairness among the users. The simulations demonstrate that our methods complete the allocation in a realistic time and outperform the baseline methods and architectures.

关键词： distributed processing Edge computing

来源：评论

学校读者我要写书评

暂无评论

A Study on the Performance of WebAssembly Versus JavaScript in an SVG Editor Environment

A Study on the Performance of WebAssembly Versus JavaScript ...

引用

parallel computing and distributed Systems (PCDS), international symposium on

作者： Jason Jeremy Wijadi Bryn Ghiffar Ida Bagus Kerthyayana Manuaba Computer Science Department School of Computing and Creative Arts Bina Nusantara University Jakarta Indonesia

ISBN: (数字)9798350349658

ISBN: (纸本)9798350349665

Scalable Vector Graphics (SVG) is an XML-based image format for two-dimensional diagrams. Made up of vectors, SVG enable image and behavior manipulation through a versatile XML-based format that can be created and edited with any text editor and many graphical editing software. With the advent of the web, SVG editing applications have become increasingly available to the public. However, in order to be able to serve users the ability to edit vector graphics in real-time, the performance of the editor plays a significant role in ensuring a smooth user experience. The goal of this study is in comparing the performance of WebAssembly and JavaScript for an SVG editor environment. Our results show that the WebAssembly implementation outperforms JavaScript in terms of execution time and memory usage.

关键词： Graphics parallel processing Vectors User experience Software Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Assisted HPC Workload Trace Generation for Leadership Scale Storage Systems 22

Machine Learning Assisted HPC Workload Trace Generation for ...

引用

31st international symposium on High-Performance parallel and distributed computing (HPDC)

作者： Paul, Arnab K. Choi, Jong Youl Karimi, Ahmad Maroof Wang, Feiyi Oak Ridge Natl Lab Oak Ridge TN 37830 USA BITS Pilani K K Birla Goa Campus Zuarinagar Goa India

ISBN: (纸本)9781450391993

Monitoring and analyzing a wide range of I/O activities in an HPC cluster is important in maintaining mission-critical performance in a large-scale, multi-user, parallel storage system. Center-wide I/O traces can provide high-level information and fine-grained activities per application or per user running in the system. Studying such large-scale traces can provide helpful insights into the system. It can be used to develop predictive methods for making predictive decisions, adjusting scheduling policies, or providing decisions for the design of next-generation systems. However, sharing real-world I/O traces to expedite such research efforts leaves a few concerns;i) the cost of sharing the large traces is expensive due to this large size, and ii) privacy concern is an issue. We address such issues by building an end-to-end machine learning (ML) workflow that can generate I/O traces for large-scale HPC applications. We leverage ML based feature selection and generative models for I/O trace generation. The generative models are trained on I/O traces collected by the darshan I/O characterization tool over a period of one year. We present a two-step generation process consisting of two deep-learning models, called the feature generator and the trace generator. The combination of two-step generative models provides robustness by reducing the bias of the model and accounting for the stochastic nature of the I/O traces across different runs of an application. We evaluate the performance of the generative models and show that the two-step model can generate time-series I/O traces with less than 20% root mean square error.

关键词： Darshan Generative Modeling Feature Selection Clustering parallel File System

来源：评论

学校读者我要写书评

暂无评论

P-RECS '22: 5th international Workshop on Practical Reproducible Evaluation of Computer Systems 22

P-RECS '22: 5th International Workshop on Practical Reproduc...

引用

31st international symposium on High-Performance parallel and distributed computing (HPDC)

作者： Lofstead, Jay Maltzahn, Carlos Jimenez, Ivo Sandia Natl Labs Ctr Comp Res Albuquerque NM 87123 USA Univ Calif Santa Cruz Ctr Res Open Source Software Santa Cruz CA USA

ISBN: (纸本)9781450391993

Reproducibility in computer science is often seen as a difficult to impossible task requiring bespoke hardware and software that others simply cannot field. Because of this, alternative approaches to reproducibility for computer systems is required. This workshop offers experiences and innovations in practical approaches for reproducibility for computer systems. The workshop also serves as the home of the ACM Exploratory Interest Group on Reproducibility and a community gathering for those interested in reproducible computer science research.

关键词： reproducibility computer systems scientific software verification and validation

来源：评论

学校读者我要写书评

暂无评论

A Novel Server-side Aggregation Strategy for Federated Learning in Non-IID situations 20

A Novel Server-side Aggregation Strategy for Federated Learn...

引用

20th international symposium on parallel and distributed computing (ISPDC)

作者： Xiao, Jianhang Du, Chunhui Duan, Zijing Guo, Wei Shanghai Jiao Tong Univ Dept Elect Engn Shanghai Peoples R China

ISBN: (纸本)9781665432818

Federated learning has been a promising distributed machine learning approach in many fields like e-economic, auto-driving and medical imaging for its privacy-aware manner. However, researchers have discovered that the performance of traditional federated learning approaches such as Federated Averaging (FEDAVG) declines extremely under Non-Independent and Identical (Non-IID) situations. We observed that part of the reason is the improper way of traditional federated learning's server-side aggregation method. The contributions of clients in federated learning can be distinguished by their trained models' validated accuracies. Based on that observation, we proposed a new federated learning algorithm, Accuracy Based Averaging (ABAVG), which improves the server-side aggregation method of traditional federated learning so that it can accelerate the convergence speed of federated learning in Non-IID situations. We extensively evaluate our proposed algorithm with FEDAVG as a baseline and we experiment on various Non-IID conditions to demonstrate the robust of our proposed algorithm. Experimental results show that the convergence speed averagely increased by 47% in Mnist dataset, 59% in Fashion-Mnist dataset and 33% in CIFAR-10 dataset in different data distributions by ABAVG.

关键词： Federated Learning distributed Machine Learning Non-IID

来源：评论

学校读者我要写书评

暂无评论

Linearizing computing the Power Set with OpenMP

Linearizing Computing the Power Set with OpenMP

引用

35th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Goodwin, Roger L. Independent Researcher Summit Point WV

ISBN: (纸本)9781665435772

This paper presents an alternative to computing the power set in a sequential computing environment. The algorithms to compute the power set run concurrently on the Stampede2 supercomputer using OpenMP. Given a set of size n, we partition the binomial coefficient function into n-1 tasks. The method gives each task various cardinalities to the power set to compute. We will present a load balance algorithm that computes the maximum number of sets for each cardinality in the power set for each task. Using the load balance algorithm;the partition of the binomial coefficient function;and the algorithms to compute the power set;we will show that n-1 tasks can compute the power set of the given set of size n phenomenally efficiently using OpenMP. With increasing input sizes n, the OpenMP algorithm run-times have a non-exponential function.

关键词： Power set Stampede2 supercomputer OpenMP parallel computing disjunctive normal form load balancing

来源：评论

学校读者我要写书评

暂无评论

IRIS: Exploring Performance Scaling of the Intelligent Runtime System and its Dynamic Scheduling Policies

IRIS: Exploring Performance Scaling of the Intelligent Runti...

引用

1st international Conference on Smart Energy Systems and Artificial Intelligence (SESAI)

作者： Johnston, Beau Miniskar, Narasinga Rao Young, Aaron Monil, Mohammad Alaul Haque Lee, Seyong Vetter, Jeffrey S. Oak Ridge Natl Lab Oak Ridge TN 37830 USA

ISBN: (纸本)9798350364613;9798350364606

High-Performance computing is becoming increasingly heterogeneous, relying on a diverse mix of hardware to achieve good performance. Paradoxically, current drivers and frameworks for these devices typically require separate languages and implementations for each vendor. Furthermore, there are few tools and little support to schedule codes between these devices in a truly heterogeneous manner partly because of this fragmentation between vendors and the languages each supports. To overcome both limitations, the Intelligent Runtime System (IRIS) was developed. It allows a common task abstraction to automatically be shared among contemporary vendors and is run from a single host-side API. At runtime, IRIS queries the host system and registers which frameworks and drivers are available, these determine which kernels can be used by the scheduler-CPUs via OpenMP, Nvidia GPUs (CUDA), AMD CPUs (HIP), and Intel and Xilinx FPGAs with OpenCL. IRIS enables tasks to he scheduled to any heterogeneous device and resolves to the appropriate kernel binary at runtime it only uses the devices supported by the system on which it is run. IRIS supports single-task and graph-based expressions of dependencies of tasks. Additionally, IRIS features a range of dynamic scheduling policies, allowing complex chains of tasks and interactions to be executed, relieving the programmer/user from considering the system to assign tasks to devices optimally. This paper presents the peak performance attainable by IRIS over a range of systems each with different numbers and types of accelerator devices, it highlights the flexibility of IRIS since these devices are truly heterogeneous, relying on different back ends (drivers, frameworks, and languages) which historically required unique implementations to utilize them. We then use this peak performance as a baseline to compare increasingly complex chains of tasks (with increasingly complex task dependencies) and evaluate how IRIS copes. Finally, we consider

关键词： Execution Model Heterogeneous computing Heterogeneous Systems High-Performance computing Performance Portability Programming Models Runtime System Scheduling Policy Task Schedule

来源：评论

学校读者我要写书评

暂无评论

Interactive Textbooks for parallel and distributed computing Across the Undergraduate CS Curriculum

Interactive Textbooks for Parallel and Distributed Computing...

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Elizabeth Shoop Richard Brown Suzanne J. Matthews Joel C. Adams Macalester College St. Olaf College United States Military Academy Calvin University

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

It has been a decade since the ACM/IEEE CS2013 Curriculum guidelines recommended that all CS students learn about parallel and distributed computing (PDC). But few text-books for “core” CS courses–especially first-year courses–include coverage of PDC topics. To fill this gap, we have written free, online, beginner- and intermediate-level PDC textbooks, containing interactive C/C++ OpenMP, MPI, mpi4py, CUDA, and OpenACC code examples that students can run and modify directly in the browser. The books address a serious challenge to teaching PDC concepts, namely, easy access to the powerful hardware needed for observing patterns and scalability. This paper describes the content of these textbooks and the underlying infrastructure that make them possible. We believe the described textbooks fill a critical gap in PDC education and will be very useful for the community.

关键词： distributed processing Codes Scalability Conferences Education Graphics processing units Hardware

来源：评论

学校读者我要写书评

暂无评论

Short-Time Traffic Flow Prediction Based on K-means++ and LSTM 20

Short-Time Traffic Flow Prediction Based on K-means++ and LS...

引用

20th IEEE international symposium on parallel and distributed Processing with Applications, 12th IEEE international Conference on Big Data and Cloud computing, 12th IEEE international Conference on Sustainable computing and Communications and 15th IEEE international Conference on Social computing and Networking, ISPA/BDCloud/SocialCom/SustainCom 2022

作者： Li, Jia Xu, Gang Cheng, Yuan Huang, Baoqi Inner Mongolia A.R. Key Laboratory of Wireless Networking and Mobile Computing Hohhot010021 China College of Computer Science Inner Mongolia University Hohhot010021 China

ISBN: (纸本)9781665464970

With the gradual increase in the number of vehicles owned by people, the problem of urban traffic congestion is becoming more and more serious. Timely and accurate traffic flow prediction helps travel vehicles to plan their routes reasonably, avoid congested roads and reduce environmental pollution. In order to take full advantage of the daily periodicity of the traffic flow of a road section, K-means++ with improved initial clustering centroids is applied to analyze the similarity of the daily traffic flow patterns and classify the traffic flow patterns with day as the time interval. One can separate the traffic patterns affected by different factors, and the other can exclude individual days containing abnormal data trends formed by unexpected road conditions, which can save the deep learning model from the interference of other irrelevant data features. Finally, a Long Short-Term Memory (LSTM) model is combined to predict the traffic flow value at the next time point based on the data of the previous hour. In the experiment, the K-means-LSTM model can significantly reduce the prediction error of short-time traffic flow and has better prediction performance by comparing with the prediction results of the support vector machine (SVR) model optimized by genetic algorithm (GA) and the LSTM model. © 2022 IEEE.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

A Scalable distributed Radix Sorter for FPGA Clusters using High-Bandwidth Memory Networks 30

A Scalable Distributed Radix Sorter for FPGA Clusters using ...

引用

IEEE 30th international symposium on Field-Programmable Custom computing Machines (FCCM)

作者： Urino, Yutaka Shimizu, Takanori Yamaguchi, Hiroshi Mizutani, Kenji Nakamura, Shigeru Usuki, Tatsuya Koibuchi, Michihiro Photon Elect Technol Res Assoc PETRA Hiroshima Japan Natl Inst Informat NII Tokyo Japan

ISBN: (纸本)9781665483322

A modern FPGA card can be equipped with high bandwidth memory, such as HBM2. Since the amount of the memory is limited on an FPGA, highly parallel data processing becomes crucial on tightly coupled FPGAs by high-density optical integration, e.g., onboard Si-Photonics transceivers. This study presents a scalable distributed radix sorter, and implements it on an eight-FPGA cluster. Each custom Stratix10 MX2100 FPGA card has 819-Gbps memory bandwidth with two HBM2 memories and 800-Gbps network bandwidth with eight custom embedded optical modules. Existing FPGA sorter typically relies on a merge sort. However, it has a severe performance bottleneck at the final stage of data merge, which cannot make the best use of the high memory-to-memory bandwidth on the FPGA cluster. Instead, we implement a radix sort for a 32-bit key range consisting of eight 4-bit counting sorts optimized to the memory-network structure. Each counting sort needs memory read/write access only once through global and local pipelines. We demonstrated a sorting throughput of 37.2 GB/s.

关键词： Integrated optics Pipelines Memory management Bandwidth Optical fiber networks Throughput Optical coupling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 54 55 56 57 58 59 60 61 62 63 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：