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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

39 篇 期刊文献
38 篇 会议
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

76 篇 工学
- 51 篇 计算机科学与技术...
- 43 篇 电气工程
- 37 篇 信息与通信工程
- 10 篇 软件工程
- 4 篇 控制科学与工程
- 3 篇 仪器科学与技术
- 3 篇 电子科学与技术（可...
- 3 篇 交通运输工程
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 测绘科学与技术
- 1 篇 安全科学与工程
- 1 篇 网络空间安全
4 篇 理学
- 2 篇 物理学
- 1 篇 数学
- 1 篇 系统科学
4 篇 管理学
- 4 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
1 篇 医学
- 1 篇 临床医学
1 篇 军事学
- 1 篇 军队指挥学

主题

80 篇 distributed cach...
6 篇 stochastic geome...
6 篇 device-to-device...
5 篇 poisson point pr...
4 篇 content distribu...
4 篇 coverage probabi...
4 篇 cellular network...
4 篇 delay
3 篇 mobility
3 篇 dependability
3 篇 optimization
3 篇 d2d network
3 篇 icn
3 篇 wireless network...
3 篇 caching
2 篇 cache storage
2 篇 internet of thin...
2 篇 parallel process...
2 篇 storage optimisa...
2 篇 d2d communicatio...

机构

4 篇 shanghai jiao to...
2 篇 china univ min &...
2 篇 la trobe univ de...
2 篇 univ elect sci &...
2 篇 univ calif davis...
2 篇 huawei technol p...
2 篇 univ texas austi...
2 篇 tech univ dresde...
1 篇 suny buffalo dep...
1 篇 huawei france r&...
1 篇 univ fed flumine...
1 篇 univ montpellier...
1 篇 the hong kong po...
1 篇 univ sydney sch ...
1 篇 elect sci & tech...
1 篇 hes so valais si...
1 篇 lucent bell labs...
1 篇 princeton univ d...
1 篇 usyd nsw
1 篇 department of co...

作者

5 篇 zhang wei
4 篇 xiong jian
4 篇 malak derya
4 篇 al-shalash mazin
3 篇 sun yanjing
3 篇 liu bo
3 篇 gui lin
3 篇 li song
3 篇 wang bowen
3 篇 shi zhiping
3 篇 cao qi
2 篇 wu dan
2 篇 andrews jeffrey ...
2 篇 pacitti esther
2 篇 el abbadi amr
2 篇 schwenteck paul
2 篇 agrawal divyakan...
2 篇 de oliveira dani...
2 篇 dhillon harpreet...
2 篇 guo pan-hong

语言

78 篇 英文
2 篇 其他

检索条件"主题词=distributed caching"

共 80 条记录，以下是61-70 订阅

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

详细简洁

排序：

THRCache: DRAM-NVM Multi-level Cache with Thresholded Heterogeneous Random Choices 23rd

THRCache: DRAM-NVM Multi-level Cache with Thresholded Hetero...

引用

23rd International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Tao, Tao Xiao, Zhiwen Wang, Jibin Shang, Jing Wu, Zhihui China Mobile Informat Technol Ctr Beijing 100033 Peoples R China

ISBN: (纸本)9789819708581;9789819708598

caching is essential for accelerating data access, balancing storage cluster load and improving quality of service. However, singlenode cache may become a bottleneck as the storage system scales up. distributed caching is proposed to provide caching services for largescale storage cluster. However, existed cache mechanisms based on cache partitioning or cache replication may lead to load imbalance and high coherency overhead. We propose THRCache, a multi-level heterogeneous distributed cache mechanism which combines the speed of DRAM with the high-capacity of NVM to cache more easily accessible data. THRCache implements cache allocation for different cache layers by independent hash functions, routes query with a threshold random heterogeneous selection, and introduces a prefetching mechanism based on data access correlation. In this paper, we implement a prototype of THRCache and demonstrate through experiments that THRCache has higher cache hit rate and throughput than existed distributed cache architectures under different workloads.

关键词： distributed caching DRAM-NVM Hybrid Storage Load Balance Cache Allocation Data Prefetching

来源：评论

学校读者我要写书评

暂无评论

NET Playground - A Multi-Functional Testbed for distributed Systems 12

