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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是681-690 订阅

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

详细简洁

排序：

DataVinci: Proactive Data Placement for Ad-Hoc computing

DataVinci: Proactive Data Placement for Ad-Hoc Computing

引用

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

作者： Breitbach, Martin Edinger, Janick Schaefer, Dominik Becker, Christian Univ Mannheim Mannheim Germany Univ Hamburg Hamburg Germany

ISBN: (纸本)9781665435772

Mobile ad-hoc computing enables applications to offload computationally intensive tasks to end-user devices in proximity. Many state-of-the-art applications such as face recognition, machine learning, or computer vision require large amounts of input data that is shared among multiple tasks. In these use cases, offloading the workload to remote devices becomes more time-consuming and, consequently, less attractive due to the required data transfer. As a solution, a proactive distribution of the data files on potential computational resource providers eliminates the need for ad-hoc data transfers. The characteristics of ad-hoc computing environments necessitate non-trivial data and task placement strategies. In this paper, we propose DataVinci - a data and task scheduler for mobile ad-hoc computing environments. DataVinci determines the number of copies for each data file (replicas), places these replicas proactively on remote devices, and schedules tasks based on the previously created data distribution. It continuously adjusts the number of replicas and balances the trade-off between execution latencies and data transfer overhead. In a large-scale study, we show the effectiveness of DataVinci, which reduces the average task execution time by more than 60 percent compared to an approach without proactive data placement, while keeping the amount of transferred data constant.

关键词： data placement task scheduling ad-hoc computing Tasklet system

来源：评论

学校读者我要写书评

暂无评论

Teaching parallel Algorithms Using the Binary-Forking Model

Teaching Parallel Algorithms Using the Binary-Forking Model

引用

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

作者： Guy E. Blelloch Yan Gu Yihan Sun Carnegie Mellon University University of California Riverside

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

In this paper, we share our experience in teaching parallel algorithms with the binary-forking model. With hardware advances, multicore computers are now ubiquitous. This has created a substantial demand in both research and industry to harness the capabilities of parallel computing. It is thus important to incorporate parallelism in computer science education, especially in the early stages of the curriculum. However, it is commonly believed that understanding and using parallelism requires a deep understanding of computer systems and architecture, which complicates introducing parallelism to young students and non-experts. We propose to use the binary-forking model in teaching parallel algorithms, proposed by our previous research work. This model is meant to capture the performance of algorithms on modern multicore shared-memory machines, which is a simple abstraction to isolate algorithm design ideas with system-level details. The abstraction allows for simple analysis based on the work-span model in theory, and can be directly implemented as parallel programs in practice. In this paper, we briefly overview some basic primitives in this model, and provide a list of algorithms that we believe are well-suited in parallel algorithm courses.

关键词： Computers Industries distributed processing Multicore processing Computational modeling Conferences Education

来源：评论

学校读者我要写书评

暂无评论

Engineering Massively parallel MST Algorithms

Engineering Massively Parallel MST Algorithms

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Peter Sanders Matthias Schimek Institute of Theoretical Informatics Karlsruhe Institute of Technology Karlsruhe Germany

We develop and extensively evaluate highly scalable distributed-memory algorithms for computing minimum spanning trees (MSTs). At the heart of our solutions is a scalable variant of Borůvka’s algorithm. For partitioned graphs with many local edges we improve this with an effective form of contracting local parts of the graph during a preprocessing step. We also adapt the filtering concept of the best practical sequential algorithm to develop a massively parallel Filter-Borůvka algorithm that is very useful for graphs with poor locality and high average degree. Our experiments indicate that our algorithms scale well up to at least 65 536 cores and are up to 800 times faster than previous distributed MST algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Collective Communication Acceleration Architecture for Reduce Operation with Long Operands Based on Efficient Data Access and Reconfigurable On-Chip Buffer

Collective Communication Acceleration Architecture for Reduc...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Jinbo Xu Zhengbin Pang Yi Dai School of Computer National University of Defense Technology Changsha P. R. China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

