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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16,237 篇 会议
368 篇 期刊文献
22 册 图书

馆藏范围

16,627 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

9,336 篇 工学
- 8,536 篇 计算机科学与技术...
- 4,019 篇 软件工程
- 1,982 篇 电气工程
- 1,383 篇 信息与通信工程
- 676 篇 电子科学与技术（可...
- 535 篇 控制科学与工程
- 228 篇 网络空间安全
- 188 篇 仪器科学与技术
- 141 篇 机械工程
- 115 篇 生物医学工程（可授...
- 106 篇 动力工程及工程热...
- 105 篇 测绘科学与技术
- 97 篇 光学工程
- 91 篇 生物工程
- 82 篇 建筑学
- 70 篇 土木工程
- 63 篇 环境科学与工程（可...
- 61 篇 安全科学与工程
1,973 篇 理学
- 1,505 篇 数学
- 245 篇 物理学
- 203 篇 统计学（可授理学、...
- 177 篇 系统科学
- 115 篇 生物学
- 100 篇 地球物理学
- 69 篇 化学
1,463 篇 管理学
- 1,205 篇 管理科学与工程(可...
- 468 篇 工商管理
- 321 篇 图书情报与档案管...
106 篇 医学
- 86 篇 临床医学
96 篇 经济学
- 93 篇 应用经济学
56 篇 法学
53 篇 农学
18 篇 教育学
12 篇 文学
9 篇 军事学
1 篇 艺术学

主题

2,212 篇 parallel process...
1,199 篇 computer archite...
1,130 篇 concurrent compu...
1,116 篇 distributed comp...
1,063 篇 computational mo...
1,037 篇 application soft...
1,017 篇 distributed proc...
990 篇 hardware
905 篇 computer science
708 篇 graphics process...
595 篇 runtime
527 篇 scalability
518 篇 parallel process...
507 篇 algorithm design...
494 篇 parallel program...
490 篇 parallel algorit...
470 篇 graphics process...
460 篇 kernel
446 篇 processor schedu...
440 篇 conferences

机构

38 篇 ibm thomas j. wa...
33 篇 college of compu...
31 篇 school of comput...
27 篇 oak ridge nation...
26 篇 university of ch...
26 篇 oak ridge natl l...
25 篇 georgia inst tec...
25 篇 ohio state univ ...
24 篇 department of co...
23 篇 tsinghua univers...
23 篇 pacific northwes...
21 篇 argonne national...
21 篇 oak ridge nation...
20 篇 georgia inst tec...
19 篇 college of compu...
19 篇 school of comput...
19 篇 department of co...
19 篇 argonne natl lab...
19 篇 pacific northwes...
19 篇 national laborat...

作者

39 篇 jack dongarra
31 篇 dongarra jack
29 篇 zomaya albert y.
26 篇 bader david a.
23 篇 feng wu-chun
22 篇 boukerche azzedi...
19 篇 hoefler torsten
18 篇 gagan agrawal
18 篇 schulz martin
16 篇 dhabaleswar k. p...
16 篇 p. sadayappan
16 篇 wang yijie
15 篇 ito yasuaki
15 篇 yves robert
14 篇 h. casanova
14 篇 alexey lastovets...
14 篇 azad ariful
13 篇 dongsheng li
13 篇 wang guojun
13 篇 kishore kothapal...

语言

16,553 篇 英文
44 篇 其他
27 篇 中文
2 篇 土耳其文
1 篇 葡萄牙文

检索条件"任意字段=IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 16627 条记录，以下是431-440 订阅

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

详细简洁

排序：

Energy Efficiency Through In-Sensor Computing: ADC-less Real-Time Sensing for Image Edge Detection 24

Energy Efficiency Through In-Sensor Computing: ADC-less Real...

引用

29th ACM / ieee international symposium on Low Power Electronics and Design (ISLPED)

作者： Modak, Nirmoy Roy, Kaushik Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9798400706882

In-sensor computing has revolutionized modern vision-based applications, particularly in scenarios like autonomous vehicles and robotics where real-time or near-real-time processing is crucial. By enabling data processing at the sensor level, in-sensor computing eliminates the need to transmit data to cloud servers, significantly reducing latency and enhancing decision-making speed. Central to the in-sensor computing paradigm, CMOS image sensors (CISs) with edge computing, play a pivotal role in machine vision applications. The need for high resolution, low power, and real-time operation aligns seamlessly with the demands of modern vision-based applications. In this paper, we propose a novel approach for real-time image edge detection with an in-sensor, ADC-less sensing solution that achieves high energy efficiency and speed. The design utilizes the column-parallel architecture of existing CIS and the row-wise pixel readout scheme. Column voltages of three consecutive rows with a delay arrangement extract 4-bit edge pixels without deriving the actual digital image pixels. A time-to-digital conversion (TDC) technique using a 4-bit counter eliminates the requirement of power-hungry ADC. A 256(H) x 256(V) 2D CMOS pixel array with 10.. m pixel pitch is simulated using Spectre in TSMC 65nm low-power technology. CMOS pixels with wide dynamic range (WDR) capture the light intensity variation up to 92dB [10]. Simulation results show energy consumption of 2pWper pixel per frame, operating at a frame rate of 3.9kfps, all well-contained within a modest 0.5 mW power budget. The resultant frame rate emerges as notably superior in terms of speed, accompanied by a more than tenfold reduction in power consumption per edge frame-pixel compared to the existing prior art.

关键词： CMOS image sensor (CIS) column-parallel (CP) imaging Wide Dynamic Range (WDR) Image Signal Processor (ISP) time-to-digital conversion (TDC) ADC-less CIS On-chip image edge detection

来源：评论

学校读者我要写书评

暂无评论

Influence of optimization techniques on software performance for subsequent generations of CUDA architecture 19

Influence of optimization techniques on software performance...

引用

19th ieee international symposium on parallel and distributed processing with applications (ieee ISPA)

作者： Gambrych, Jacek Warsaw Univ Technol Inst Elect Syst Warsaw Poland

ISBN: (纸本)9781665435741

From the very beginning of the CUDA technology, it was essential to apply state-of-the-art optimization techniques. Only then was it possible to fully utilize the enormous computational power of graphic processing units. However, with the development of the CUDA architecture, the impact of typical optimization techniques on software performance has changed significantly. This article shows how the impact of several optimization techniques on the performance of the image filtering algorithm has changed for the subsequent generations of CUDA architecture. Then, based on the results obtained, it attempts to answer whether tedious and time-consuming optimization of the CUDA software is still necessary.

关键词： parallel processing GPGPU CUDA optimization techniques

来源：评论

学校读者我要写书评

暂无评论

Asynchronous distributed-Memory Triangle Counting and LCC with RMA Caching 36

Asynchronous Distributed-Memory Triangle Counting and LCC wi...

引用

36th ieee international parallel and distributed processing symposium (ieee IPDPS)

作者： Strausz, Andras Vella, Flavio Di Girolamo, Salvatore Besta, Maciej Hoefler, Torsten Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland Univ Trento Dept Engn & Comp Sci Trento Italy

ISBN: (纸本)9781665481069

Triangle count and local clustering coefficient are two core metrics for graph analysis. They find broad application in analyses such as community detection and link recommendation. To cope with the computational and memory demands that stem from the size of today's graph datasets, distributed-memory algorithms have to be developed. Current state-of-the-art solutions suffer from synchronization overheads or expensive pre-computations needed to distribute the graph, achieving limited scaling capabilities. We propose a fully asynchronous implementation for triangle counting and local clustering coefficient based on 1D partitioning, using remote memory accesses for transferring data and avoid synchronization. Additionally, we show how these algorithms present data reuse on remote memory accesses and how the overall communication time can be improved by caching these accesses. Finally, we extend CLaMPI, a software-layer caching system for MPI RMA, to include application-specific scores for cached entries and influence the eviction procedure to improve caching efficiency. Our results show improvements on shared memory, and we achieve 14x speedup from 4 to 64 nodes for the LiveJournal1 graph on distributed memory. Moreover, we demonstrate how caching remote accesses reduces total running time by up to 73% with respect to a non-cached version. Finally, we compare our implementation to TriC, the 2020 graph champion paper, and achieve up to 100x faster results for scale-free graphs.

关键词： asynchronous computing caching distributed computing local clustering coefficient RDMA triangle counting

来源：评论

学校读者我要写书评

暂无评论

parallel quantum circuit extraction from MBQC-patterns

Parallel quantum circuit extraction from MBQC-patterns

引用

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

作者： Quanz, Marcel Staudacher, Korbinian Fuerlinger, Karl Ludwig Maximilians Univ Munchen Munich Germany Ludwig Maximilians Univ Munchen MNM Team Munich Germany

ISBN: (纸本)9798350364613;9798350364606

In the model of measurement-based quantum computing (MBQC), computations are performed via sequential measurements on a highly entangled graph state. MBQC is a natural model for photonic quantum computing and has been shown to be useful for tasks like optimization and verification of general quantum computations. Therefore, it is often necessary to translate between MBQC and the predominantly used quantum circuit model in a fast and reliable way. While there are algorithms with linear complexity to extract quantum circuits from measurement patterns using additional ancilla qubits, efficient ancilla-free extraction has shown to be more costly. We develop strategies to parallelize an existing extraction algorithm based on ZX-calculus by exploiting the graph structure of measurement patterns and evaluate the performance on patterns obtained from a benchmark set of quantum circuits. Our results suggest that possible parallelization speedups are closely related to the graph structure of a pattern.

关键词： MBQC ZX-calculus gflow

来源：评论

学校读者我要写书评

暂无评论

Shared-Memory parallel Algorithms for Community Detection in Dynamic Graphs

Shared-Memory Parallel Algorithms for Community Detection in...

引用

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

作者： Sahu, Subhajit Kothapalli, Kishore Banerjee, Dip Sankar Int Inst Informat Technol Hyderabad Hyderabad 500032 India Indian Inst Technol Jodhpur Surpura Bypass Rd Karwar 342030 Rajasthan India

ISBN: (纸本)9798350364613;9798350364606

Community detection is the problem of identifying natural divisions in networks. A relevant challenge in this problem is to find communities on rapidly evolving graphs. In this paper, we present our parallel Dynamic Frontier (DF) approach. Given a batch update of edge deletions or insertions, this approach incrementally identifies an approximate set of affected vertices in the graph with minimal overhead. We apply this approach to both Louvain, a high quality, and Label Propagation Algorithm (LPA), a fast static community detection algorithm. Our approach achieves a mean speedup of 7.3x and 6.7x, when applied to Louvain and LPA respectively, compared to our parallel and optimized implementation of Delta-screening, a recently proposed state-of-the-art approach. Finally, we show how to combine Louvain and LPA with the DF approach to arrive at a hybrid algorithm. This algorithm produces high-quality communities while providing a speedup of 2.0 x on top of DF-based Louvain.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Scheduling of Moldable Streaming Computations for the Edge-Cloud Continuum 9

Energy-Efficient Scheduling of Moldable Streaming Computatio...

引用

9th ieee international Conference on Fog and Mobile Edge Computing (FMEC)

作者： Khosravi, Sajad Kessler, Christoph Litzinger, Sebastian Keller, Joerg Linkoping Univ Linkoping Sweden Fernuniv Hagen Germany

ISBN: (纸本)9798350366495;9798350366488

We consider the problem of cost-effectively mapping a swarm of soft real-time stream processing applications with moldable-parallel tasks to multicore resources in the device-edge-cloud continuum, consisting of mobile devices, edge resources and cloud resources. We leverage flexibility from different parallelization degrees and frequency levels (DVFS) for the tasks, keeping application throughput constraints and communication bandwidth limitations while minimizing overall cost (including device/edge resource energy and cloud resource renting). We present two offline algorithmic solutions with a global view of the environment: an integer linear program (ILP) extending the crown scheduling approach for multi-layer distributed systems and a greedy heuristic algorithm. Our experimental evaluation for several real-world and synthetic scenarios shows that the time required for solving the scheduling problem to cost-optimality by the ILP is feasible for nontrivial scenarios. The heuristic achieves about 12% worse cost efficiency on average, yet operates much faster (by 1-2 orders of magnitude), allowing to scale up the problem size more than the ILP approach.

关键词： distributed stream processing Mapping Scheduling Moldable tasks Edge-Cloud continuum Energy efficiency DVFS

来源：评论

学校读者我要写书评

暂无评论

Disaggregated GPU Acceleration for Serverless applications

Disaggregated GPU Acceleration for Serverless Applications

引用

ieee international parallel and distributed processing symposium (IPDPS)

作者： Fingler, Henrique Zhu, Zhiting Yoon, Esther Jia, Zhipeng Witchel, Emmett Rossbach, Christopher J. Univ Texas Austin Austin TX 78712 USA

Serverless platforms have been attracting applications from traditional platforms because infrastructure management responsibilities are shifted from users to providers. Many applications well-suited to serverless environments could leverage GPU acceleration to enhance their performance. Unfortunately, current serverless platforms do not expose GPUs to serverless applications. We present DGSF, a platform that enables serverless applications to access virtualized GPUs by disaggregating resources. DGSF facilitates provisioning and addresses utilization challenges by allowing a small pool of remote physical GPUs to serve potentially many serverless applications concurrently. With DGSF, the cloud provider decouples GPU resources from others, facilitating resource consolidation. In this article, we describe how DGSF tackles GPU disaggregation challenges using API remoting virtualization, and optimizations, which include hiding communication latency and pooling resources. Our evaluation shows that these API remoting optimizations can lower the runtime of an application by up to 50% relative to an unoptimized API remoting scheme. Because these optimizations aggressively remove the latency of GPU runtime and object management from the application's critical path, they can enable applications executing on DGSF to have lower end-to-end time than when running on a GPU natively. Through consolidation, DGSF can lower queueing delays of application that use GPUs by up to 53%. We also demonstrate DGSF's flexibility by augmenting applications on AWS Lambda with GPU support.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

HRaft: Adaptive Erasure Coded Data Maintenance for Consensus in distributed Networks 36

HRaft: Adaptive Erasure Coded Data Maintenance for Consensus...

引用

36th ieee international parallel and distributed processing symposium (ieee IPDPS)

作者： Jia, Yulei Xu, Guangping Sung, Chi Wan Mostafa, Salwa Wu, Yulei Tianjin Univ Technol Sch Comp Sci & Engn Tianjin Peoples R China Tianjin Key Lab Intelligence Comp & Novel Softwar Tianjin Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China Univ Exeter Coll Engn Math & Phys Sci Exeter Devon England

ISBN: (纸本)9781665481069

distributed data services usually rely on consensus protocols like Paxos and Raft to provide fault-tolerance and data consistency across global and local-distributed data centers. Erasure coding replication has appealing storage and network cost saving compared with full copy replication, which helps consensus protocols achieve low latency, high fault tolerance, and high throughput for data access. Applying erasure coding in consensus protocols directly will degrade the liveness level when the number of failure servers reaches a certain level. To address the challenge, CRaft just stores full copy replication instead of erasure coding replication when the number of failed servers reaches a certain threshold. In such situation, CRaft will be downgraded sharply to the same storage and network costs as Raft. To overcome the shortcoming of CRaft, we propose a protocol, called HRaft, which can adapt the placement of data blocks in order to always have enough blocks to recover the stored value when servers fail. By replenishing some coded blocks in healthy servers instead of full copy replication, it can avoid switching to the full replication when a certain threshold on the number of failures is reached. We designed and implemented a key-value (KV) storage prototype to validate the proposed protocol and evaluate its performance. The experimental results show HRaft can significantly reduce storage and network costs and improve write performance while keeping the liveness level compared to CRaft.

关键词： Erasure coding Consensus protocol Raft Paxos Fault tolerance Network storage

来源：评论

学校读者我要写书评

暂无评论

Dynamic management of processes and communicators in malleable MPI applications 29

Dynamic management of processes and communicators in malleab...

引用

29th ieee international Conference on parallel and distributed Systems, ICPADS 2023

作者： Munnoz, Javier Fernandez Cascajo Garcia, Alberto Perez, Jesus Carretero Universidad Carlos Iii de Madrid Computer Science Department Madrid Spain

ISBN: (纸本)9798350330717

A malleable application is defined as one that can increase or decrease its resources dynamically based on workload variations. These applications often leverage a job manager to handle the resources. The MPI standard incorporates strategies to increase the number of processes connected to a running application. However, it does not clarify how to use these same features to reduce said processes. This paper presents a strategy compatible with the latest version of the MPI standard to develop malleable MPI applications. It allows the addition and removal of resources at the computing node level in a discretionary manner. The results obtained from the evaluation show that the proposed strategy has acceptable performance and scalability for the functionality it provides. © 2023 ieee.

关键词： HPC resource management Malleability MPI Reconfigurable applications

来源：评论

学校读者我要写书评

暂无评论

Challenges of Data Consistency in High-Concurrency Environments: Algorithms and Implementation for the Electric Power Industrial Internet Platform 5

Challenges of Data Consistency in High-Concurrency Environme...

引用

5th international Conference on Information Science, parallel and distributed Systems, ISPDS 2024

作者： Zhou, Zhongran Wang, Lili Song, Chunhe Shen, Yaowei Li, Mafeng Liu, Sai Nari Information & Communication Technology Co.Ltd Nanjing China Chinese Academy of Sciences Shenyang Institute of Automation 110006 China Liaoning University School of Information Technology Shenyang China

ISBN: (纸本)9798350352719

With the rapid development of the Electric Power Industrial Internet, challenges in high-concurrency data processing have become increasingly prominent, particularly issues related to data consistency, which directly affect the stability and reliability of the system. This study addresses the distributed data consistency problems in the Electric Power Industrial Internet platform, proposing an optimized algorithmic framework designed specifically for high concurrency and dynamic environments to enhance the response speed and data processing capabilities of the power system. This paper first analyzes common data consistency challenges in high-concurrency environments within the power system, including data synchronization delays, complexity in fault recovery, and resource allocation issues. Based on these challenges, we introduce and optimize distributed data consistency algorithms, combined with load balancing and resource optimization techniques, significantly reducing communication costs and enhancing processing efficiency. Additionally, the paper designs a robust fault tolerance mechanism to ensure data integrity and consistency in the event of node failures. Through simulation experiments, we have confirmed the effectiveness of the proposed algorithms in terms of processing speed, system response time, and fault recovery, significantly optimizing the performance of the Electric Power Industrial Internet platform. This research not only enhances the robustness of the power system in facing high-concurrency data challenges but also provides important technical support and a theoretical basis for future research and applications in the Electric Power Industrial Internet. © 2024 ieee.

关键词： Data Consistency distributed Algorithms Electric Power Industrial Internet High-Concurrency processing System Optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：