NET Playground - A Multi-Functional Testbed for Distributed ...

引用

12th IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)

作者： Schwenteck, Paul Zimmermann, Sandra von Lengerke, Caspar Scheunert, Christian Fitzek, Frank H. P. Tech Univ Dresden Deutsch Telekom Chair Commun Networks Dresden Germany Tech Univ Dresden Chair Informat Theory & Machine Learning Dresden Germany Ctr Tactile Internet Human in the Loop CeTI Dresden Germany

ISBN: (纸本)9798350351866;9798350351859

Hardware testbeds play a crucial role in evaluating the energy consumption and performance of distributed systems. In this paper, we present a multi-functional testbed for distributed systems that is easily accessible, operable, and configurable. We describe the design, implementation, and orchestration of the testbed that consists of off-the-shelf devices with varying specifications, energy consumption, and network connectivity. Additionally, we provide all technical information in an opensource GitLab repository. Using the presented testbed, we evaluate in a specific test scenario the download time and energy consumption of a distributed caching system that operates using the InterPlanetary File System (IPFS) and the Multi Access Recoding System (MARS), an addition to IPFS using network coding. Our results show that an increase in the number of nodes in the network can significantly reduce download time for the user by 57%, while MARS is 10% faster than IPFS with less than 8 peers. The number of transmitting nodes does not affect the energy the user requires for the download process. Also, every node in the network requires less energy when more nodes are available. However, the overall energy required for the network rises significantly by 400%. Such network-wide observations are difficult to obtain in simulations or emulations, emphasizing the importance of using real testbeds to evaluate distributed systems.

关键词： Hardware testbed energy consumption distributed caching IPFS network performance analysis distributed architectures

来源：评论

学校读者我要写书评

暂无评论

Demo: Crowd-Cache-Popular Content for Free 14

Demo: Crowd-Cache-Popular Content for Free

引用

12th Annual International Conference on Mobile Systems, Applications, and Services (MobiSys)

作者： Thilakarathna, Kanchana Jiang, Fangzhou Mrabet, Sirine Kaafar, Mohamed Ali Seneviratne, Aruna Mohapatra, Prasant Univ New South Wales Kensington NSW Australia NICTA Sydney NSW Australia USYD Sydney NSW Australia INRIA France Le Chesnay France Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781450327930

Crowd-Cache is a novel crowd-sourced content caching system which provides cheap and convenient content access for mobile users. Our system exploits both transient colocation of devices and the spatial temporal correlation of content popularity, where users in a particular location and at specific times would be likely interested in similar content. We demonstrate the feasibility of Crowd-Cache system through a prototype implementation on Android smartphones.

关键词： distributed caching Crowd Sourcing Mobile Content Distribution

来源：评论

学校读者我要写书评

暂无评论

Improving files availability for BitTorrent using a diffusion model 23

Improving files availability for BitTorrent using a diffusio...

引用

23rd IEEE International Conference on Enabling Technologies, Infrastructure for Collaborative Enterprises (WETICE)

作者： Napoli, Christian Pappalardo, Giuseppe Tramontana, Emiliano Univ Catania Dipartimento Matemat & Informat I-95125 Catania Italy

ISBN: (纸本)9781479942497

The BitTorrent mechanism effectively spreads file fragments by copying the rarest fragments first. We propose to apply a mathematical model for the diffusion of fragments on a P2P in order to take into account both the effects of peer distances and the changing availability of peers while time goes on. Moreover, we manage to provide a forecast on the availability of a torrent thanks to a neural network that models the behaviour of peers on the P2P system. The combination of the mathematical model and the neural network provides a solution for choosing file fragments that need to be copied first, in order to ensure their continuous availability, counteracting possible disconnections by some peers.

关键词： Dependability distributed caching P2P neural networks wavelet analysis

来源：评论

学校读者我要写书评

暂无评论

Kaqudai: a Dependable Web Infrastructure made out of Existing Components

Kaqudai: a Dependable Web Infrastructure made out of Existin...

引用

22nd IEEE International WETICE Conference (WETICE)

作者： Giunta, Rosario Messina, Fabrizio Pappalardo, Giuseppe Tramontana, Emiliano Univ Catania Dipartimento Matemat & Informat I-95124 Catania Italy