The Reduce operation with long operands is widely used in high-performance computing and AI(Artificial Intelligence) computing. A hardware acceleration architecture for Reduce operation with long operands is designed and implemented in FPGA. Flow control of the accelerator is achieved by using a dedicated hardware trigger mechanism. Based on DMA(Direct Memory Access), an efficient data access method is proposed between host memory and the accelerator. A reconfigurable on-chip buffer structure is designed to achieve flexible and efficient buffering of a large number of operands. Calculations are directly performed on the accelerator with on-chip ALU(Arithmetic Logic Unit) arrays to reduce the communications between the host and NIC(Network Interface Card). Experimental results show that this work has a significant acceleration effect compared to the non-offloading method and the current offloading method in "Tianhe" interconnection.

关键词： Structural rings Flow production systems High performance computing Memory management Writing Dynamic scheduling System-on-chip Logic Logic arrays Hardware acceleration

来源：评论

学校读者我要写书评

暂无评论

Research on Graph Injection Attack Method Based on Multi Objective Feature Optimization in the Electric Power Field

Research on Graph Injection Attack Method Based on Multi Obj...

引用

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

作者： Runyang Ji State Grid Nantong Power Supply Company Nantong Jiangsu

ISBN: (数字)9798350349658

ISBN: (纸本)9798350349665

In the field of electricity, in response to the problem of graph neural networks having both significant performance and poor robustness, this may lead to poor recommendation performance or affect social evaluation, posing a threat to the integrity and security of social networks. Therefore, this article proposes a graph injection attack method based on multi-objective feature optimization, which selects multiple target nodes with similar features through clustering target selection strategy and directly connects the injection nodes to the target nodes, ensuring the effective propagation of disturbance information. This operation can enable the disturbance information attached to the injection node to propagate more directly to each target node. For the generation of perturbation features, the selected target node is used to aggregate its own information and neighboring node information to generate it. In order to enhance the perturbation ability of perturbation features, a zero order random coordinate descent algorithm is applied to optimize the generated features for discrete feature maps.

关键词： Social networking (online) Perturbation methods Electricity Clustering algorithms parallel processing Robustness Graph neural networks Power systems Security Optimization

来源：评论

学校读者我要写书评

暂无评论

Low latency PBFT parallel consensus for IoT blockchain platform

Low latency PBFT parallel consensus for IoT blockchain platf...

引用

international symposium on Object-Oriented Real-Time distributed computing

作者： Rabeb Ben Othmen Wassim Abbessi Sofiane Ouni Wafa Badreddine Gilles Dequen CRISTAL Lab RAMSIS Team (ENSI) University of Manouba Manouba Tunisia Laboratoire Modelisation Information Systemes (MIS) Université de Picardie Jules Verne Amiens France

ISBN: (数字)9798350371284

ISBN: (纸本)9798350371291

With the success of blockchains for providing a high security platform for distributed systems, new challenges are presented in relation with the deployment of this technology for IoT applications with time constraints. In this paper, we present a new lightweight blockchain platform that is scalable to hold a large number of transactions and with acceptable latency times. We have designed a new rapid consensus algorithm that improves PBFT to apply it in a random cluster with a small number of Miners. This will enable multiple consensus on different clusters to be executed in parallel to reduce the complexity of PBFT, have acceptable latency and increase the scalability. The evaluations carried out on our proposal by comparing it with other pipeline PBFT improvement approaches, show that our approach has better latency that is still accessible even with a high load of transactions.

关键词： Scalability Pipelines Real-time systems Blockchains Proposals Internet of Things Security

来源：评论

学校读者我要写书评

暂无评论

Conditionally Optimal parallel Coloring of Forests 37

Conditionally Optimal Parallel Coloring of Forests

引用

37th international symposium on distributed computing, DISC 2023

作者： Grunau, Christoph Latypov, Rustam Maus, Yannic Pai, Shreyas Uitto, Jara ETH Zürich Switzerland Aalto University Finland TU Graz Austria

ISBN: (纸本)9783959773010

We show the first conditionally optimal deterministic algorithm for 3-coloring forests in the low-space massively parallel computation (MPC) model. Our algorithm runs in O(log log n) rounds and uses optimal global space. The best previous algorithm requires 4 colors [Ghaffari, Grunau, Jin, DISC'20] and is randomized, while our algorithm are inherently deterministic. Our main technical contribution is an O(log log n)-round algorithm to compute a partition of the forest into O(log n) ordered layers such that every node has at most two neighbors in the same or higher layers. Similar decompositions are often used in the area and we believe that this result is of independent interest. Our results also immediately yield conditionally optimal deterministic algorithms for maximal independent set and maximal matching for forests, matching the state of the art [Giliberti, Fischer, Grunau, SPAA'23]. In contrast to their solution, our algorithms are not based on derandomization, and are arguably simpler. © Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, and Jara Uitto;licensed under Creative Commons License CC-BY 4.0.

