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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
25 册 图书

馆藏范围

4,887 篇 电子文献
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,874 篇 英文
11 篇 其他
2 篇 中文

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

共 4887 条记录，以下是4851-4860 订阅

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

详细简洁

排序：

Apodotiko: Enabling Efficient Serverless Federated Learning in Heterogeneous Environments

Apodotiko: Enabling Efficient Serverless Federated Learning ...

引用

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

作者： Mohak Chadha Alexander Jensen Jianfeng Gu Osama Abboud Michael Gerndt Chair of Computer Architecture and Parallel Systems Technische Universität München Garching (near Munich) Germany Huawei Technologies Munich Germany

ISBN: (数字)9798350395662

ISBN: (纸本)9798350395679

Federated Learning (FL) is an emerging machine learning paradigm that enables the collaborative training of a shared global model across distributed clients while keeping the data decentralized. Recent works on designing systems for efficient FL have shown that utilizing serverless computing technologies, particularly Function-as-a-Service (FaaS) for FL, can enhance resource efficiency, reduce training costs, and alleviate the complex infrastructure management burden on data holders. However, current serverless FL systems still suffer from the presence of stragglers, i.e., slow clients that impede the collaborative training process. While strategies aimed at mitigating stragglers in these systems have been proposed, they overlook the diverse hardware resource configurations among FL clients. To this end, we present Apodotiko, a novel asynchronous training strategy designed for serverless FL. Our strategy incorporates a scoring mechanism that evaluates each client’s hardware capacity and dataset size to intelligently prioritize and select clients for each training round, thereby minimizing the effects of stragglers on system performance. We comprehensively evaluate Apodotiko across diverse datasets, considering a mix of CPU and GPU clients, and compare its performance against five other FL training strategies. Results from our experiments demonstrate that Apodotiko outperforms other FL training strategies, achieving an average speedup of 2.75x and a maximum speedup of 7.03x. Furthermore, our strategy significantly reduces cold starts by a factor of four on average, demonstrating suitability in serverless environments.

关键词： Training Federated learning System performance Prevention and mitigation Collaboration Serverless computing Graphics processing units distributed databases Hardware Data models

来源：评论

学校读者我要写书评

暂无评论

Multicast snooping: a new coherence method using a multicast address network

Multicast snooping: a new coherence method using a multicast...

引用

Annual international symposium on Computer Architecture, ISCA

作者： E.E. Bilir R.M. Dickson Ying Hu M. Plakal D.J. Sorin M.D. Hill D.A. Wood Computer Sciences Department University of Wisconsin Madison USA

