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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

37 篇 会议
7 篇 期刊文献

馆藏范围

44 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

20 篇 工学
- 20 篇 计算机科学与技术...
- 15 篇 软件工程
- 7 篇 信息与通信工程
- 4 篇 电气工程
- 3 篇 控制科学与工程
- 2 篇 安全科学与工程
- 1 篇 交通运输工程
12 篇 理学
- 12 篇 数学
- 3 篇 统计学（可授理学、...
5 篇 管理学
- 4 篇 管理科学与工程(可...
- 3 篇 工商管理
- 1 篇 图书情报与档案管...

主题

4 篇 computer archite...
2 篇 parallel archite...
2 篇 chip multiproces...
2 篇 telecommunicatio...
2 篇 computer network...
1 篇 computer science
1 篇 parallel algorit...
1 篇 performance
1 篇 shared memory ar...
1 篇 computer network...
1 篇 coherence
1 篇 computer systems...
1 篇 multi-core archi...
1 篇 green computing ...
1 篇 communication-av...
1 篇 algorithms
1 篇 dense linear alg...
1 篇 special issues o...
1 篇 stream programmi...
1 篇 data affinity

机构

2 篇 intel research p...
2 篇 carnegie mellon ...
1 篇 weizmann institu...
1 篇 intel microproce...
1 篇 stony brook univ...
1 篇 univ jaume 1 dep...
1 篇 university of ca...
1 篇 univ padua padua
1 篇 pricneton univer...
1 篇 northeastern uni...
1 篇 carnegie mellon ...
1 篇 computer science...
1 篇 univ illinois co...
1 篇 sandia national ...
1 篇 northeastern uni...
1 篇 fiorano software...
1 篇 university of pa...
1 篇 united states
1 篇 univ texas austi...
1 篇 univ calif san d...

作者

2 篇 rajaraman rajmoh...
2 篇 vishkin uzi
1 篇 ballard grey
1 篇 chan ernie
1 篇 falsafi babak
1 篇 kozuch michael
1 篇 kumar vijay
1 篇 vasileios liasko...
1 篇 xu helen
1 篇 blelloch guy e.
1 篇 babak falsafi
1 篇 gearhart andrew
1 篇 michael kozuch
1 篇 dally william
1 篇 copsey dean
1 篇 naor moni
1 篇 pucci geppino
1 篇 park jongsoo
1 篇 dally william j.
1 篇 gibbons phillip ...

语言

44 篇 英文

检索条件"任意字段=Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures"

共 44 条记录，以下是31-40 订阅

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

详细简洁

排序：

SPAA 2020 - Proceedings of the 32nd acm symposium on parallelism in algorithms and architectures

SPAA 2020 - Proceedings of the 32nd ACM Symposium on Paralle...

引用

32nd acm symposium on parallelism in algorithms and architectures, SPAA 2020

ISBN: (纸本)9781450369350

The proceedings contain 68 papers. The topics discussed include: faster deterministic all pairs shortest paths in congest model;contention resolution with message deadlines;memory tagging: minimalist synchronization for scalable concurrent data structures;work-efficient batch-incremental minimum spanning trees with applications to the sliding-window model;closing the gap between cache-oblivious and cache-adaptive analysis;optimal resource allocation for elastic and inelastic jobs;optimal parallel algorithms in the binary-forking model;randomized incremental convex hull is highly parallel;almost universal anonymous rendezvous in the plane;the online multi-commodity facility location problem;unconditional lower bounds for adaptive massively parallel computation;on the hardness of massively parallel computation;and graph sparsification for derandomizing massively parallel computation with low space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SPAA'09 - Proceedings of the 21st annual symposium on parallelism in algorithms and architectures

SPAA'09 - Proceedings of the 21st Annual Symposium on Parall...

引用

21st annual symposium on parallelism in algorithms and architectures, SPAA'09

ISBN: (纸本)9781605586069

The proceedings contain 43 papers. The topics discussed include: speed scaling of processes with arbitrary speedup curves on a multiprocessor;the bell is ringing in speed-scaled multiprocessor scheduling;mapping filtering streaming applications with communication costs;scheduling to minimize staleness and stretch in real-time data warehouses;parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design;selfishness in transactional memory;at-most-once semantics in asynchronous shared memory;memory models: a case for rethinking parallel languages and hardware;the life and times of a ZooKeeper;Cassandra - a structured storage system on a P2P network;Pregel: a system for large-scale graph processing;towards transactional memory semantics for C++;on avoiding spare aborts in transactional memory;inherent limitations on disjoint-access parallel implementations of transactional memory;reducers and other Cilk++ hyperobjects;and beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SPAA 2014 - Proceedings of the 26th acm symposium on parallelism in algorithms and architectures

SPAA 2014 - Proceedings of the 26th ACM Symposium on Paralle...

引用

26th acm symposium on parallelism in algorithms and architectures, SPAA 2014

ISBN: (纸本)9781450328210

The proceedings contain 42 papers. The topics discussed include: on dynamic bin packing for resource allocation in the cloud;on the online fault-tolerant server consolidation problem;on computing maximal independent sets of hypergraphs in parallel;simple parallel and distributed algorithms for spectral graph sparsification;concurrent data structures for efficient streaming aggregation;provably good scheduling for parallel programs that use data structures through implicit batching;scheduling selfish jobs on multidimensional parallel machines;LP rounding and combinatorial algorithms for minimizing active and busy time;a note on multiprocessor speed scaling with precedence constraints;executing dynamic data-graph computations deterministically using chromatic scheduling;the PCL theorem. transactions cannot be parallel, consistent and live;adaptive integration of hardware and software lock elision techniques;and transaction-friendly condition variables.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SPAA 2023 - Proceedings of the 35th acm symposium on parallelism in algorithms and architectures

SPAA 2023 - Proceedings of the 35th ACM Symposium on Paralle...

引用

35th acm symposium on parallelism in algorithms and architectures, SPAA 2023

ISBN: (纸本)9781450395458

The proceedings contain 47 papers. The topics discussed include: Quancurrent: a concurrent quantiles sketch;an efficient scheduler for task-parallel interactive applications;efficient synchronization-light work stealing;balanced allocations in batches: the tower of two choices;massively parallel tree embeddings for high dimensional spaces;deterministic massively parallel symmetry breaking for sparse graphs;an associativity threshold phenomenon in set-associative caches;increment - and - freeze: every cache, everywhere, all of the time;multidimensional approximate agreement with asynchronous fallback;a tight characterization of fast failover routing: resiliency to two link failures is possible;releasing memory with optimistic access: a hybrid approach to memory reclamation and allocation in lock-free programs;transactional composition of nonblocking data structures;applying hazard pointers to more concurrent data structures;and nearly optimal parallel algorithms for longest increasing subsequence.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SPAA 2024 - Proceedings of the 36th acm symposium on parallelism in algorithms and architectures

SPAA 2024 - Proceedings of the 36th ACM Symposium on Paralle...

引用

36th acm symposium on parallelism in algorithms and architectures, SPAA 2024

ISBN: (纸本)9798400704161

The proceedings contain 54 papers. The topics discussed include: expediting hazard pointers with bounded RCU critical sections;Alock: asymmetric lock primitive for RDMA systems;when is parallelism fearless and zero-cost with rust?;efficient parallel reinforcement learning framework using the reactor model;parallel best arm identification in heterogeneous environments;brief announcement: lock-free learned search data structure;brief announcement: LIT: lookup interlocked table for range queries;brief announcement: a fast scalable detectable unrolled lock-based linked list;scheduling out-trees online to optimize maximum flow;optimizing dynamic data center provisioning through speed scaling: a primal-dual perspective;scheduling jobs with work-inefficient parallel solutions;and multi bucket queues: efficient concurrent priority scheduling.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SPAA'12 - Proceedings of the 24th acm symposium on parallelism in algorithms and architectures

SPAA'12 - Proceedings of the 24th ACM Symposium on Paralleli...

引用

24th acm symposium on parallelism in algorithms and architectures, SPAA'12

ISBN: (纸本)9781450312134

The proceedings contain 40 papers. The topics discussed include: time vs. space trade-offs for rendezvous in trees;allowing each node to communicate only once in a distributed system: shared whiteboard models;optimal and competitive runtime bounds for continuous, local gathering of mobile robots;online multi-robot exploration of grid graphs with rectangular obstacles;in search of parallel dimensions;delegation and nesting in best-effort hardware transactional memory;design, verification and applications of a new read-write lock algorithm;a lock-free B+tree;brief announcement: the problem based benchmark suite;brief announcement: subgraph isomorphism on a multithreaded shared memory architecture;efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model;a scalable framework for heterogeneous GPU-based clusters;and faster and simpler width-independent parallel algorithms for positive semidefinite programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multicore Paging algorithms Cannot Be Competitive 20

Multicore Paging Algorithms Cannot Be Competitive

引用

32nd acm symposium on parallelism in algorithms and architectures, SPAA 2020

作者： Kamali, Shahin Xu, Helen Department of Computer Science University of Manitoba WinnipegMB Canada Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology CambridgeMA United States

ISBN: (纸本)9781450369350

Every processor with multiple cores sharing a cache needs to implement a page-replacement algorithm. Lopez-Ortiz and Salinger [ITCS 2012] demonstrated that competitive ratio of canonical paging algorithms such as Least-Recently-Used (LRU) and Furthest-In-Future (FIF) grows with the length of the input. In this paper, we answer an open question about the existence of competitive multicore paging algorithms in the negative. Specifically, we show that all lazy algorithms, which include all practical algorithms, cannot be competitive against the optimal offline algorithm. © 2020 Owner/Author.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Proximity-Aware Directory-based Coherence for Multi-core Processor architectures 07

Proximity-Aware Directory-based Coherence for Multi-core Pro...

引用

19th annual symposium on parallelism in algorithms and architectures

作者： Brown, Jeffery A. Kumar, Rakesh Tullsen, Dean Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA

ISBN: (纸本)9781595936677

As the number of cores increases on chip multiprocessors, coherence is fast becoming a central issue for multi-core performance. This is exacerbated by the fact that interconnection speeds are not scaling well with technology. This paper describes mechanisms to accelerate coherence for a multi-core architecture that has multiple private L2 caches and a scalable point-to-point interconnect between cores. These techniques exploit the differences in geometry between chip multiprocessors and traditional multiprocessor architectures. Directory-based protocols have been proposed as a scalable alternative to snoop-based protocols. In this paper, we discuss implementations of coherence for CMPs and propose and evaluate a novel directory-based coherence scheme to improve the performance of parallel programs on such processors. Proximity-aware coherence accelerates read and write misses by initiating cache-to-cache transfers from the spatially closest sharer. This has the dual benefit of eliminating unnecessary accesses to off-Chip memory, and minimizing the distance over which communicated data moves across the network. The proposed schemes result in speedups up to 74.9% for our workloads.

关键词： Chip Multiprocessors Coherence

来源：评论

学校读者我要写书评

暂无评论

Novel architectures for P2P applications: The continuous-discrete approach 03

Novel architectures for P2P applications: The continuous-dis...

引用

Fifteenth annual acm symposium on parallelism in algorithms and architectures

作者： Naor, Moni Wieder, Udi Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9781581136616

We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to processors. We demonstrate the power of these design rules by suggesting two new architectures, one for DHT (Distributed Hash Table) and the other for dynamic expander networks. The DHT network, which we call Distance Halving allows logarithmic routing and load, while preserving constant degrees. It offers an optimal tradeoff between the degree and the dilation in the sense that degree d guarantees a dilation of O(logdn). Another advantage over previous constructions is its relative simplicity. A major new contribution of this construction is a dynamic caching technique that maintains low load and storage even under the occurrence of hot spots. Our second construction builds a network that is guaranteed to be an expander. The resulting topologies are simple to maintain and implement. Their simplicity makes it easy to modify and add protocols. A small variation yields a DHT which is robust against random faults. Finally we show that, using our approach, it is possible to construct any family of constant degree graphs in a dynamic environment, though with worst parameters. Therefore we expect that more distributed data structures could be designed and implemented in a dynamic environment.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

The effect of communication costs in solid-state quantum computing architectures 03

The effect of communication costs in solid-state quantum com...

引用

Fifteenth annual acm symposium on parallelism in algorithms and architectures

作者： Copsey, Dean Oskin, Mark Metodiev, Tzvetan Chong, Frederic T. Chuang, Isaac Kubiatowicz, John University of Washington Seattle WA United States University of California at Davis Davis CA United States University of California Berkeley Berkeley CA United States

ISBN: (纸本)9781581136616

Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed under idealized assumptions without important physical constraints in mind. In this paper, we analyze two key constraints: the short spatial distance of quantum interactions and the short temporal life of quantum data. In particular, quantum computations must make use of extremely robust error correction techniques to extend the life of quantum data. We present optimized spatial layouts of quantum error correction circuits for quantum bits embedded in silicon. We analyze the complexity of error correction under the constraint that interaction between these bits is near neighbor and data must be propagated via swap operations from one part of the circuit to another. We discover two interesting results from our quantum layouts. First, the recursive nature of quantum error correction circuits requires a additional communication technique more powerful than near-neighbor swaps - too much error accumulates if we attempt to swap over long distances. We show that quantum teleportation can be used to implement recursive structures. We also show that the reliability of the quantum swap operation is the limiting factor in solid-state quantum computation.

关键词： Fault tolerant computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：