关键词： coloring forests massively parallel computation optimal

来源：评论

学校读者我要写书评

暂无评论

Integration Framework for Online Thread Throttling with Thread and Page Mapping on NUMA Systems

Integration Framework for Online Thread Throttling with Thre...

引用

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

作者： Janaina Schwarzrock Arthur F. Lorenzon Samuel Xavier de Souza Antonio Carlos S. Beck Federal University of Rio Grande do Sul Brazil Federal University of Rio Grande do Norte Brazil

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

Non-Uniform Memory Access (NUMA) systems are preva-lent in HPC, where optimal thread and page placement are crucial for enhancing performance and minimizing energy us-age [1]–[3]. Moreover, considering that NUMA systems have hardware support for a large number of hardware threads and many parallel applications have limited scalability, throttling the number of active threads may bring further improvements [4]–[6]. However, the optimal configuration (thread mapping, page mapping, number of threads) for energy and performance, quantified by the Energy-Delay Product (EDP), varies with the system hardware, application, input set, and even during execution [1], [4], [6], [7]. Only online optimization approaches can easily adapt to these changes.

关键词： Concurrent computing distributed processing Instruction sets Scalability Conferences Hardware Optimization

来源：评论

学校读者我要写书评

暂无评论

PNS Lock: A Portable NUMA-Aware Lock with a Standard Interface

PNS Lock: A Portable NUMA-Aware Lock with a Standard Interfa...

引用

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

作者： Brahmaiah Gandham Praveen Alapati Computer Science and Engineering Ecole Centrale School of Engineering Mahindra University Hyderabad India

ISBN: (数字)9798350349658

ISBN: (纸本)9798350349665

In shared memory programming, there is a need for synchronization primitives that are suitable for modern hardware to achieve high performance and reduce contention. This paper introduces a novel lock with a standard interface, namely, the PNS Lock. It is a lock for Non-Uniform Memory Access (NUMA) architectures and uses one queue for each NUMA node. PNS lock uses atomic operation for lock handovers between NUMA nodes. This design helps to get better performance by minimizing cross-node communication and contention. PNS lock intelligently adapts to the underlying system topology. This paper discusses the design of a PNS lock and compares it's performance by considering the state-of-the-art synchronization objects. PNS lock also provides a standard interface and ensures seamless integration with existing multi-threaded applications. From the experimental evaluation, it is observed that PNS lock helps to enhance the performance and increases the cache hit rate. This synchronization primitive, PNS lock is a great tool for the developers in NUMA environments.

关键词： Memory architecture Handover Programming parallel processing Data structures Topology Synchronization Servers Standards Optimization

来源：评论

学校读者我要写书评

暂无评论

Implementing Censorship-Resistant Trusted Email Using Blockchain Technology

Implementing Censorship-Resistant Trusted Email Using Blockc...

引用

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

作者： Yasushi Shinjo Taiki Watanabe Yi Zhou Kazuki Takarada Masahiro Nakamura Department of Computer Science University of Tsukuba Tsukuba Ibaraki Japan

ISBN: (数字)9798350349658

ISBN: (纸本)9798350349665

Currently, widely used email based on the Simple Mail Transfer Protocol (SMTP) is vulnerable to malware attacks because digital signatures are not widely adopted. Huge email service providers have immense authority to censor, monitor, and suspend email accounts. To solve these problems, this paper describes the implementation of trusted email using the blockchain technology Ethereum. In the proposed method, the addresses of blockchain wallets are used as email addresses. The host sending and receiving email registers a local surrogate user that corresponds one-to-one with each wallet address. Users and application developers can use existing programs to send and receive emails to / from local surrogate users and to exchange emails without the cumbersome digital signature procedures. This paper describes an inquiry application using the implemented trusted email. In this inquiry application, unlike conventional web applications, form submission and response reply are completed only by email.

关键词： Protocols Transfer functions parallel processing Malware Electronic mail Blockchains Registers Digital signatures Monitoring Postal services

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 65 66 67 68 69 70 71 72 73 74 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：