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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
365 篇 期刊文献
33 册 图书
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

4,570 篇 工学
- 4,179 篇 计算机科学与技术...
- 2,156 篇 软件工程
- 849 篇 电气工程
- 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,632 篇 英文
31 篇 其他
21 篇 中文

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

共 9684 条记录，以下是501-510 订阅

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

详细简洁

排序：

SNOW Revisited: Understanding When Ideal READ Transactions Are Possible 35

SNOW Revisited: Understanding When Ideal READ Transactions A...

引用

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

作者： Konwar, Kishori M. Lloyd, Wyatt Lu, Haonan Lynch, Nancy MIT RLE 77 Massachusetts Ave Cambridge MA 02139 USA Princeton Univ Comp Sci Princeton NJ 08544 USA MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781665440660

READ transactions that read data distributed across servers dominate the workloads of real-world distributed storage systems. The SNOW Theorem [13] stated that ideal READ transactions that have optimal latency and the strongest guarantees-i.e., "SNOW" READ transactions-are impossible in one specific setting that requires three or more clients: at least two readers and one writer. However, it left many open questions. We close all of these open questions with new impossibility results and new algorithms. First, we prove rigorously the result from [13] saying that it is impossible to have a READ transactions system that satisfies SNOW properties with three or more clients. The insight we gained from this proof led to leasing out the implicit assumptions that are required to stale the results and also, resolving the open question regarding the possibility of SNOW with two clients. We show that it is possible to design an algorithm, where SNOW is possible in a multi-writer, single-reader (MWSR) setting when a client can send messages to other clients;on the other hand, we prove it is impossible to implement SNOW in a multi-writer, single-reader (MWSR) setting-which is more general than the two-client setting-when client-to-client communication is disallowed. We also correct the previous claim in [13] that incorrectly identified one existing system, Eiger [12], as supporting the strongest guarantees (SW) and whose read-only transactions had bounded latency. Thus, there were no previous algorithms that provided the strongest guarantees and had bounded latency. Finally, we introduce the first two algorithms to provide the strongest guarantees with bounded latency.

关键词： distributed transactions strict-serializability

来源：评论

学校读者我要写书评

暂无评论

A predictive approach for dynamic replication of operators in distributed stream processing systems 34

A predictive approach for dynamic replication of operators i...

引用

34th IEEE international symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： Wladdimiro, Daniel Arantes, Luciana Sens, Pierre Hidalgo, Nicolas Sorbonne Univ LIP6 CNRS INRIA Paris France Univ Diego Portales Santiago Chile

ISBN: (数字)9781665451550

ISBN: (纸本)9781665451550

Stream Processing systems (SPSs) can present significant fluctuation in input rate. To address this issue, some existing solutions propose reconfiguring the SPS by replicating its operators. However, such reconfiguration usually induces a high system downtime cost. Moreover, reconfiguration decisions are based only on resource utilization without balancing the load between replicas. We propose in this paper a predictive SPS that dynamically defines the necessary number of replicas of each operator based not only on the current resource utilization and input rate variation but also on the events that, due to the operator's overloading, could not be processed yet and are, thus, kept in the operator's queue. In addition, our SPS implements a load balancer that distributes incoming events more evenly among replicas of an operator. Our solution has been integrated into Storm. To avoid system reconfiguration downtime, our SPS preallocates a pool of replicas where each of them can be activated or deactivated based on per operator input load predictions. Using real traffic traces with different applications, we have conducted experiments on Google Cloud Platform (GCP), evaluating our SPS and comparing it with Storm and DABS-Storm.

关键词： Stream processing Adaptive SPS Predictive algorithm Replication Google Cloud Platform

来源：评论

学校读者我要写书评

暂无评论

FedJS: An Efficient Federated Learning Approach for the Internet of Vehicles

FedJS: An Efficient Federated Learning Approach for the Inte...

引用

Computer and Information Processing Technology (ISCIPT), international symposium on

作者： Tiancheng Ye School of Cyber Science and Engineering Nanjing University of Science and Technology Nanjing China

ISBN: (数字)9798350388404

ISBN: (纸本)9798350388411

Intelligent Transportation System (ITS) plays a crucial role in enhancing the safety of transportation systems, and the Internet of Vehicles (IoV) is a critical component of this effort. To ensure the data privacy of IoV, Federated Learning (FL) is commonly utilized. However, this approach may encounter the issues of high communication pressure at base stations and nonindependent and identically distributed (Non-IID) data. To address these challenges, we propose FedJS, which aims to alleviate the pressure on base stations by employing cluster training, and to mitigate the impact of Non-IID data through dynamic cluster assignment with improved inner-cluster vehicle communication. The experimental results demonstrate that FedJS performs well under Non-IID data, and the approach continues to exhibit stable performance even after accelerated cluster training.

关键词： Training Base stations Data privacy Federated learning Transportation distributed databases Safety

来源：评论

学校读者我要写书评

暂无评论

A Scalable Mapping Method for Elastic CGRAs

A Scalable Mapping Method for Elastic CGRAs

