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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,668 篇 会议
194 篇 期刊文献
27 册 图书

馆藏范围

4,889 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,499 篇 工学
- 2,385 篇 计算机科学与技术...
- 1,470 篇 软件工程
- 419 篇 信息与通信工程
- 385 篇 电气工程
- 193 篇 控制科学与工程
- 159 篇 电子科学与技术（可...
- 75 篇 网络空间安全
- 33 篇 材料科学与工程（可...
- 33 篇 生物医学工程（可授...
- 26 篇 机械工程
- 26 篇 安全科学与工程
- 21 篇 光学工程
- 21 篇 动力工程及工程热...
- 21 篇 生物工程
- 20 篇 建筑学
- 19 篇 土木工程
- 17 篇 力学（可授工学、理...
- 17 篇 环境科学与工程（可...
- 15 篇 交通运输工程
792 篇 理学
- 669 篇 数学
- 103 篇 统计学（可授理学、...
- 89 篇 系统科学
- 66 篇 物理学
- 29 篇 生物学
- 19 篇 化学
451 篇 管理学
- 322 篇 管理科学与工程(可...
- 229 篇 工商管理
- 153 篇 图书情报与档案管...
51 篇 经济学
- 51 篇 应用经济学
18 篇 法学
- 17 篇 社会学
15 篇 医学
9 篇 教育学
9 篇 农学
5 篇 文学
4 篇 军事学

主题

564 篇 distributed comp...
540 篇 computer science
490 篇 parallel process...
485 篇 concurrent compu...
410 篇 parallel process...
379 篇 application soft...
342 篇 distributed data...
335 篇 distributed comp...
310 篇 databases
288 篇 computer archite...
249 篇 database systems
222 篇 computational mo...
220 篇 delay
215 篇 hardware
211 篇 costs
188 篇 processor schedu...
172 篇 protocols
170 篇 computer network...
162 篇 large-scale syst...
152 篇 parallel program...

机构

20 篇 ibm thomas j. wa...
11 篇 department of co...
10 篇 department of co...
8 篇 school of comput...
8 篇 department of co...
8 篇 department of co...
7 篇 ieee
7 篇 department of co...
7 篇 department of ee...
7 篇 department of co...
7 篇 college of compu...
7 篇 hewlett packard ...
7 篇 northwestern uni...
6 篇 department of co...
6 篇 syracuse univ sy...
6 篇 department of co...
6 篇 department of co...
6 篇 lawrence berkele...
6 篇 college of compu...
6 篇 univ of californ...

作者

20 篇 a. choudhary
16 篇 a. boukerche
10 篇 s.k. das
10 篇 boukerche azzedi...
10 篇 choudhary a
10 篇 li keqin
9 篇 j. saltz
9 篇 sun xian-he
9 篇 choudhary alok
9 篇 k. schwan
9 篇 das sajal k.
8 篇 l.r. welch
8 篇 a. makinouchi
8 篇 chen haibo
8 篇 anon
8 篇 a.a. chien
7 篇 c. katsinis
7 篇 t. kurc
7 篇 d.k. panda
7 篇 keqin li

语言

4,864 篇 英文
23 篇 其他
2 篇 中文

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

共 4889 条记录，以下是71-80 订阅

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

详细简洁

排序：

MobiHoc 2023 - proceedings of the 2023 international symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing

MobiHoc 2023 - Proceedings of the 2023 International Symposi...

引用

2023 international symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, MobiHoc 2023

ISBN: (纸本)9781450399265

The proceedings contain 93 papers. The topics discussed include: cache-enabled federated learning systems;incentive mechanism design for federated learning and unlearning;anarchic federated learning with delayed gradient averaging;connectivity-aware semi-decentralized federated learning over time-varying D2D networks;2ACE: spectral profile-driven multi-resolutional compressive sensing for mmWave channel estimation;a new paradigm of communication-aware collaborative positioning for FutureG wireless systems;AirFC: designing fully connected layers for neural networks with wireless signals;age of information diffusion on social networks: optimizing multi-stage seeding strategies;a whittle index policy for the remote estimation of multiple continuous Gauss-Markov processes over parallel channels;age minimization with energy and distortion constraints;on a continuous-time martingale and two applications;and network utility maximization with unknown utility functions: a distributed, data-driven bilevel optimization approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2022 21st international symposium on parallel and distributed Computing, ISPDC 2022

Proceedings - 2022 21st International Symposium on Parallel ...

引用

21st international symposium on parallel and distributed Computing, ISPDC 2022

ISBN: (纸本)9781665488020

The proceedings contain 19 papers. The topics discussed include: deep heuristic for broadcasting in arbitrary networks;online event selection for Mu3e using GPUs;estimating the impact of communication schemes for distributed graph processing;a scalable algorithm for homomorphic computing on multi-core clusters;APPFIS: an advanced parallel programming framework for iterative stencil based scientific applications in HPC environments;a hybrid clustering algorithm for high-performance edge computing devices;performance modeling of scalable resource allocations with the imperial PEPA compiler;and investigating TCP/MPTCP support for drop computing in user space network stacks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Coverage Probability of distributed CoMP UAV-Assisted Cellular Networks 22

Coverage Probability of Distributed CoMP UAV-Assisted Cellul...

引用

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

作者： Li, Yan Long, Qingmin Tang, Qiang He, Shiming Xiong, Bing Changsha University of Science and Technology School of Computer and Communication Engineering Changsha410004 China National University of Defense Technology Science and Technology on Information System Engineering Laboratory Changsha410073 China

ISBN: (纸本)9798331509712

It is well-established that terrestrial communication systems may fail during emergencies such as earthquakes, tsunamis, and floods. Fortunately, with the rapid advancement of unmanned aerial vehicle (UAV) network technology, deploying UAV nodes as aerial base stations (BSs) is assuming an increasingly crucial role in facilitating downlink transmissions and restoring ground communication capabilities. However, a single UAV node is not sufficient to meet the requirements. Inspired by distributed communication, we introduce a performance analysis framework based on stochastic geometry to analyze the distributed coordinated multi-point (CoMP) UAV-assisted communication network. Specifically, we assume that all UAV nodes follow a homogeneous Poisson point process (PPP) and maintain a constant altitude. The entire space is tessellated by multiple hexagons, with multiple UAV nodes within each hexagonal region working together to serve terrestrial user equipments (UEs). For this region-centric cooperative model, we derive an exact expression for the coverage probability to quantify the performance improvement enabled by UAVs, analyze the upper bound of the coverage probability, and provide a simplified approximation. We then compare this model to a user-centric model. Our numerical findings demonstrate that the cooperation of UAV nodes can significantly enhance the coverage probability and save spectrum resources. © 2024 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Provably Good Randomized Strategies for Data Placement in distributed Key-Value Stores 23

Provably Good Randomized Strategies for Data Placement in Di...

引用

28th ACM SIGPLAN Annual symposium on Principles and Practice of parallel Programming, PPoPP 2023

作者： Wang, Zhe Zhao, Jinhao Agrawal, Kunal Liu, He Xu, Meng Li, Jing Washington University St. Louis United States FoundationDB New Jersey Institute of Technology United States

ISBN: (纸本)9798400700156

distributed storage systems are used widely in clouds, databases, and file systems. These systems store a large amount of data across multiple servers. When a request to access data comes in, it is routed to the appropriate server, queued, and eventually processed. If the server's queue is full, then requests may be rejected. Thus, one important challenge when designing the algorithm for allocating data to servers is the fact that the request pattern may be unbalanced, unpredictable, and may change over time. If some servers get a large fraction of the requests, they are overloaded, leading to many rejects. In this paper, we analyze this problem theoretically under adversarial assumptions. In particular, we assume that the request sequence is generated by an adversarial process to maximize the number of rejects and analyze the performance of various algorithmic strategies in terms of the fraction of the requests rejected. We show that no deterministic strategy can perform well. On the other hand, a simple randomized strategy guarantees that at most a constant fraction of requests are rejected in expectation. We also show that moving data to load balance is essential if we want to reject a very small fraction (1/m where m is the number of servers) of requests. We design a strategy with randomization and data transfer to achieve this performance with speed augmentation. Finally, we conduct experiments and show that our algorithms perform well in practice. © 2023 Owner/Author.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

FLEXLOG: A Shared Log for Stateful Serverless Computing 23

FLEXLOG: A Shared Log for Stateful Serverless Computing

引用

32nd international symposium on High-Performance parallel and distributed Computing (HPDC) part of the ACM Federated Computing Research Conference (FCRC)

作者： Giantsidi, Dimitra Giortamis, Emmanouil Tornow, Nathaniel Dinu, Florin Bhatotia, Pramod Univ Edinburgh Edinburgh Midlothian Scotland Tech Univ Munich Munich Germany Huawei Munich Res Ctr Munich Germany

ISBN: (纸本)9798400701559

Stateful serverless applications need to persist their state and data. The existing approach is to store the data in general purpose storage systems. However, these approaches are not designed to meet the demands of serverless applications in terms of consistency, fault tolerance and performance. We present FlexLog, a storage system, specifically a distributed sharedlog, distinctively designedtomeet the requirements of stateful serverless computing while mitigating the relevant system bottlenecks. FlexLog's data layer leverages the state-of-the-art persistent memory (PM) to offer low latency I/O and improve performance. To match the performance, FlexLog's ordering layer employs a scalable design, namely a tree-structure set of sequencer nodes. Importantly, this design provides serverless applications with the flexibility to implement different consistency guarantees and to seamlessly support multi-tenancy configurations. We implement FlexLog from the ground up on a real hardware testbed and we also prove the correctness of our protocols. In particular, we evaluate FlexLog on a cluster of 6 machines with 800 GB Intel Optane DC PM over a 10 Gbps interconnect. Our evaluation shows that FlexLog scales to millions of operations per second while maintaining minimal latency. Our comparison with the state-of-the-art shared log for serverless, Boki, shows that we achieve 10x better throughput in the storage layer and 2x-4x lower latency in the ordering layer, while also providing flexibility to support different consistency properties and multi-tenancy.

关键词： Serverless Computing Shared distributed Log Persistent Memory

来源：评论

学校读者我要写书评

暂无评论

Data-parallel Actors: A Programming Model for Scalable Query Serving systems 19

Data-Parallel Actors: A Programming Model for Scalable Query...

引用

19th USENIX symposium on Networked systems Design and Implementation (NSDI)

作者： Kraft, Peter Kazhamiaka, Fiodar Bailis, Peter Zaharia, Matei Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781939133274

We present data-parallel actors (DPA), a programming model for building distributed query serving systems. Query serving systems are an important class of applications characterized by low-latency data-parallel queries and frequent bulk data updates;they include data analytics systems like Apache Druid, full-text search engines like ElasticSearch, and time series databases like InfluxDB. They are challenging to build because they run at scale and need complex distributed functionality like data replication, fault tolerance, and update consistency. DPA makes building these systems easier by allowing developers to construct them from purely single-node components while automatically providing these critical properties. In DPA, we view a query serving system as a collection of stateful actors, each encapsulating a partition of data. DPA provides parallel operators that enable consistent, atomic, and fault-tolerant parallel updates and queries over data stored in actors. We have used DPA to build a new query serving system, a simplified data warehouse based on the single-node database MonetDB, and enhance existing ones, such as Druid, Solr, and MongoDB, adding missing user-requested features such as load balancing and elasticity. We show that DPA can distribute a system in <1K lines of code (>10x less than typical implementations in current systems) while achieving state-of-the-art performance and adding rich functionality.

关键词： Data warehouses

来源：评论

学校读者我要写书评

暂无评论

RSCache: A Tail Latency Friendly Cache Based on NVMe SSDs 22

RSCache: A Tail Latency Friendly Cache Based on NVMe SSDs

引用

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

作者： Lu, Jincheng Cai, Miao Ye, Baoliu Hohai University College of Computer Science and Software Engineering Nanjing China Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology Nanjing China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

ISBN: (纸本)9798331509712

High fan-out requests are prevalent in systems employing multi-tier architectures. These requests are divided into several sub-requests for parallel processing. However, a high fan-out request must await all sub-requests to be completed before returning, but the processing times of sub-requests are unpredictable due to their differences in characteristics, such as data volume and data popularity. Meanwhile, existing SSD-based caches struggle to adjust request processing speeds to ensure timely handling. As a result, some sub-requests are delayed, affecting the overall latency and causing long tail latency *** paper proposes RSCache, a tail latency-friendly cache based on NVMe SSDs. RSCache combines the NVMe Weighted Round-robin (WRR) arbitration mechanism with a priority-based scheduling mechanism to enable differentiated request processing. We propose a fan-out size-based priority assignment strategy along with a latency-aware sub-request sorting method. They collaborate to prioritize sub-requests according to their impacts on tail latency and schedule them to NVMe priority queues with various processing speeds, effectively reducing the processing time variations among sub-requests. In addition, we balance the load across queues to avoid congestion with a novel feedback mechanism. We implement the prototype of RSCache based on SPDK. Our experiments demonstrate that RSCache reduces tail latency by up to 40% and improves throughput by two times compared to state-of-the-art SSD-based cache designs. © 2024 IEEE.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2022 IEEE 36th international parallel and distributed Processing symposium, IPDPS 2022

Proceedings - 2022 IEEE 36th International Parallel and Dist...

引用

36th IEEE international parallel and distributed Processing symposium, IPDPS 2022

ISBN: (纸本)9781665481069

The proceedings contain 123 papers. The topics discussed include: challenges and opportunities in designing high-performance and scalable middleware for HPC and ai: past, present, and future;HTS: a threaded multilevel sparse hybrid solver;a scalable adaptive-matrix SPMV for heterogeneous architectures;direct solution of larger coupled sparse/dense linear systems using low-rank compression on single-node multi-core machines in an industrial context;distributed-memory sparse kernels for machine learning;fam-graph: graph analytics on disaggregated memory;scalable multi-versioning ordered key-value stores with persistent memory support;in-memory indexed caching for distributed data processing;landau collision operator in the CUDA programming model applied to thermal quench plasmas;exploiting reduced precision for GPU-based time series mining;and MICCO: an enhanced multi-GPU scheduling framework for many-body correlation functions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Accelerating Native Transaction Processing in LSM-Based Persistent Key-Value Stores

Accelerating Native Transaction Processing in LSM-Based Pers...

引用

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

作者： Jin Xue Zili Shao Department of Computer Science and Engineering The Chinese University of Hong Kong

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

In recent years, key-value stores (KV stores) [1]-[3] begin to gain popularity as storage engines for large-scale data applications. KV stores are fundamentally different from traditional SQL databases and with the key-value data model, they have various advantages, such as ease of use, flexibility and higher performance. However, some essential features in SQL databases, most notably atomicity, consistency, isolation and durability (ACID) transaction processing [4], are considered impractical and thus are generally not included in a KV store design. With the recent advancement, these features begin to be integrated into KV stores, giving birth to a brand new class of database management systems called NewSQL databases [5], [6]. The rationale behind NewSQL databases is that with ACID transaction support, KV stores can serve as storage engines for an upper-layer SQL query processor to handle SQL queries [7]-[9]. In this way, NewSQL databases can provide both the scalability of KV stores and the ACID guarantees required for online transaction processing (OLTP), thus providing high performance for different types of workloads in a large-scale data system.

关键词： distributed processing Scalability Conferences Big Data applications Database systems Data systems Data models

来源：评论

学校读者我要写书评

暂无评论

distributed Stochastic Bandits with Corrupted and Defective Input Commands

Distributed Stochastic Bandits with Corrupted and Defective ...

引用

2023 IEEE international symposium on Information Theory, ISIT 2023

作者： Chang, Meng-Che Bloch, Matthieu R. Georgia Institute of Technology School of Electrical and Computer Engineering AtlantaGA30332 United States

ISBN: (纸本)9781665475549

We analyze a distributed stochastic bandit model in which an agent controls multiple independent stochastic bandit machines. At each time step, the agent selects several machines for parallel exploitation but the arm pulled by each machine may differ from the command received either randomly (defective command) or adversarially (corrupted command). Machines that faithfully execute commands are called honest. We study situations in which the number of honest machines is either known or unknown and define appropriate notions of regret. With at least one honest machine and a known number of honest bandits, we provide a simple algorithm that achieves Õ( n1/2) regrets when commands are corrupted. Lower bounds on regret established by drawing connections to the problem of "low probability of detection,"show the near optimality of the regret achieved by the algorithms. © 2023 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共489页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：