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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,173 篇 会议
1,626 篇 期刊文献

馆藏范围

5,799 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,775 篇 工学
- 5,595 篇 计算机科学与技术...
- 3,901 篇 软件工程
- 671 篇 信息与通信工程
- 500 篇 电气工程
- 499 篇 电子科学与技术（可...
- 398 篇 控制科学与工程
- 98 篇 光学工程
- 90 篇 力学（可授工学、理...
- 77 篇 机械工程
- 64 篇 生物医学工程（可授...
- 44 篇 仪器科学与技术
- 44 篇 土木工程
- 42 篇 生物工程
- 37 篇 航空宇航科学与技...
- 35 篇 化学工程与技术
- 30 篇 材料科学与工程（可...
- 26 篇 建筑学
2,498 篇 理学
- 2,226 篇 数学
- 297 篇 物理学
- 273 篇 统计学（可授理学、...
- 56 篇 生物学
- 47 篇 化学
- 46 篇 系统科学
647 篇 管理学
- 488 篇 管理科学与工程(可...
- 344 篇 工商管理
- 176 篇 图书情报与档案管...
74 篇 经济学
- 73 篇 应用经济学
45 篇 医学
- 42 篇 临床医学
31 篇 教育学
- 30 篇 教育学
27 篇 法学
- 25 篇 社会学
6 篇 军事学
5 篇 农学
1 篇 文学

主题

5,799 篇 parallel process...
4 篇 computer simulat...
4 篇 mathematical mod...
4 篇 response time (c...
3 篇 computer systems...
3 篇 algorithms
3 篇 efficiency
3 篇 application prog...
3 篇 image processing
3 篇 interconnection ...
2 篇 queue
2 篇 computational fl...
2 篇 computer hardwar...
2 篇 fault tolerance
2 篇 computer archite...
2 篇 computer program...
2 篇 parallel program...
2 篇 iterative method...
2 篇 c++ (programming...
2 篇 optimization

机构

25 篇 georgia inst of ...
21 篇 universitat poli...
19 篇 univ of californ...
18 篇 purdue univ west...
17 篇 univ of illinois...
16 篇 univ of tokyo
16 篇 univ of houston ...
15 篇 massachusetts in...
15 篇 pennsylvania sta...
14 篇 syracuse univ sy...
14 篇 univ of southern...
13 篇 univ of maryland...
13 篇 univ of illinois...
13 篇 northwestern uni...
13 篇 ohio state univ ...
12 篇 california inst ...
12 篇 seoul natl univ ...
12 篇 ibm t.j. watson ...
12 篇 stanford univ st...
11 篇 new jersey inst ...

作者

17 篇 siegel howard ja...
15 篇 choudhary alok
14 篇 panda dhabaleswa...
14 篇 gao guang r.
14 篇 yang chao-tung
13 篇 das sajal k.
11 篇 wilsey philip a.
11 篇 saltz joel
11 篇 sadayappan p.
10 篇 parhami behrooz
10 篇 sohn andrew
10 篇 li keqin
10 篇 feitelson dror g...
10 篇 akl selim g.
10 篇 gonzalez antonio
9 篇 boku taisuke
9 篇 sterling thomas
9 篇 prasanna viktor ...
9 篇 valero mateo
9 篇 wolf felix

语言

5,430 篇 英文
258 篇 其他
51 篇 中文
41 篇 俄文
15 篇 日文
2 篇 德文
2 篇 法文
1 篇 波兰文
1 篇 乌克兰文

检索条件"主题词=Parallel Processing Systems"

共 5799 条记录，以下是11-20 订阅

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

详细简洁

排序：

Dynamic Distributed Shared Memory: When&How? 12

Dynamic Distributed Shared Memory: When&How?

引用

12th Workshop on Principles and Practice of Consistency for Distributed Data, PaPoC 2025

作者： Georgiou, Chryssis Nicolaou, Nicolas Trigeorgi, Andria Department of Computer Science University of Cyprus Nicosia Cyprus Algolysis Ltd Limassol Cyprus Algolysis Ltd University of Cyprus Nicosia Cyprus

ISBN: (纸本)9798400715587

Maintaining reliability and efficiency in dynamic distributed systems is challenging, especially with changing networked nodes due to workload shifts, network fluctuations, or system failures. Implementing a dynamic Distributed Shared Memory (DSM) service is not an exception. In DSM, a set of nodes (servers) maintain copies of memory data, and clients access the data by sending messages to these servers. The main challenge is ensuring system's reliability and performance when the set of those servers may change over *** dynamic DSM has been widely studied, the majority of the solutions oversee a critical aspect: when changes in the system are necessary and how is it best to modify the server set. This work focuses on developing strategies for when and how to reconfigure the set of servers in a DSM to preserve performance and longevity of the service. To identify when a reconfiguration is needed, we detect server anomalies using metrics collected through system monitoring tools (e.g. Prometheus) and two different approaches: (i) threshold-based detection, and (ii) machine learning (ML) models. The outcome of the detection is then fed to reconfiguration strategies that determine the best set of servers that will benefit the system's performance. © 2025 Copyright is held by the owner/author(s).

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Towards Optimizing Cost and Performance for parallel Workloads in Cloud Computing 15

Towards Optimizing Cost and Performance for Parallel Workloa...

引用

15th International Conference on Cloud Computing and Services Science, CLOSER 2025

作者： Maas, William Rossi, Fábio Diniz Luizelli, Marcelo C. Navaux, Philippe O.A. Lorenzon, Arthur F. Institute of Informatics Federal University of Rio Grande do Sul Brazil Federal Institute Farroupilha Campus Alegrete Brazil Federal University of Pampa Campus Alegrete Brazil

ISBN: (纸本)9789897587474

The growing popularity of data-intensive applications in cloud computing necessitates a cost-effective approach to harnessing distributed processing capabilities. However, the wide variety of instance types and configurations available can lead to substantial costs if not selected based on the parallel workload requirements, such as CPU and memory usage and thread scalability. This situation underscores the need for scalable and economical infrastructure that effectively balances parallel workloads’ performance and expenses. To tackle this issue, this paper comprehensively analyzes performance, costs, and trade-offs across 18 parallel workloads utilizing 52 high-performance computing (HPC) optimized instances from three leading cloud providers. Our findings reveal that no single instance type can simultaneously offer the best performance and the lowest costs across all workloads. Instances that excel in performance do not always provide the best cost efficiency, while the most affordable options often struggle to deliver adequate performance. Moreover, we demonstrate that by customizing instance selection to meet the specific needs of each workload, users can achieve up to 81.2% higher performance and reduce costs by 95.5% compared to using a single instance type for every workload. Copyright © 2025 by SCITEPRESS - Science and Technology Publications, Lda.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Delinquent Loop Pre-execution Using Predicated Helper Threads 31

Delinquent Loop Pre-execution Using Predicated Helper Thread...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Seshadri, Anirudh Rotenberg, Eric North Carolina State University Department of Electrical and Computer Engineering United States

ISBN: (纸本)9798331506476

Branch pre-execution targets delinquent branches that are not predictable by conventional branch predictors. Helper threads attempt to resolve branches ahead of the main thread. Pre-executed branch outcomes are communicated to the main thread's fetch unit via a global branch queue or local branch queues (one per branch PC). Two key challenges are discussed in this paper. 1) Handling a delinquent branch b2 that is control-dependent on another delinquent branch b1. Prior works that include both branches resort to branch prediction of b1 in the helper thread to determine whether or not to pre-execute b2. But b1 is hard-to-predict and the misprediction bottleneck merely shifts from the main thread to the helper thread. 2) Handling a store instruction that both influences a delinquent branch and is control-dependent on it. We propose predicated helper threads (Phelps) to address these challenges. Phelps constructs a helper thread for each inner loop containing delinquent branches. All delinquent branches, even control-dependent ones (b2), are unconditionally pre-executed in each loop iteration. Per-branch queues are managed in lockstep based on loop iterations, allowing the helper thread to deposit outcomes for both b1 and b2 each iteration and the main thread to consume or ignore b2 outcomes in the correct sequence dictated by b1. The helper thread also retains influential stores for dynamic disambiguation and store-load forwarding. Any such store that is control-dependent on a delinquent branch is predicated on the branch's outcome, which is necessary because the helper thread no longer has control-flow (except for the loop branch). Phelps also features dual decoupled helper threads for outer-inner loop pairs, for effective branch pre-execution when the inner loop has a short and unpredictable trip count. © 2025 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A Comparative Evaluation of Zero Knowledge Proof Techniques 10

A Comparative Evaluation of Zero Knowledge Proof Techniques

引用

10th International Conference on Internet of Things, Big Data and Security, IoTBDS 2025

作者： Rostamkolaei Motlagh, Seyed Mohsen Pahl, Claus Barzegar, Hamid R. El Ioini, Nabil Free University of Bozen-Bolzano Bolzano39100 Italy University of Nottingham Semenyih43500 Malaysia

ISBN: (纸本)9789897587504

Common to many distributed systems such as the Internet-of-Things (IoT) is decentralisation, often with a growing number of devices with diverse computational capabilities and security requirements. If integrated into critical applications, ensuring secure communication and data integrity is critical. In particular, privacy and security concerns are growing with the rise of these architectures. Zero-Knowledge Proof (ZKP) techniques are solutions to improve security without compromising on privacy. While the advantages of ZKP techniques are well-documented, it is important to consider the inherent limitations of these distributed environments, such as restricted processing power, memory capacity, and energy constraints, when aiming to solve security concerns. Here, we select two prominent ZKP techniques, Bulletproof and zk-STARK, and experimentally compare a number of their variants for a set of architecture-specific assessment criteria. Copyright © 2025 by SCITEPRESS - Science and Technology Publications, Lda.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A parallel processing System for Camera Data Checking on a Multi-Core CPU 7

A Parallel Processing System for Camera Data Checking on a M...

引用

7th IEEE International Conference on Computer and Communication Engineering Technology, CCET 2024

作者： Wang, Hongmin Xu, Yun Li, Linpeng Wang, Zhikai Li, Xingjian Song, Liguo Huang, Pu Zhou, Ziwei Wen, Gaojin Beijing Institute of Space Mechanics and Electricity Remote Sensing Laboratory Beijing China Laboratory of Computational Physics Beijing China Beijing Institute of Space Mechanics and Electricity Laboratory of Optical Remote Sense Beijing China

ISBN: (纸本)9798350355673

This paper introduces a parallel data checking system for image capture device. The system adopts a very efficient multi-threading processing software system architecture, which includes main control unit, user interface, data input/out, single frame data checking and multi-frame data checking components. Single frame data checking unit is composed of a thread scheduling unit and a thread pool. A thread scheduling algorithm is designed and implemented, which ensures that each core of the multi-core CPU can efficiently participate in data checking tasks. The efficiency and usefulness of the parallel processing system are verified by multiple image data checking tasks for space based camera. © 2024 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Spherical Easel Remote Script Execution 3rd

Spherical Easel Remote Script Execution

引用

3rd International Conference on Advances in Computing Research, ACR 2025

作者： Dulimarta, Hans Dickinson, William College of Computing Grand Valley State University Grand RapidsMI United States Department of Mathematics Grand Valley State University Grand RapidsMI United States

ISBN: (纸本)9783031876462

Spherical Easel (https://***) is a free Vue-based application for researching, teaching, and learning spherical geometry written in Typescript. It offers an abundant suite of tools that allow users to dynamically explore the geometry of the sphere by drawing and controlling the behavior of spherical objects including points, lines, circles, and parametric curves. The authors have created an open-source code base that innovatively combines several design patterns, global data structures, and cloud based storage. The target audience of Spherical Easel includes secondary and post-secondary students and teachers, professors, and researchers. In addition to using Spherical Easel to investigate geometric theorems and constructions on the surface of a unit sphere, the authors also plan to enable its use in an interactive teaching and learning classroom setting. Within an interactive online session created by a teacher, students at remote locations can join the session using a browser, exchange messages with the teacher, and watch the teacher’s spherical construction being replicated in real-time on their own browser. Thereafter, each student can manipulate the construction as if it has been created locally. This paper focuses how to achieve this functionality and demonstrates how a clever use of the Command and Composite design patterns have made the implementation seamless without requiring major changes to the existing core architecture. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Optimal Algorithm parallel Computing Method for Geological Disaster Warning

Optimal Algorithm Parallel Computing Method for Geological D...

引用

International Conference on Smart Applications and Sustainability in the Artificial Intelligence of Things, SAS-AIoT 2024

作者： Wang, Yanjuan Geology and Jewelry Department Lanzhou Resources & Environment VOC-Tech University Gansu Lanzhou730021 China

ISBN: (纸本)9783031782756

Geological disasters pose a great threat to human society, so it is very important to issue geological disaster predictions to protect the safety of people's lives and properties. In recent years, researchers have begun to study the application of parallel computing methods in geological disaster predictions with the advancement of computing power. The preferred parallel computing method for geological disaster predictions was selected in this study, and the performance of the selected parallel computing method is evaluated in geological disaster predictions by comparing the computation time between the Bayesian network parallel computing method and the support vector machine(SVM) method. After comparison, we found the Bayesian network parallel computing-based geohazard early-warning method's computation time is shorter compared with the Support Vector Machine method. The method of Bayesian network parallel computing achieves faster computation speed based on optimizing algorithm complexity, optimizing parallel computing, and optimizing data processing efficiency. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic Checkpointing: Fault Tolerance in High-Performance Computing 3

Dynamic Checkpointing: Fault Tolerance in High-Performance C...

引用

3rd International Conference on Communication, Control, and Intelligent systems, CCIS 2024

作者： Bhowmik, Biswajit Verma, Tushar Dineshbhai, Navdeep Dadhania Reddy, Manideep Raya Vsrs Girish, K.K. National Institute of Technology Karnataka Maharshi Sushrut Cas Lab Brics Laboratory Dept. of Computer Science and Engineering Mangalore India National Institute of Technology Karnataka Maharshi Kanad Qc Lab Brics Laboratory Dept. of Computer Science and Engineering Mangalore India National Institute of Technology Karnataka Ishwarchandra Vidyasagar Ait Lab Brics Laboratory Dept. of Computer Science and Engineering Mangalore India

ISBN: (纸本)9798331528201

parallel computing has become a cornerstone of modern computational systems, enabling the rapid processing of complex tasks by utilizing multiple processors simultaneously. However, the efficiency and reliability of these systems can be significantly compromised by inherent challenges such as hardware failures, communication delays, and uneven workload distribution. These issues not only slow down computations but also threaten the dependability of applications reliant on parallel processing. To address these challenges, researchers have developed strategies like dynamic checkpointing and load balancing, which are crucial for enhancing fault tolerance and optimizing performance. Dynamic checkpointing periodically saves the computational state, allowing for recovery from failures without significant data loss, while load balancing ensures that tasks are evenly distributed across processors, preventing bottlenecks and underutilization of resources. By integrating these mechanisms, this paper proposes a robust framework that improves the reliability and efficiency of parallel systems, particularly in high-performance computing environments where the ability to handle large-scale data processing with minimal downtime is critical. © 2024 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Relevance-Based Multi-User Data Compression for Fronthaul Rate Reduction in Cell-Free Massive MIMO systems 14

Relevance-Based Multi-User Data Compression for Fronthaul Ra...

引用

14th International ITG Conference on systems, Communications and Coding, SCC 2025

作者： Danaee, Alireza Hassanpour, Shayan Wubben, Dirk Dekorsy, Armin University of Bremen Department of Communications Engineering Germany

ISBN: (纸本)9798331522896

In the Cell-Free massive Multiple-Input MultipleOutput (CF-mMIMO) systems, a large number of distributed users are simultaneously served by multiple Radio Access Points (RAPs). In the uplink, each RAP receives noisy observations from several users and must locally compress these signals before forwarding them to the corresponding Central processing Unit (CPU) via multiple fronthaul channels, each subject to a rate limitation. The challenge is to design the compressed signals at the RAPs such that the received signals at the CPU retain as much information as possible about the users (to be retrieved). To address this, we adopt compression techniques based on the Information Bottleneck (IB) principle to design local quantizers at the RAPs by ensuring an efficient balance between the informativity and compactness of the compressed signals. We discuss here two different compression schemes: one that processes the signals independently across fronthaul links and another that leverages the side information from previously retrieved signals at the CPU. By using side information, the latter generally provides a better tradeoff between the compression efficiency and performance, albeit with an increased complexity. Through numerical simulations, we demonstrate the effectiveness of both IB-based schemes compared to the conventional compression methods, showing their potential for improving fronthaul rate efficiency and overall system performance in typical digital transmission scenarios. © 2025 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

The General Modulus-Based Synchronous Multi-Splitting Iteration Models for H+-Matrices Linear Complementarity Issues 4

The General Modulus-Based Synchronous Multi-Splitting Iterat...

引用

4th International Conference on Digital Data processing, DDP 2024

作者： Qiufang, Xue Aili, Wang Xi'an University of Technology Xi'an710048 China

ISBN: (纸本)9798331515706

More studies have been conducted on the synchronous multi-splitting iteration technique to improve its suitability for linear complementarity issues in today's fast-paced multiprocessor parallel computing settings. A new, general modulus-based synchronous multi-splitting iteration technique (GMSM method) is introduced. This technique extends previous approaches and boasts outstanding parallel computing capabilities. The convergence of the new technique is examined, and the findings on convergence are presented across various scenarios. These findings support some previous related findings. © 2024 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：