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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

768 篇 会议
27 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

384 篇 工学
- 362 篇 计算机科学与技术...
- 194 篇 软件工程
- 59 篇 信息与通信工程
- 51 篇 电气工程
- 27 篇 电子科学与技术（可...
- 18 篇 控制科学与工程
- 13 篇 材料科学与工程（可...
- 7 篇 安全科学与工程
- 7 篇 网络空间安全
- 4 篇 生物医学工程（可授...
- 3 篇 光学工程
- 3 篇 动力工程及工程热...
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 土木工程
- 2 篇 交通运输工程
101 篇 理学
- 95 篇 数学
- 18 篇 统计学（可授理学、...
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
72 篇 管理学
- 51 篇 管理科学与工程(可...
- 38 篇 工商管理
- 24 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
7 篇 医学
- 7 篇 临床医学
- 2 篇 基础医学(可授医学...
3 篇 法学
- 3 篇 社会学
1 篇 教育学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

121 篇 computer science
94 篇 concurrent compu...
94 篇 distributed comp...
83 篇 distributed data...
79 篇 parallel process...
78 篇 application soft...
76 篇 databases
74 篇 database systems
73 篇 parallel process...
55 篇 delay
53 篇 distributed comp...
52 篇 processor schedu...
45 篇 computer archite...
43 篇 transaction data...
41 篇 algorithm design...
40 篇 costs
39 篇 relational datab...
35 篇 protocols
34 篇 computational mo...
33 篇 hardware

机构

6 篇 ibm thomas j. wa...
5 篇 ieee
4 篇 school of comput...
4 篇 department of co...
4 篇 department of co...
3 篇 center for paral...
3 篇 department of co...
3 篇 lip ens-lyon lyo...
3 篇 department of co...
2 篇 department of co...
2 篇 institute of inf...
2 篇 department of co...
2 篇 institute of inf...
2 篇 computer systems...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of el...
2 篇 department of co...
2 篇 school of comput...

作者

7 篇 a. choudhary
6 篇 a. boukerche
5 篇 j. saltz
4 篇 s.k. das
4 篇 t. kurc
4 篇 a. el abbadi
3 篇 a. rau-chaplin
3 篇 o. wolfson
3 篇 f. dehne
3 篇 p.s. yu
3 篇 a. singh
3 篇 casanova henri
3 篇 c. liu
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 d. agrawal
3 篇 x. shen
2 篇 grove matthew
2 篇 a. burger

语言

794 篇 英文
2 篇 其他

检索条件"任意字段=Proceedings of the first international symposium on Databases in parallel and distributed systems"

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

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

详细简洁

排序：

parallel simulation of stochastic reward nets using theatre 21

Parallel simulation of stochastic reward nets using theatre

引用

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

作者： Franco Cicirelli Libero Nigro CNR - National Research Council of Italy Italy University of Calabria Italy

ISBN: (纸本)9781665433266

This work aims at the development of tools for supporting modelling and analysis of timed systems by Stochastic Reward Nets (SRN). In a first approach it was proposed and experimented a formal reduction of SRN over Timed Automata (TA) in the context of the Uppaal popular toolbox. The reduction has the merit to allow both exhaustive model checking of an SRN model, useful for the assessment of qualitative properties (e.g., absence of deadlocks, occurrence of particular event sequences etc.), and quantitative analysis through the statistical model checker, which is based on simulations. However, although Uppaal enabled formal reasoning on the semantics of SRN, its practical usage suffers of scalability problems, that is it can introduce severe limitations in time and space when studying complex models. To cope with this problem, this paper describes a Java implementation of the SRN operational core engine, using the lock-free and efficient Theatre actor system which permits the parallel simulation of large models. The realization can be used for functional property checking on an untimed version of a source SRN model, and quantitative estimation of measurables through simulations. The paper discusses the design and implementation of the core engine of SRN on top of Theatre, together with supported intuitive configuration process of an SRN model, and reports some experimental results using a scalable grid computing model. The experiments confirm Theatre/SRN are capable of exploiting the potential of modern multi-core machines and can deliver good execution performances on large models.

关键词： theatre Java stochastic reward nets actors high-performance computing performability analysis

来源：评论

学校读者我要写书评

暂无评论

Large scale querying and processing for property graphs PhD symposium 22

Large scale querying and processing for property graphs PhD ...

引用

22nd international Workshop on Design, Optimization, Languages and Analytical Processing of Big Data, DOLAP 2020

作者： Ragab, Mohamed Data Systems Group University of Tartu Tartu Estonia

Recently, large scale graph data management, querying and processing have experienced a renaissance in several timely application domains (e.g., social networks, bibliographical networks and knowledge graphs). However, these applications still introduce new challenges with large-scale graph processing. Therefore, recently, we have witnessed a remarkable growth in the prevalence of work on graph processing in both academia and industry. Querying and processing large graphs is an interesting and challenging task. Recently, several centralized/distributed large-scale graph processing frameworks have been developed. However, they mainly focus on batch graph analytics. On the other hand, the state-of-the-art graph databases can't sustain for distributed efficient querying for large graphs with complex queries. In particular, online large scale graph querying engines are still limited. In this paper, we present a research plan shipped with the state-of-the-art techniques for large-scale property graph querying and processing. We present our goals and initial results for querying and processing large property graphs based on the emerging and promising Apache Spark framework, a defacto standard platform for big data processing. In principle, the design of this research plan is revolving around two main goals. The first goal focuses on designing an adequate and efficient graph-based storage backend that can be integrated with the Apache Spark framework. The second goal focuses on developing various Graph-aware optimization techniques (e.g., graph indexing, graph materialized views), and extending the default relational Spark Catalyst optimizer with Graph-aware cost-based optimizations. Achieving these contributions can significantly enhance the performance of executing graph queries on top of Apache Spark. © Copyright 2020 for this paper held by its author(s).

关键词： Graph databases

来源：评论

学校读者我要写书评

暂无评论

d'Artagnan: A Trusted NoSQL Database on Untrusted Clouds 38

d'Artagnan: A Trusted NoSQL Database on Untrusted Clouds

引用

IEEE 38th international symposium on Reliable distributed systems (SRDS)

作者： Pontes, Rogerio Maia, Francisco Vilaca, Ricardo Machado, Nuno INESC TEC HASLab High Assurance Software Lab Porto Portugal Univ Minho Braga Portugal Teradata San Diego CA USA INESC TEC Porto Portugal

ISBN: (纸本)9781728142227

Privacy sensitive applications that store confidential information such as personal identifiable data or medical records have strict security concerns. These concerns hinder the adoption of the cloud. With cloud providers under the constant threat of malicious attacks, a single successful breach is sufficient to exploit any valuable information and disclose sensitive data. Existing privacy-aware databases mitigate some of these concerns, but sill leak critical information that can potently compromise the entire system's security. This paper proposes d'Artagnan, the first privacy-aware multi-cloud NoSQL database framework that renders database leaks worthless. The framework stores data as encrypted secrets in multiple clouds such that i) a single data breach cannot break the database's confidentiality and ii) queries are processed on the server-side without leaking any sensitive information. d'Artagnan is evaluated with industry-standard benchmark on marketleading cloud providers.

关键词： Multi party Privacy aware databases Secure query processing

来源：评论

学校读者我要写书评

暂无评论

Biometric systems with Multiuser Access Structures

Biometric Systems with Multiuser Access Structures

引用

IEEE international symposium on Information Theory (ISIT)

作者： Chou, Remi A. Wichita State Univ Dept Elect Engn & Comp Sci Wichita KS 67260 USA

ISBN: (纸本)9781538692912

We propose a model for biometric systems with a multiuser access structure, where after enrollment only pre-defined authorized sets of participants are allowed to access the system upon presenting their biometrics. Two types of system design are considered for the enrollment. In the first one, the participants must simultaneously present their biometrics to enroll in the system. In the second one, each participant can individually enroll in the system, which is more convenient for systems with a large number of participants. For these two types of enrollment and the presence of a multiuser access structure, the fundamental trade-off between security and privacy leakage is studied.

关键词： Privacy Decoding Encoding distributed databases Biological system modeling Authentication Indexes

来源：评论

学校读者我要写书评

暂无评论

UMR-EC: A Unified and Multi-Rail Erasure Coding Library for High-Performance distributed Storage systems 19

UMR-EC: A Unified and Multi-Rail Erasure Coding Library for ...

引用

28th international symposium on High-Performance parallel and distributed Computing (ACM HPDC)

作者： Shi, Haiyang Lu, Xiaoyi Shankar, Dipti Panda, Dhabaleswar K. Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9781450366700

distributed storage systems typically need data to be stored redundantly to guarantee data durability and reliability. While the conventional approach towards this objective is to store multiple replicas, today's unprecedented data growth rates encourage modern distributed storage systems to employ Erasure Coding (EC) techniques, which can achieve better storage efficiency. Various hardware-based EC schemes have been proposed in the community to leverage the advanced compute capabilities on modern data center and cloud environments. Currently, there is no unified and easy way for distributed storage systems to fully exploit multiple devices such as CPUs, GPUs, and network devices (i.e., multi-rail support) to perform EC operations in parallel;thus, leading to the under-utilization of the available compute power. In this paper, we first introduce an analytical model to analyze the design scope of efficient EC schemes in distributed storage systems. Guided by the performance model, we propose UMR-EC, a Unified and Multi-Rail Erasure Coding library that can fully exploit heterogeneous EC coders. Our proposed interface is complemented by asynchronous semantics with optimized metadata-free scheme and EC rate-aware task scheduling that can enable a highly-efficient I/O pipeline. To show the benefits and effectiveness of UMR-EC, we re-design HDFS 3.x write/read pipelines based on the guidelines observed in the proposed performance model. Our performance evaluations show that our proposed designs can outperform the write performance of replication schemes and the default HDFS EC coder by 3.7x - 6.1x and 2.4x - 3.3x, respectively, and can improve the performance of read with failure recoveries up to 5.1x compared with the default HDFS EC coder. Compared with the fastest available CPU coder (i.e., ISA-L), our proposed designs have an improvement of up to 66.0% and 19.4% for write and read with failure recoveries, respectively.

关键词： multi-rail erasure coding distributed storage systems high performance

来源：评论

学校读者我要写书评

暂无评论

Implementation and Analysis of distributed Relaxed Concurrent Queues in Remote Memory Access Model 13

Implementation and Analysis of Distributed Relaxed Concurren...

引用

13th international symposium on Intelligent systems (INTELS)

作者： Paznikov, A. A. Anenkov, A. D. St Petersburg Electrotech Univ LETI Ul Prof Popova 5 St Petersburg 197376 Russia

Remote memory access (RMA) technique is a very attractive way for improving efficiency of high-performance computations (HPC) and simplifying parallel program development. However, coming up with efficient concurrent data structures for distributed environments with deep hierarchy, such as computer clusters and data centres, is challenging. We propose a novel approach to design distributed concurrent data structures. The core idea behind the approach is relaxation of the order of executed operations. For example, a relaxed priority queues only requires the elements returned by delete-min operation to be sufficiently close to the minimum. Similarly, in a relaxed queue or stack, the removed elements are close to the first or the last one, respectively. There are multiple evidences that, on most workloads, relaxed data structures outperform data structures with strict semantics and ensure acceptable degrees of operation reordering. In this work we approve our approach on the example of a distributed queue, evaluate its efficiency and compare it with the other implementations of distributed lists. (C) 2019 The Authors. Published by Elsevier B.V.

关键词： relaxed distributed queues relaxed concurrent data structures scalability remote memory access RMA MPI

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Massively parallel approximate distance sketches 33

Brief announcement: Massively parallel approximate distance ...

引用

33rd international symposium on distributed Computing, DISC 2019

作者： Dinitz, Michael Nazari, Yasamin Johns Hopkins University BaltimoreMD United States

ISBN: (纸本)9783959771269

Data structures that allow efficient distance estimation have been extensively studied both in centralized models and classical distributed models. We initiate their study in newer (and arguably more realistic) models of distributed computation: the Congested Clique model and the Massively parallel Computation (MPC) model. In MPC we give two main results: an algorithm that constructs stretch/space optimal distance sketches but takes a (small) polynomial number of rounds, and an algorithm that constructs distance sketches with worse stretch but that only takes polylogarithmic rounds. Along the way, we show that other useful combinatorial structures can also be computed in MPC. In particular, one key component we use is an MPC construction of the hopsets of [2]. This result has additional applications such as the first polylogarithmic time algorithm for constant approximate single-source shortest paths for weighted graphs in the low memory MPC setting. © Michael Dinitz and Yasamin Nazari.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Performance and Stability Analysis of the Task Assignment based on Guessing Size Routing Policy 27

Performance and Stability Analysis of the Task Assignment ba...

引用

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

作者： Bachmat, Eitan Doncel, Josu Sarfati, Hagit Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Univ Basque Country UPV EHU Dept Appl Math Stat & Operat Res Leioa 48940 Spain Ben Gurion Univ Negev Dept Ind Engn IL-84105 Beer Sheva Israel

ISBN: (纸本)9781728149516;9781728149509

In a system formed by parallel servers and one dispatcher, we study the Task Assignment based on Guessing Size (TAGS) policy, an open loop task assignment policy where jobs are non-preemptive, servers are first-Come-first-Served and the size of incoming jobs is not known. This policy works as follows: all the incoming jobs are routed to the first server and jobs that complete service before s(1) units of time leave the system, but jobs that do not complete service before s(1) are killed and they are routed to the second server, where the service starts from scratch. Likewise, jobs that are executed in server i, if they complete service before si units of time, leave the system, whereas jobs that do not complete service before si units of time are killed and routed to the next server. For an arbitrary job size distribution, we provide a necessary and sufficient condition for the stability of a system operating under the TAGS policy. We also analyze the performance of the optimal TAGS policy, i.e., when the cutoffs s(1), s(2), ... are chosen to minimize the waiting time of jobs for an arbitrary job size distribution and we show that it is lower bounded by the performance of the TAGS policy where the maximum queue length is minimized divided by the number of servers minus one. For Bounded Pareto distributed job sizes, we consider the asymptotic regime where the largest job size tends to infinity and we show that, when the system load is less than one, the performance of the optimal TAGS policy is, at most, two times worst than the performance of the optimal SITA policy, which a routing policy where the size of jobs is known. This result shows that the penalty caused by not knowing the size of incoming jobs is upper bounded by a factor of 2. For a higher system load, we show that the order of magnitude of the performance of the optimal TAGS policy in the asymptotic regime depends on the number of spare servers, i.e., the difference between the number of servers in the s

关键词： Queueing theory parallel Servers Heavy-tailed distributions

来源：评论

学校读者我要写书评

暂无评论

OO-VR: NUMA Friendly Object-Oriented VR Rendering Framework For Future NUMA-Based Multi-GPU systems 19

OO-VR: NUMA Friendly Object-Oriented VR Rendering Framework ...

引用

46th international symposium on Computer Architecture (ISCA)

作者： Xie, Chenhao Xin, Fu Chen, Mingsong Song, Shuaiwen Leon Pacific Northwest Natl Lab Richland WA 99352 USA Univ Houston Houston TX 77004 USA Univ Houston ECE Dept ECMOS Lab Houston TX 77004 USA East China Normal Univ Sch Comp Sci & Software Engn Shanghai Peoples R China Univ Sydney Sydney NSW Australia

ISBN: (纸本)9781450366694

With the strong computation capability, NUMA-based multi-GPU system is a promising candidate to provide sustainable and scalable performance for Virtual Reality (VR) applications and deliver the excellent user experience. However, the entire multi-GPU system is viewed as a single GPU under the single programming model which greatly ignores the data locality among VR rendering tasks during the workload distribution, leading to tremendous remote memory accesses among GPU models (GPMs). The limited inter- GPM link bandwidth (e.g., 64GB/s for NVlink) becomes the major obstacle when executing VR applications in the multi-GPU system. By conducting comprehensive characterizations on different kinds of parallel rendering frameworks, we observe that distributing the rendering object along with its required data per GPM can reduce the inter-GPM memory accesses. However, this object-level rendering still faces two major challenges in NUMA-based multi- GPU system: (1) the large data locality between the left and right views of the same object and the data sharing among different objects and (2) the unbalanced workloads induced by the software- level distribution and composition mechanisms. To tackle these challenges, we propose object-oriented VR rendering framework (OO-VR) that conducts the software and hardware co-optimization to provide a NUMA friendly solution for VR multi-view rendering in NUMA-based multi-GPU systems. We first propose an object-oriented VR programming model to exploit the data sharing between two views of the same object and group objects into batches based on their texture sharing levels. Then, we design an object aware runtime batch distribution engine and distributed hardware composition unit to achieve the balanced workloads among GPMs and further improve the performance of VR rendering. Finally, evaluations on our VR featured simulator show that OO-VR provides 1.58x overall performance improvement and 76% inter-GPM memory traffic reduction over the s

关键词： graphics processing units multiprocessing systems object-oriented programming parallel processing rendering (computer graphics) virtual reality Variable reluctance Multiprocessing systems object oriented programming Rendering Graphics Processing Unit locality data virtual reality parallel PROCESSING (COMPUTERS) Rendering (computer graphics) Nonunified memory architecture Remote Memory object orientation

来源：评论

学校读者我要写书评

暂无评论

Lightweight Authentication for Fault-Tolerant Topic-Channels in Ad Hoc distributed systems 18

Lightweight Authentication for Fault-Tolerant Topic-Channels...

引用

27th ACM international symposium on High-Performance parallel and distributed Computing (HPDC)

作者： Behrens, Hans Walter Candan, K. Selcuk Arizona State Univ Tempe AZ 85281 USA

ISBN: (纸本)9781450358996

Many distributed systems assume participants are both performant and secure, characteristics offered by many cloud-based systems. However, scaling distributed techniques down to highly resource- or power-constrained contexts may require alternative approaches. One such context is the deployment of ad hoc distributed systems in insecure or uncontrolled areas, for example during disaster response activities. Providing reliable and secure service is exacerbated by the computational and power constraints imposed on these devices. In this work, we first introduce the concept of on-demand topic-channels. Then, we describe three message authentication protocols which provide secure, authenticated communication between participants and a coordinator, while also providing resilience from adversarial or accidental disruption. We leverage homomorphic hashing primitives to trade message secrecy against communication and computational costs. Finally, we assess these protocols, and show that our hash-based protocols provide significant efficiency improvements over traditional encryption-based approaches.

关键词： distributed systems homomorphic hashing messaging protocols

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：