This paper proposes a new coherence method called "multicast snooping" that dynamically adapts between broadcast snooping and a directory protocol. Multicast snooping is unique because processors predict which caches should snoop each coherence transaction by specifying a multicast "mask". Transactions are delivered with an ordered multicast network, such as an Isotach network, which eliminates the need for acknowledgment messages. Processors handle transactions as they would with a snooping protocol while a simplified directory operates in parallel to check masks and gracefully handle incorrect ones (e.g., previous owner missing). Preliminary performance numbers with mostly SPLASH-2 benchmarks running on 32 processors show that we can limit multicasts to an average of 2-6 destinations (/spl Lt/ 32) and we can deliver 2-5 multicasts per network cycle (/spl Gt/ broadcast snooping's 1 per cycle). While these results do not include timing, they do provide encouragement that multicast snooping can obtain data directly (like broadcast snooping) but apply to larger systems (like directories).

关键词： Broadcasting Protocols Coherence Bandwidth Timing Computational modeling databases Microprocessors Sun Power transmission lines

来源：评论

学校读者我要写书评

暂无评论

A new Julia-based parallel time-domain simulation algorithm for analysis of power system dynamics 20

A new Julia-based parallel time-domain simulation algorithm ...

引用

proceedings of the IEEE/ACM 24th international symposium on distributed Simulation and Real Time Applications

作者： Michael Kyesswa Philipp Schmurr Hüseyin K. Çakmak Uwe Kühnapfel Veit Hagenmeyer Karlsruhe Institute of Technology Karlsruhe Germany

The present paper describes a new parallel time-domain simulation algorithm using a high performance computing environment - Julia - for the analysis of power system dynamics in large networks. The parallel algorithm adapts a parallel-in-space decomposition scheme to a previously sequential algorithm in order to develop a new parallelizable numerical solution of the power system equations. The parallel-in-space decomposition is based on the block bordered diagonal form, which reformulates the network admittance matrix into sub-blocks that can be solved in parallel. For the optimal spatial decomposition of the network, a new extended graph partitioning strategy is developed for load balancing and minimizing the communication between subnetworks. The new parallel simulation algorithm is tested using standard test networks of varying complexity. The simulation results are compared to those obtained from a sequential implementation in order to validate the solution accuracy and to determine the performance improvement in terms of computational speedup. Test simulations are conducted using the ForHLR II supercomputing cluster and show a huge potential in computational speedup with increasing network complexity.

关键词： time-domain simulation transient stability analysis parallel computing power systems graph partitioning

来源：评论

学校读者我要写书评

暂无评论

Tolerating late memory traps in ILP processors

Tolerating late memory traps in ILP processors

引用

Annual international symposium on Computer Architecture, ISCA

作者： Xiaqang Qiu M. Dubois Department of Electrical Engineering-Systems University of Southern California Los Angeles CA USA

ILP processors can execute a large number of instructions at the same time. Thus it becomes more and more difficult to support traps efficiently. On the other hand a current trend in architecture is to support various memory functions in software rather than hardware, usually by trapping the execution processor on a cache miss, TLB miss or a failed access to a local or remote memory. These late memory traps block the faulty instruction at the top of the active list, backing up the pipeline. Moreover the support for late memory traps may affect the performance of non-faulting memory instructions as well. In this paper we analyze the overhead caused by late memory traps in ILP processors and define several measures for this overhead. In order to tolerate late memory traps, we propose hardware prefetching of exception conditions and a tagged store buffer to implement deferred traps on stores. We show that, with these hardware optimizations, the overhead added by the lateness of traps is significantly reduced relative to the overhead of early traps. Because of caching effects the frequency of late memory traps usually decreases as they are taken deeper in the memory hierarchy and their overall impact on the execution time becomes negligible.

关键词： Concurrent computing High performance computing Computer aided instruction distributed computing Computer architecture Computer languages parallel processing Software performance Writing

来源：评论

学校读者我要写书评

暂无评论

Load balancing in large-scale epidemiological simulations 13

Load balancing in large-scale epidemiological simulations

引用

proceedings of the 22nd international symposium on High-performance parallel and distributed computing

作者： Tariq Kamal Keith R. Bisset Ali R. Butt Youngyun Chungbaek Madhav Marathe Virginia Tech Blacksburg VA USA

ISBN: (纸本)9781450319102

Despite the recent advancements in graph partitioning techniques and algorithms, achieving static load balancing in agent-based epidemiological applications is challenging. Input to these simulations is a large agent-location bipartite graph that is highly complex and non-uniform. In this paper, we compare several static load distribution schemes, including our custom strategies, for partitioning a class of bipartite graphs. Computations over such graphs happen between classes of nodes in phases. Our performance evaluations on a 768 core system show that our lower-overhead custom load balancing strategy achieves a 2-fold increase in strong scaling performance compared to the default Round Robin data distribution.

关键词： distributed systems epidemiological simulations load balancing

来源：评论

学校读者我要写书评

暂无评论

Disk allocation methods for parallelizing grid files

Disk allocation methods for parallelizing grid files

引用

international Conference on Data Engineering

作者： Y. Zhou S. Shekhar A. Coyle Department of Computer Science University of Minnesota Minneapolis MN USA

The grid file is a well known access method for multi-dimensional and spatial data. The response time needed to process path and range queries on the grid file access method can be improved significantly by distributing the data pages over multiple disks. The paper explores the disk allocation methods used to allocate the data pages of grid file among a set of disks, which can be accessed in parallel. Given N disks, a perfect allocation will speed up the processing of each query by a factor of N in this environment. The authors show that no disk allocation is perfect for the set of all orthogonal range queries, even on uniformly distributed read-only data. They then introduce two families of allocation methods, namely the Linear allocation method and the Lattice allocation method, which are perfect for a large collection of interesting path queries (rows, columns, diagonals, anti-diagonals) and range queries (small rectangles), on an interesting set of data distributions. They address the issues in extending disk allocation methods to general data distributions with random updates. Finally, they provide experimental results on the performance of the proposed methods and other well known disk allocation methods on different query sets, data distributions and data set sizes.< >

关键词： Spatial databases Computer science Multidimensional systems Delay Lattices Design methodology Throughput Database systems Bandwidth Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Analyzing the impact of computational heterogeneity on runtime performance of parallel scientific components

Analyzing the impact of computational heterogeneity on runti...

引用

2007 Agent Directed Simulation symposium, ADS 2007

作者： Chandra, Sumir Parashar, Manish Ray, Jaideep Dept. of Electrical and Computer Engineering Rutgers University NJ United States Advanced Software R and D Sandia National Laboratories CA United States

ISBN: (纸本)1565553136

Scientific simulations modeling complex physical phenomena exhibit varying degrees of spatiotemporal and computational heterogeneity, which can pose significant challenges in algorithmic efficiency and runtime performance. Addressing these challenges often requires an understanding of application behavior and the impact of heterogeneity on the simulation, especially when analytical approaches are not feasible. Runtime calibration is used to analyze the impact of computational heterogeneity on the performance of two different load balancing strategies applied to two different problems of 2-D methane-air combustion using different chemistry models. Experimental evaluation demonstrates that such empirical approaches are inevitable in component-based scientific computations, where performance is determined by the problem characteristics and the particular connectivity of components in the simulation code, none of which are known before runtime.

关键词： Combustion

来源：评论

学校读者我要写书评

暂无评论

Efficient massively parallel simulation of dynamic channel assignment schemes for wireless cellular communications

Efficient massively parallel simulation of dynamic channel a...

引用

international symposium on Modeling, Analysis and Simulation of Computer and Telecommunication systems (MASCOTS)

作者： A.G. Greenberg B.D. Lubachevsky P.E. Wright D.M. Nicol AT and T Bell Laboratories Inc. USA College of William and Mary USA

Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. The driving events are call arrivals and departures, in continuous time, to cells geographically distributed across the service area. A dynamic channel assignment scheme decides which call arrivals to accept, and which channels to allocate to the accepted calls, attempting to minimize call blocking while ensuring co-channel interference is tolerably low. Specifically, the scheme ensures that the same channel is used concurrently at different cells only if the pairwise distances between those cells are sufficiently large. Much of the complexity of the system comes from ensuring this separation. The network is modeled as a system of interacting continuous time automata, each corresponding to a cell. To simulate the model, we use conservative methods; i.e., methods in which no errors occur in the course of the simulation and so no rollback or relaxation is needed. Implemented on a 16 K processor MasPar MP-1, an elegant and simple technique provides speedups of about 15/spl times/ over an optimized serial simulation running on a high speed workstation. A drawback of this technique, typical of conservative methods, is that processor utilization is rather low. To overcome this, we developed new methods that exploit slackness in event dependencies over short intervals of time, thereby raising the utilization to above 50% and the speedup over the optimized serial code to about 120/spl times/ with respect to the workstation simulation.< >

关键词： Discrete event simulation Resource management Cellular networks Workstations Wireless communication Automata Land mobile radio cellular systems Educational institutions parallel algorithms Communication networks

来源：评论

学校读者我要写书评

暂无评论

Scalable matching and ranking for network search

Scalable matching and ranking for network search

引用

international Conference on Network and Service Management

作者： Misbah Uddin Rolf Stadler Alexander Clemm ACCESS Linnaeus Center KTH Royal Institute of Technology Cisco Systems San Jose California USA

Network search makes operational data available in real-time to management applications. In contrast to traditional monitoring, neither the data location nor the data format needs to be known to the invoking process, which simplifies application development, but requires an efficient search plane inside the managed system. The search plane is realized as a network of search nodes that process search queries in a distributed fashion. This paper introduces matching and ranking for network search queries. We are proposing a semantic for matching and ranking, which is configurable to support different types of management applications-from exact matching for database-style queries to loose, approximate matching, which is appropriate for exploratory purposes. We describe an echo protocol for efficient distributed query processing that supports matching and ranking. Further, we present the design of a search node, which maintains a real-time database of operational information and allows for parallel processing of search queries. A prototype implementation on a cloud testbed shows that the network search system, on a 9-node cluster with 24 core servers, executes 200 global search queries/sec with the 75th percetile latency below 100 milliseconds and with a CPU utilization below 5%. The performance measurements, together with our design, suggest that a system of 100,000 servers processing the same load would exhibit the same overhead per server and a query latency of below 1 sec.

关键词： Measurement Search problems Peer-to-peer computing databases Protocols Web search Semantics

来源：评论

学校读者我要写书评

暂无评论

Fengyun-3 Series Meteorological Satellite Data Archiving and Service System

Fengyun-3 Series Meteorological Satellite Data Archiving and...

引用

IEEE international symposium on Geoscience and Remote Sensing (IGARSS)

作者： Zhe Xu Jianmei Qian Di Xian Yonggang Qi CMA/National Satellite Meteorological Center Haidian District Beijing China

ISBN: (纸本)9781509033331

This paper introduces the characteristics and the new technologies applied in Fengyun-3 Series Meteorological Satellite Data Archiving and Service System. The system integrates several high-performance servers, high availability disk array, large-scale automated tape library as well as operation system, database, storage software and application software, all of which constitutes archive and service application clusters. The application of configured dynamic load container technology and multi-server processing load balancing and parallel computing technology makes the cluster a highly scalable, available, efficient operational system to realize all levels of satellite data archiving, customization, retrieval, dynamic information release, operation monitoring, management, and other functions. Internet-based full dataset sharing, distributed file system, spatiotemporal integration of database storage, WebGIS global satellite image distribution, visual processing and display technology are adopted in the system to improve data sharing and service. Completion of the system meets the needs of operational meteorological satellite, achieving daily 4 TB data storing and daily 1 TB data download service. The system running in NSMC/CMA is the first one to provide internet-based full archive dataset (online, nearline and offline) sharing service in the area of Chinese civil remote sensing satellite data services.

关键词： Satellites Real-time systems Servers Satellite broadcasting Image resolution Arrays databases

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共489页 << < 480 481 482 483 484 485 486 487 488 489 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：