ISBN: (纸本)9780769550022

An internet application typically consists of a business logic complemented by additional concerns, such as communication, security and higher level features such as dependability. We advocate the use of aspect orientation as an advanced concern separation technology, ensuring higher modularity and reusability of code. In this paper we show how such an approach can be put into practice, by enhancing an existing web application with a dependability layer, addressing availability, reliability and data integrity concerns. Specifically, we have produced a set of aspects and other suitable components which can be smoothly integrated into an existing web server, endowing it with the ability to redirect service requests under excessive load. Redirection may target either cloud-powered lightweight replicas of the main web server, or publicly exposed browsing caches from clients. Experiments were conducted on the W3C Jigsaw web server.

关键词： Dependability distributed caching aspect orientation

来源：评论

学校读者我要写书评

暂无评论

Performance of distributed Algorithms in DTNs: Towards an Analytical Framework for Heterogeneous Mobility

Performance of Distributed Algorithms in DTNs: Towards an An...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Picu, Andreea Spyropoulos, Thrasyvoulos Swiss Fed Inst Technol Commun Syst Grp Zurich Switzerland EURECOM Mobil Commun Biot France

ISBN: (纸本)9781424492688

Opportunistic or Delay Tolerant Networks (DTNs) are envisioned to complement existing wireless technologies (cellular, WiFi). Wireless peers communicate when in contact, forming a network "on the fly", whose connectivity graph is highly dynamic and only partly connected. Because of this stringent environment, solutions to common networking problems (routing, congestion control, etc.) in this context are greedy, choosing the best solution among the locally available ones. This shared trait motivates the common treatment of such greedy algorithms for DTNs and raises some interesting questions: Do they converge? How fast are they? Yet, existing models study individual solutions. Moreover, they often assume homogeneous node mobility. The study of real world traces reveals considerable heterogeneity and non-trivial structure in human mobility. While algorithms have been proposed, accounting for this heterogeneity, their analytical tractability is still a challenge. In this paper, we propose a new model for greedy DTN algorithms, supporting the full heterogeneity of node mobility. We provide closed form solutions for crucial performance metrics (delivery probability and delay) and prove necessary and sufficient conditions for algorithm convergence. For illustration, we apply our model to the content placement problem, a variant of distributed caching. We use real and synthetic mobility traces to validate our findings and examine the impact of mobility properties in depth.

关键词： Absorption Algorithm design and analysis Convergence Delay Markov processes Optimization Peer to peer computing analytical framework connectivity graph content placement problem delay tolerant networks delay tolerant networks distributed algorithm distributed algorithms distributed caching greedy DTN algorithm greedy algorithm heterogeneous mobility homogeneous node mobility human mobility mobility management (mobile radio) opportunistic networks synthetic mobility traces tractability wireless peers wireless technology

来源：评论

学校读者我要写书评

暂无评论

Adaptive caching Networks with Optimality Guarantees 16

Adaptive Caching Networks with Optimality Guarantees

引用

13th ACM SIGMETRICS/IFIP Performance Joint International Conference on Measurement and Modeling of Computer Science (ACM SIGMETRICS/IFIP)

作者： Ioannidis, Stratis Yeh, Edmund Northeastern Univ ECE 360 Huntington Ave409DA Boston MA 02115 USA

ISBN: (纸本)9781450342667

We study the problem of optimal content placement over a network of caches, a problem naturally arising in several networking applications, including ICNs, CDNs, and P2P systems. Given a demand of content request rates and paths followed, we wish to determine the content placement that maximizes the expected caching gain, i.e., the reduction of routing costs due to intermediate caching. The offline version of this problem is NP-hard and, in general, the demand and topology may be a priori unknown. Hence, a distributed, adaptive, constant approximation content placement algorithm is desired. We show that path replication, a simple algorithm frequently encountered in literature, can be arbitrarily suboptimal when combined with traditional eviction policies, like LRU, LFU, or FIFO. We propose a distributed, adaptive algorithm that performs stochastic gradient ascent on a concave relaxation of the expected caching gain, and constructs a probabilistic content placement within 1 - 1/e factor from the optimal, in expectation. Motivated by our analysis, we also propose a novel greedy eviction policy to be used with path replication, and show through numerical evaluations that both algorithms significantly outperform path replication with traditional eviction policies over a broad array of network topologies.