引用

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

作者： Makoto Saito Takuya Kojima Hideki Takase Hiroshi Nakamura Graduate School of Information Science and Technology The University of Tokyo Tokyo Japan

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

There is a growing expectation for accelerating high performance computing (HPC) applications using Coarse-Grained Reconfigurable Arrays (CGRAs). A large processing element (PE) array is necessary in such a scenario. When executing an application on CGRAs, instructions in the application kernel are mapped onto the PEs. The mapping time increases exponentially with the number of PEs and the instructions. Elastic CGRA is a type of CGRA where PEs can exchange data with each other asynchronously using a handshake protocol. Thanks to the scheduling of instructions performed by the hardware, Elastic CGRA possibly improves PE utilization compared to traditional CGRAs. In addition, it alleviates the complexity of the mapping problem since there is no need for explicit timeslot allocation when mapping time. However, given a large PE array suitable for HPC platforms, Elastic CGRA still suffers from a long mapping time. In order to accommodate as many application kernels into the PE array as possible within practical time, we propose a scalable mapping method exploiting data-level parallelism and thread-level parallelism. The proposed method divides the mapping process into two phases. In the first phase, the target application kernel is mapped in a conventional manner while changing the available PE array size, and then each mapping result is stored in a mapping database. The next phase replicates the mapping in the database and relocates them to fill the whole PE array. Instead of mapping pre-unrolled kernels, the proposed method efficiently prunes search space at the slight expense of optimality. The evaluation results demonstrate that the conventional approach can treat up to a 7x7 PE array within a practical time, whereas the proposed method extends the available array size to 80x80.

关键词： Phased arrays distributed processing Protocols databases Scalability High performance computing parallel processing

来源：评论

学校读者我要写书评

暂无评论

The Influence of Implementing Enterprise Resource Planning (ERP), Human Capital Management (HCM), and Supply Chain Management (SCM) to Enhance Company's Performance Effectiveness

