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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

9,285 篇 会议
362 篇 期刊文献
31 册 图书
1 篇 学位论文

馆藏范围

9,679 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,567 篇 工学
- 4,176 篇 计算机科学与技术...
- 2,156 篇 软件工程
- 848 篇 电气工程
- 638 篇 信息与通信工程
- 313 篇 控制科学与工程
- 227 篇 电子科学与技术（可...
- 83 篇 网络空间安全
- 65 篇 机械工程
- 56 篇 石油与天然气工程
- 55 篇 材料科学与工程（可...
- 52 篇 仪器科学与技术
- 50 篇 生物医学工程（可授...
- 40 篇 动力工程及工程热...
- 34 篇 生物工程
- 32 篇 建筑学
- 31 篇 安全科学与工程
- 29 篇 环境科学与工程（可...
- 28 篇 力学（可授工学、理...
- 27 篇 土木工程
- 26 篇 光学工程
1,073 篇 理学
- 862 篇 数学
- 129 篇 统计学（可授理学、...
- 125 篇 系统科学
- 101 篇 物理学
- 48 篇 生物学
- 34 篇 化学
808 篇 管理学
- 626 篇 管理科学与工程(可...
- 296 篇 工商管理
- 220 篇 图书情报与档案管...
71 篇 经济学
- 68 篇 应用经济学
22 篇 法学
22 篇 医学
18 篇 农学
16 篇 文学
10 篇 教育学
6 篇 军事学
1 篇 艺术学

主题

1,212 篇 distributed data...
993 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
779 篇 computer science
695 篇 databases
617 篇 computer archite...
586 篇 application soft...
553 篇 computational mo...
463 篇 parallel process...
369 篇 scalability
358 篇 distributed comp...
352 篇 distributed proc...
327 篇 hardware
325 篇 database systems
294 篇 processor schedu...
294 篇 costs
293 篇 parallel program...
291 篇 resource managem...
269 篇 fault tolerance

机构

32 篇 ibm thomas j. wa...
20 篇 school of comput...
19 篇 oak ridge natl l...
15 篇 college of compu...
13 篇 oak ridge nation...
13 篇 oak ridge nation...
13 篇 pacific northwes...
12 篇 iit dept comp sc...
12 篇 lawrence berkele...
12 篇 argonne national...
12 篇 mathematics and ...
11 篇 department of co...
11 篇 georgia institut...
11 篇 department of co...
11 篇 mathematics and ...
11 篇 department of co...
11 篇 department of co...
11 篇 lawrence berkele...
10 篇 school of comput...
10 篇 lawrence berkele...

作者

21 篇 a. choudhary
15 篇 boukerche azzedi...
13 篇 dongarra jack
13 篇 sun xian-he
11 篇 hoefler torsten
11 篇 s.k. das
11 篇 jack dongarra
11 篇 kurt rothermel
10 篇 choudhary a
9 篇 raicu ioan
9 篇 jun zhang
9 篇 m. takizawa
9 篇 yong chen
9 篇 ciprian dobre
9 篇 l.r. welch
9 篇 welch lonnie r.
9 篇 t. kurc
9 篇 chen haibo
9 篇 florin pop
9 篇 cameron kirk w.

语言

9,640 篇 英文
21 篇 中文
18 篇 其他

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

共 9679 条记录，以下是151-160 订阅

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

详细简洁

排序：

Speedcode: Software Performance Engineering Education via the Coding of Didactic Exercises

Speedcode: Software Performance Engineering Education via th...

引用

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

作者： Kaler, Tim Chen, Xuhao Wheatman, Brian Curtis, Dorothy Hoppe, Bruce Schardl, Tao B. Leiserson, Charles E. MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA Johns Hopkins Univ Baltimore MD USA Connect Associates Boston MA USA

ISBN: (纸本)9798350364613;9798350364606

This paper introduces Speedcode, an online programming platform that aims to improve the accessibility of software performance-engineering education. At its core, Speedcode provides a platform that lets users gain hands-on experience in software performance engineering and parallel programming by completing short programming exercises. Speedcode challenges users to develop fast multicore solutions for short programming problems and evaluates their code's performance and scalability in a quiesced cloud environment. Speedcode supports parallel programming using OpenCilk, task-parallel computing platform that is open-source and easy to program, teach and use for research. Speedcode aims to reduce barriers to learning and teaching software performance engineering. It allows users to run and evaluate their code on modern multicore machines from their own computer without installing any software. This provides users an easy introduction to the topic, and enables teachers to more easily incorporate lessons on software performance engineering into their courses without incurring the onerous overhead of needing to setup computing environments for their students.

关键词： education online learning platforms parallel programming software performance engineering

来源：评论

学校读者我要写书评

暂无评论

distributed Training of Neural Radiance Fields: A Performance Characterization

Distributed Training of Neural Radiance Fields: A Performanc...

引用

2024 IEEE international symposium on Performance Analysis of systems and Software, ISPASS 2024

作者： Zhao, Adrian Zhang, Louis Durvasula, Sankeerth Chen, Fan Jain, Nilesh Panneer, Selvakumar Vijaykumar, Nandita University of Toronto Canada Intel Labs United States Vector Institute Canada

ISBN: (纸本)9798350376388

Implicit neural representation is an emerging method that leverages deep neural networks and learned parameters to represent 3D scenes efficiently and accurately. Neural radiance field (NeRF) is a state-of-art implicit representation that achieves photorealistic 3D reconstruction with compact neural network models. However, as the complexity and scale of the scene increase, training NeRF models with a single GPU proves insufficient for achieving fast training and high-quality reconstruction. To address this challenge, prior works proposed distributed NeRF training methods. This is the first work to conduct a detailed evaluation of two major distributed NeRF training methods and their tradeoffs: distributed data parallel (DDP) and spatial segmentation (SS). We find that DDP training requires cross-device synchronization during training, while SS training incurs additional fusion overhead during inference. Our analysis also reveals that sampling input images is a common key bottleneck in distributed NeRF training. At the beginning of each training iteration, the CPU generates input batches for all GPUs in the cluster by sampling all images in the dataset, causing significant stalls that constitute up to 43.3% of the total training time. To alleviate this bottleneck, we propose a pipelined input sampling strategy that precomputes input samples on the CPU concurrently with model training on the GPUs. Our evaluation demonstrates an average speedup in training time by 1.95×( up to 2.24×). © 2024 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Mathematical Model and a Convergence Result for Totally Asynchronous Federated Learning

A Mathematical Model and a Convergence Result for Totally As...

引用

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

作者： El-Baz, Didier Luo, Jia Mo, Hao Shi, Lei Univ Toulouse LAAS Toulouse France Chongqing Res Inst Chongqing Peoples R China Beijing Univ Technol Beijing Peoples R China Commun Univ China State Key Lab Media Convergence & Commun Beijing Peoples R China

ISBN: (纸本)9798350364613;9798350364606

A totally asynchronous gradient algorithm, with fixed step size is proposedfor federated learning. A mathematical model is presented and a convergence result is established. The convergence result is based on the concept of macro iterations sequence. The interest of the contribution is to show that the asynchronous federated learning method converges when gradients of loss functions are updated by workers without order nor synchronization and with possible unbounded delays.

关键词： machine learning federated learning convex optimization gradient algorithms asynchronous iterative algorithms distributed computing

来源：评论

学校读者我要写书评

暂无评论

Towards Fine-grained parallelism in parallel and distributed Python Libraries

Towards Fine-grained Parallelism in Parallel and Distributed...

引用

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

作者： Kerney, Jamison Raicu, Joan Raicu, John Chard, Kyle IIT Coll Comp Chicago IL 60616 USA Univ Chicago Dept Comp Sci Chicago IL 60637 USA

ISBN: (纸本)9798350364613;9798350364606

There is a growing need, for example in machine learning and analytics, to decompose applications into smaller schedulable units. Such decomposition can improve performance, reduce energy consumption, and increase resource utilization. Unfortunately, enabling fine-grained parallelism comes with significant overheads and requires improvements at all layers of the programming stack. We consider the challenges of supporting fine-grained parallelism in the increasingly popular Python-based programming libraries. Specifically, we focus on Parsl, a Python library that is widely used to parallelize the execution of fine-grained Python functions. Parsl's Python-based runtime supports a maximum throughput of around 1200 tasks per second insufficient to meet modern application needs. We perform a comprehensive analysis of Parsl and identify areas that prohibit it from achieving higher throughput. We first profile Parsl components and identify that, with fine-grained tasks workers are often not saturated. We find that tasks spend a majority of their time in the components between the scheduler and worker, however, we also learned that the scheduler is capable of submitting thousands of tasks per second. We then focused on developing new optimizations and implementing crucial components in C to improve throughput. Our new implementation increases Parsl's throughput 6 fold.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

Toward High-Performance Blockchain System by Blurring the Line between Ordering and Execution 24

Toward High-Performance Blockchain System by Blurring the Li...

引用

2024 international Conference for High Performance Computing, Networking, Storage and Analysis

作者： Ryu, Donghyeon Park, Chanik POSTECH Comp Sci & Engn Dept Pohang South Korea

ISBN: (数字)9798350352917

ISBN: (纸本)9798350352924;9798350352917

The primary bottleneck of blockchain is shifting from consensus to execution due to recent advances in DAG-based consensus algorithms supporting over 100k TPS. Many blockchain systems segregate execution from ordering, missing the opportunity to harness potential parallelism in consensus-produced batches. In this paper, we propose a new deterministically orderable concurrency control algorithm, OptME, which improves the performance of execution phase by exploiting inherent parallelism among transactions. This algorithm analyzes transaction dependencies to extract parallelism, and determines the total order of transaction execution. OptME consists of three steps: (1) building a transaction dependency graph, (2) generating a parallel execution schedule, and (3) executing transactions based on the schedule. We employ several optimizations, including parallel dependency graph construction, early abort detection, and efficient reordering with an optimistic assumption. Our evaluation demonstrates that OptME achieves up to 350k TPS and outperforms a state-of-the-art concurrency control algorithm, even under high contention scenarios.

关键词： distributed databases Blockchains Smart contracts Concurrency control Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

CODC-pyParaQC: A design and implementation of parallel quality control for ocean observation big data 22

CODC-pyParaQC: A design and implementation of parallel quali...

引用

22nd IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2024

作者： Yuan, Huifeng Li, Tianyan Jin, Zhong Cheng, Lijing Tan, Zhetao Zhang, Bin Wang, Yanjun Computer Internet Information Center Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Chinese Academy of Sciences Institute of Atmospheric Physics Beijing China Chinese Academy of Sciences Institute of Oceanography Qingdao China

ISBN: (纸本)9798331509712

High-quality ocean observation is essential for research and applications in ocean exploration and climate change. With moving into the era of big data in recent years, it becomes crucial to process these massive raw observations accurately and efficiently. This paper addressed issues encountered in processing ocean big data within traditional delayed-mode quality control systems, including substantial serial I/O workloads and frequent context switching. A parallel quality control scheme named CODC-pyParaQC was proposed by constructing computing process groups. It retains the advantages of the existed delayed-mode quality control system (e.g. CODC-QC) while improving the efficiency of the quality control procedure, solving the feasibility of a large-scale parallel computation of the quality control scheme and realizing the (near) real-time quality control of massive ocean observation profiles. The results showed that the efficiency of single-node quality control has been improved by about 10 times. Leveraging the computing power of supercomputers and employing multi process groups for cross-node parallel computation, we have developed a fast and efficient (near) real-time quality control procedure. This system processed approximately 22,548,733 temperature profiles from the world ocean database (1940-2023) in about 6.5 hours. Our new quality control scheme can ensure the computing capability necessary for establishing a high-quality ocean observation profile database. © 2024 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Fast distributed Polynomial Multiplication Algorithm for Lattice-based Cryptographic Decryption In Blockchain systems 22

Fast Distributed Polynomial Multiplication Algorithm for Lat...

引用

22nd IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2024

作者： Zhao, Hongjian Tao, Yunting Kong, Fanyu Zhang, Guoyan Zhang, Hanlin Yu, Jia Shandong University School of Software Jinan China Binzhou Polytechnic College of Information Engineering Binzhou China Shandong University Shandong Sansec Information Technology Co. Ltd School of Software Jinan China Shandong University School of Cyber Science and Technology Qingdao China Qingdao University College of Computer Science and Technology Qingdao China

ISBN: (纸本)9798331509712

Lattice-based Post-Quantum Cryptography (PQC) can effectively resist the quantum threat to blockchain's underlying cryptographic algorithms. Blockchain node decryption is one of the most commonly used cryptographic computations in blockchain systems, and polynomial multiplication, a time-consuming operation for decryption, is one of the factors limiting blockchain efficiency. This paper proposes a novel distributed computing algorithm for polynomial multiplication, applicable in blockchain decryption. By splitting polynomials into lower-degree terms and delegating tasks to distributed nodes, our approach reduces computation time. A novel verification strategy based on the Karatsuba algorithm ensures result accuracy. The experimental results demonstrate that our proposed scheme improves the execution efficiency of NTT and INTT operations by approximately 47.8% and 52.4%, and reduces Kyber decryption time by up to 23.5%. © 2024 IEEE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimization Design Algorithm for Dual-Active Bridge Converters Using parallel Power Modules 13

Optimization Design Algorithm for Dual-Active Bridge Convert...

引用

13th international symposium on Power Electronics for distributed Generation systems (PEDG)

作者： Porras Fernandez, David A. Gomez Jimenez, Roderick A. Fantino, Roberto A. Balda, Juan C. Univ Arkansas Dept Elect Engn Fayetteville AR 72701 USA Univ Nacl Sur UNS Alfredo Desages DIEC UNS CONICET Inst Invest Ingn Elect IIIE Bahia Blanca Buenos Aires Argentina

ISBN: (数字)9781665466189

ISBN: (纸本)9781665466189

This work presents an optimization algorithm for the design of isolated Dual-Active Bridge (DAB) converters using parallel power modules, in which volume, power density and number of switching devices are selected to achieve an specific optimal point of operation for giving input/output voltages and power. This point of operation is selected based on the maximum switching frequency that can be used for possible maximum power and minimum volume to obtain the desired power density. The maximum power can be selected based on the number of switching devices that are needed for a giving output power and the volume is based on the design of the magnetic components, such as inductors and transformer. The proposed design algorithm selects the magnetic components and number or switching devices based on an optimal point of operation that maximizes efficiency and minimizes volume to obtain the best volume-to-losses relation for a giving switching frequency.

关键词： Power system measurements Density measurement Switching frequency Multichip modules Magnetic devices Bridge circuits Switches

来源：评论

学校读者我要写书评

暂无评论

Integrating interactive performance analysis in Jupyter Notebooks for parallel programming education

Integrating interactive performance analysis in Jupyter Note...

引用

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

作者： Oden, Lena Noelp, Klaus Brauner, Philipp Univ Hagen Comp Engn Hagen Germany Rhein Westfal TH Aachen Human Comp Interact Ctr Aachen Germany

ISBN: (纸本)9798350364613;9798350364606

Understanding the performance behavior of parallel applications is important in many ways, but doing so is not easy. Most open source analysis tools are written for the command line. We are building on these proven tools to provide an interactive performance analysis experience within Jupyter Notebooks when developing parallel code with MPI, OpenMP, or both. Our solution makes it possible to measure the execution time, perform profiling and tracing, and visualize the results within the notebooks. For ease of use, it provides both a graphical JupyterLab extension and a C++ API. The JupyterLab extension shows a dialog where the user can select the type of analysis and its parameters. Internally, this tool uses Score -P, Scalasca, and Cube to generate profiling and tracing data. This tight integration gives students easy access to profiling tools and helps them better understand concepts such as benchmarking, scalability and performance bottlenecks. In addition to the technical development, the article presents hands-on exercises from our well-established parallel programming course. We conclude with a qualitative and quantitative evaluation with 19 students, which shows a positive effect of the tools on the students' perceived competence.

关键词： Jupyter parallel programming performance analysis interactive programming high perfonnance computing

来源：评论

学校读者我要写书评

暂无评论

parallel Integrity Authentication Data Structure Construction for Encrypted Range Queries 21

Parallel Integrity Authentication Data Structure Constructio...

引用

21st IEEE international symposium on parallel and distributed Processing with Applications, 13th IEEE international Conference on Big Data and Cloud Computing, 16th IEEE international Conference on Social Computing and Networking and 13th international Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Wang, Zhaokang Pan, Jiahui Zhou, Lu Zhang, Zhonghui Ji, Caocong Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology Nanjing China

ISBN: (纸本)9798350329223

With the rapid growth of cloud computing, outsourcing databases to cloud servers is becoming increasingly popular. Query integrity authentication is an effective technique to obtain reliable query results from untrusted clouds. ServeDB (Wu et al., ICDE 2019) is a state-of-the-art system that provides integrity authentication for encrypted range queries. However, ServeDB is a serial system. The high construction cost of its authentication data structure SVETree is the main performance bottleneck that limits its scalability to large datasets. In this study, we overcome the scalability limitation by parallelizing the SVETree construction workflow using the MapReduce framework. We propose the link-free storage layout to store the tree-based SVETree structure in a distributed key-value storage. The parallel SVETree construction algorithm reduces the communication latency of the key-value storage with the batch put/get optimization. The algorithm balances the workload of different tree nodes with the record-centric parallelization optimization. Furthermore, it avoids triggering out-of-core shuffles with the multi-round in-memory shuffle technique. The experimental results show that the parallel algorithm running on 128 cores achieves a 52.7 × speedup over the original serial algorithm. The parallel algorithm exhibits near-linear data and machine scalability. © 2023 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：