关键词： content-centric networks distributed caching adaptive caching path replication

来源：评论

学校读者我要写书评

暂无评论

Imposing Cache: Busy-Aware Cooperative Data caching in Edge-Cloud Environments 4

Imposing Cache: Busy-Aware Cooperative Data Caching in Edge-...

引用

4th European Symposium on Software Engineering (ESSE)

作者： Lim, Gyujeong Kang, Jihun Yu, Heonchang Korea Univ Seoul South Korea

ISBN: (纸本)9798400708817

Data caching and placement are essential for reducing latency and increasing performance. With the correct allocation, users can access frequently used data faster while reducing the load on network bandwidth and resources. However, with the ever changing virtual systems, caching methods must also adapt to fit in them. For example, cloud services no longer operate by only having a single powerful node such as a data center. Instead, services also deploy edge nodes, which can hold data closer to the users, thus reducing latency and improving quality. As a result, there are various studies and developments to make caching more efficient than ever. In this paper, we focus on what we call imposing cache, a method that allows nodes to cache on other nodes as if it were their own, as long as they are part of the same group we call EdgeGroup. Additionally, our method is busy-aware enabling cloud and edge nodes to check on each other's availability and adjust their decision making process so that unavailable nodes are not taken into consideration. Our method succeeded in reducing fetches from Cloud by around 33% compared to normal caching methods. Also, it reduced request completion time by around 3 minutes due to the fact that it could correctly identify busy nodes and suspend them accordingly.

关键词： self-aware distributed caching cache replacement data placement data retrieval edge-cloud

来源：评论

学校读者我要写书评

暂无评论

caching with Dual Costs 26

Caching with Dual Costs

引用

26th International Conference on World Wide Web (WWW)

作者： Dasgupta, Anirban Kumar, Ravi Sarlos, Tamas IIT Gandhinagar Palaj Gujarat India Google Mountain View CA 94043 USA

ISBN: (纸本)9781450349147

caching mechanisms in distributed and social settings face the issue that the items can frequently change, requiring the cached versions to be updated to maintain coherence. There is thus a trade-off between incurring cache misses on read requests and cache hits on update requests. Motivated by this we consider the following dual cost variant of the classical caching problem: each request for an item can be either a read or a write. If the request is read and the item is not in the cache, then a read-miss cost is incurred and if the request is write and the item is in the cache, then a write-hit cost is incurred. The goal is to design a caching algorithm that minimizes the sum of read-miss and write-hit costs. We study online and offline algorithms for this problem. For the online version of the problem, we obtain an efficient algorithm whose cost is provably close to near-optimal cost. This algorithm builds on online algorithms for classical caching and metrical task systems, using them as black boxes. For the offline version, we obtain an optimal deterministic algorithm that is based on a minimum cost flow. Experiments on real and synthetic data show that our online algorithm incurs much less cost compared to natural baselines, while utilizing cache even better;furthermore, they also show that the online algorithm is close to the offline optimum.

关键词： online algorithms competitive analysis hit-ratio caching distributed caching

来源：评论

学校读者我要写书评

暂无评论

NetCentric Geospatial SmartCache caching Geospatial Information, Infrastructure and Services

NetCentric Geospatial SmartCache Caching Geospatial Informat...

引用

Conference on Military Communications and Information Systems (MilCIS)

作者： Proctor, Alissa Kaing, Chhiu-Linn SMS Management & Technol Adelaide SA Australia

ISBN: (纸本)9781467357272;9781467357289

As Defence systems and capabilities become more reliant on computer network infrastructure to supply data, information and services to all elements of the Australian Defence Organisation, disconnection or degradation of the network poses a very real risk to continuity of service. The SMS SmartCache provides a distributed caching solution and operates transparently to the user with no changes required to the services or client applications. caching can be performed at multiple levels ensuring that a failure at one point of the network does not affect the rest of the network. Whilst SmartCache has been demonstrated to work with geospatial data and services, the underlying technology is readily adaptable to other domains.

关键词： network centric warfare service oriented architecture geospatial information services distributed caching

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：