The Influence of Implementing Enterprise Resource Planning (...

引用

parallel Computing and distributed systems (PCDS), international symposium on

作者： Chris Jericho Jansen Febrian Meiryani Accounting Department School of Accounting Bina Nusantara University Jakarta Indonesia

ISBN: (数字)9798350349658

ISBN: (纸本)9798350349665

The increasingly growing economic development in Indonesia has intensified competition among companies. This competitive environment can be explained by the rapid changes stemming from technological advancements, global political-economic stability, and the globalization of trade. As such, businesses need to address customer wants in a way that is both competitive and efficient and to produce goods and services that add value while keeping expenses to a minimum. This is to make sure that businesses make more money from the value of the expenses they incur in producing things for customers. Therefore, companies must exhibit strong performance to thrive in this competitive landscape. This study documents the implementation of Enterprise Resource Planning (ERP), Human Capital Management (HCM), and Supply Chain Management (SCM) that has shown to be an important strategy to increase the effectiveness of a company. ERP is becoming a key point for optimization for companies to increase their productivity so they can make products with better quality. Many of these companies have business management in carrying out product creation operations, namely Supply Chain Management (SCM). HCM is an important set of practices because by having good processes to hire the right people and manage the workforce effectively, companies can ensure that their productivity is optimized. The tool that is being used in this study to gather data is questionnaire. Analysis of the data will be carried out using SmartPLS. The survey questionnaire was distributed online and contained 5 points ranging from strongly disagree with a value of 1 to strongly agree with a value of 5.

关键词： Productivity Surveys Supply chain management Companies parallel processing Enterprise resource planning Stability analysis Raw materials Optimization Business

来源：评论

学校读者我要写书评

暂无评论

Elasticity in a Task-based Dataflow Runtime Through Inter-node GPU Work Stealing

Elasticity in a Task-based Dataflow Runtime Through Inter-no...

引用

IEEE/ACM international symposium on Cluster Computing and the Grid (CCGRID)

作者： Joseph John Josh Milthorpe National Computational Infrastructure Canberra Australia School of Computing Australian National University Canberra Australia Oak Ridge National Laboratory Oak Ridge TN USA

ISBN: (数字)9798350395662

ISBN: (纸本)9798350395679

Most contemporary HPC programming models assume an inelastic runtime in which the resources allocated to an application remain fixed throughout its execution. Conversely, elastic runtimes can expand and shrink resources based on availability and/or dynamic application requirements. In this paper, we implement elasticity for PaRSEC, a task-based dataflow runtime, using inter-node GPU work stealing. In addition to supporting elasticity, we demonstrate that inter-node GPU work stealing can enhance the performance of imbalanced applications by up to 45%.

关键词： Cloud computing Runtime High performance computing Graphics processing units distributed databases Elasticity Programming parallel processing Dynamic scheduling Resource management

来源：评论

学校读者我要写书评

暂无评论

Evaluating I/O Acceleration Mechanisms of SX-Aurora TSUBASA

Evaluating I/O Acceleration Mechanisms of SX-Aurora TSUBASA

引用

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

作者： Sasaki, Yuta Ishizuka, Ayumu Agung, Mulya Takizawa, Hiroyuki Tohoku Univ Grad Sch Informat Sci Sendai Miyagi Japan Tohoku Univ Cybersci Ctr Aoba Ku 6-3 Aramaki Aza Aoba Sendai Miyagi 9808578 Japan

ISBN: (纸本)9781665435772

In a heterogeneous computing system, different kinds of processors might need to be involved in the execution of a file I/O operation. Since NEC SX-Aurora TSUBASA is one such system, two I/O acceleration mechanisms are offered to reduce the data transfer overheads among the processors for a file I/O operation. This paper first investigates the effects of the two mechanisms on the I/O performance of SX-Aurora TSUBASA. Considering the results, proper use of the two mechanisms is discussed via a real-world application of flood damage estimation. These results clearly demonstrate the demand for auto-tuning, i.e., adaptively selecting either of the two mechanisms with considering application behaviors and system configuration.

关键词： Performance evaluation distributed processing Program processors File systems Conferences Estimation Data transfer

来源：评论

学校读者我要写书评

暂无评论

Separated Allocator Metadata in Disaggregated In-Memory databases: Friend or Foe?

Separated Allocator Metadata in Disaggregated In-Memory Data...

引用

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

作者： Marcel Weisgut Daniel Ritter Martin Boissier Michael Perscheid Hasso Plattner Institute University of Potsdam Potsdam Germany

ISBN: (数字)9781665497473

ISBN: (纸本)9781665497480

Memory allocation has a significant impact on the performance of in-memory databases. While state-of-the-art memory allocators work well in DRAM-only setups, some of their design decisions might no longer yield efficiency if data is tiered to disaggregated memory or secondary memory tiers. In this work, we study the performance impact of metadata in memory allocators and their tiering to disaggregated memory in the context of in-memory databases for the first time. We show how to separate metadata and application data by the example of jemalloc, which is widely used for data-intensive applications, and study performance effects for different workloads.

关键词： distributed processing Conferences Memory management distributed databases Metadata Behavioral sciences Resource management

来源：评论

学校读者我要写书评

暂无评论

PhD Forum: Towards Metastable-Failure-Free distributed Transaction systems

PhD Forum: Towards Metastable-Failure-Free Distributed Trans...

引用

Reliable distributed systems

作者： Farzad Habibi Department of Computer Science UC Irvine

ISBN: (数字)9798331530037

ISBN: (纸本)9798331530044

Metastable failures in distributed databases, characterized by their self-sustaining feedback loops leading to significant performance degradation, have become increasingly prevalent with the rise of complex distributed systems [1]. One of the main sustained feedback loops in these failures is retry storms. These failures are triggered by temporary changes in load, leading to a cascade of retrial requests that overwhelm the system even after the initial load spike has recovered [2]. We have leveraged queuing theory to propose an analytical method for modeling metastable failures due to retry storms [3]. Building on our previous work, this proposal outlines a systematic approach to mitigate these failures by eliminating retrial requests in distributed transaction systems. We focus on existing concurrency control mechanisms where retries of distributed transactions can occur frequently. Specifically, we focus on two-phase locking (2PL) under high contention workloads, where many distributed transactions can abort due to deadlocks and be retried, causing metastable failures. We propose that by preprocessing distributed transactions, we can reorder the locking mechanism to avoid deadlocks and transaction retries under high contention workloads. The behavior and correctness of this approach will be validated using the queuing model we developed.

关键词： Feedback loop Systematics Protocols Storms System performance Static analysis System recovery Reliability Proposals Queueing analysis

来源：评论

学校读者我要写书评

暂无评论

Coded Alternating Least Squares for Straggler Mitigation in distributed Recommendations

Coded Alternating Least Squares for Straggler Mitigation in ...

引用

IEEE international symposium on Information Theory (ISIT)

作者： Wang, Siyuan Yan, Qifa Zhang, Jingjing Wang, Jianping Song, Linqi City Univ Hong Kong Hong Kong Peoples R China Univ Illinoise Chicago Chicago IL USA Fudan Univ Shanghai Peoples R China

ISBN: (纸本)9781538682098

Matrix factorization is an important representation learning algorithm, e.g., recommender systems, where a large matrix can be factorized into the product of two low dimensional matrices termed as latent representations. This paper investigates the problem of matrix factorization in distributed computing systems with stragglers, those computing nodes that are slow to return computation results. A computation procedure, called coded Alternative Least Square (ALS), is proposed for mitigating the effect of stragglers in such systems. The coded ALS algorithm iteratively computes two low dimensional latent matrices by solving various linear equations, with the Entangled Polynomial Code (EPC) as a building block. We theoretically characterize the maximum number of stragglers that the algorithm can tolerate (or the recovery threshold) in relation to the redundancy of coding (or the code rate). In addition, we theoretically show the computation complexity for the coded ALS algorithm and conduct numerical experiments to validate our design.

关键词： Computer aided instruction Distance learning Simulation Redundancy distributed databases Resists Encoding

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 47 48 49 50 51 52 53 54 55 56 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：