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

International Conference on Computer Science and Network Technology

作者： Jia Guo Chuanchang Liu Junliang Chen Huifeng Sun State Key lab of Networking and Switching Technology Beijing University of Posts & Telecommunications Research Institute of Petroleum Exploration & Development

ISBN: (纸本)9781467329637

Video sharing system for mobile devices is an important mobile service which can be used to share videos with others. Scalability is critical to the system. Cache technology, which employs cache servers to offload the original server, has been proposed to attack the scalability problem. Traditional replacement algorithms for cache technology are not suitable for the video sharing system. In this paper, we proposed a cache replacement algorithm called S-LRU for the system. In S-LRU, we consider the size difference of videos. Experimental results demonstrate that S-LRU outperforms the other algorithms.

关键词： Mobile Internet Video Sharing RESTful Web Service Cache replacement algorithm Video sharing mobile Internet Mobile devices replacement algorithm Cache memory cache replacement Videotapes

来源：评论

学校读者我要写书评

暂无评论

Research on replacement algorithm of Dynamic Page Storage Management

Research on Replacement Algorithm of Dynamic Page Storage Ma...

引用

作者： Yongchao Zhao Ying Xie Haifei Qin School of Information Scince & Technology Chuxiong Normal University

This paper takes the dynamic page storage management in OS as the research aspect, and discusses the common three algorithms of FIFO, LRU and OPT. And put forward the idea of "vertically and horizontally", use pseudo code to implement these three algorithm. Although the algorithm can be improved, but our idea of unifying the three algorithms is of great significance.

关键词： replacement algorithm Vertically Horizontally Page storage management

来源：评论

学校读者我要写书评

暂无评论

Tradeoff Between Capacity and Cost: Maximizing User Recruitment Through Collaboration in Mobile Crowdsensing

引用

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS 2025年第1期12卷 295-305页

作者： Chi, Dingwen Tao, Jun Wang, Haotian Xu, Yifan Southeast Univ Sch Cyber Sci Engn Nanjing 210000 Peoples R China Southeast Univ Key Lab CNII MOE Nanjing 210000 Peoples R China Purple Mt Labs Network & Commun Secur Nanjing 210000 Peoples R China

Utilizing mobile crowdsensing (MCS) for data collection and analysis has become a prominent paradigm in the Internet of Things (IoTs). However, the existing research predominantly focuses on platform-user interactions, often neglecting the potential for user collaboration, which is crucial for improving data quality and task efficiency. In practical applications, mobile users tend to cooperate with familiar individuals based on their preferences in sensing tasks. To tackle this issue, we introduce a novel MCS model that integrates user cooperation, significantly enhancing the system's overall effectiveness. Specifically, users' capabilities and costs are synthesized and managed through a cooperation degree matrix. Additionally, cooperation is updated based on historical behaviors and user preferences. To incentivize user participation, currencies are employed for recruitment. Within this framework, we investigate the maximum collaborative user selection (MCUS) problem, which is dedicated to the problem of maximizing the amount of recruitment under user cooperation. The MCUS problem is proved to be an NP-hard problem and thus intractable. To address this, we propose the minimum weighted cost replacement (MWCR) algorithm. Experimental results demonstrate that the MWCR algorithm exhibits low complexity and high efficiency across various scales, making it an excellent solution for collaborative crowd recruitment.

关键词： Collaboration mobile crowdsensing (MCS) mobile crowdsensing (MCS) replacement algorithm replacement algorithm user recruitment user recruitment

来源：评论

学校读者我要写书评

暂无评论

replacement algorithms for object caching 98

Replacement algorithms for object caching

引用

1998 ACM Symposium on Applied Computing, SAC 1998

作者： Hosseini-Khayat, Saied Washington University in St. Louis United States

ISBN: (纸本)0897919696

We propose three object replacement algorithms that consider the varying size and cost of objects. These algorithms can be useful in network caching, where cache objects of varying sizes are fetched from various distances in a network. We evaluate the performance of these algorithms by trace-driven simulation using three different cost models. © 1998 ACM.

关键词： replacement algorithm object caching network caching generalized caching Web caching

来源：评论

学校读者我要写书评

暂无评论

Pair of replacement algorithms MFMR and AF-LRU on L1 and L2 Cache for Proxy Server

Pair of Replacement Algorithms MFMR and AF-LRU on L1 and L2 ...

引用

2009 Annual IEEE India Conference

作者： Gupta, Richa Tokekar, Sanjiv Acropolis Inst Technol & Res Indore Madhya Pradesh India Inst Engn & Technol Elect & Telecom Engn Indore Madhya Pradesh India

ISBN: (纸本)9781424448586

Access to the internet and WWW is growing extensively, which results in heavy network traffic. To reduce the network traffic proxy server is used. Proxy server reduces the load of server. If the cache replacement algorithm of proxy server's cache is efficient then proxy server will be helpful to reduce the network traffic in more efficient manner. In this paper we are considering proxy server cache to be Level 1 (L1) cache and storage cache of proxy server to be Level 2 (L2) cache. For collecting the real trace proxy server is used in an organization. Log of proxy server gives the information of various URLs accessed by various clients with time. For performing experiments various URLs were given a numeric identity. This paper analyzes the behavior of various replacement algorithms. The replacement algorithms taken into consideration are Least Recently Used (LRU), Least Frequently Used (LFU), First In First Out (FIFO). This paper proposes a new replacement algorithm named MFMR (Most Frequent with Maximum Reusability) for L1 which works about 16% better than existing algorithms considered in this paper. This paper also proposes a new replacement policy for L2 named AF_LRU (Average Frequency, Least Recently Used). Simulation results shows that pair of MFMR and AF-LRU is approximately 28% better than other existing pairs of replacement algorithms considered.

关键词： Level 1 Cache (L1) Level 2 Cache (L2) web access pattern replacement algorithm Proxy server client

来源：评论

学校读者我要写书评

暂无评论

Web proxy cache replacement scheme based on back-propagation neural network

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2008年第9期81卷 1539-1558页

作者： Cobb, Jake ElAarag, Hala Stetson Univ Dept Math & Comp Sci Deland FL 32723 USA

Web proxy caches are used to reduce the strain of contemporary web traffic on web servers and. network bandwidth providers. In this research, a novel approach to web proxy cache replacement which utilizes neural networks for replacement decisions is developed and analyzed. Neural networks are trained to classify cacheable objects from real world data Sets using information known to be important in web proxy caching, such as frequency and recency. Correct classification ratios between 0.85 and 0.88 are obtained both for data used for training and data not used for training. Our approach is compared with Least Recently Used (LRU), Least Frequently Used (LFU) and the optimal case which always rates an object with the number Of future requests. Performance is evaluated in simulation for various neural network structures and cache conditions. The final neural networks achieve hit rates that are 86.60% of the optimal in the worst case and 100% of the optimal in the best case. Byte-hit rates are 93.36% of the optimal in the worst case and 99.92% of the optimal in the best case. We examine the input-to-output mappings of individual neural networks and analyze the resulting caching strategy with respect to specific cache conditions. (C) 2007 Elsevier Inc. All rights reserved.

关键词： web proxies proxy caching neural networks replacement algorithm performance evaluation training and simulation

来源：评论

学校读者我要写书评

暂无评论

Partition-Based Cache replacement to Manage Shared L2 Caches

引用

Chinese Journal of Electronics 2014年第3期23卷 464-467页

作者： FANG Juan WANG Jing LI Chengyan YAO Zhicheng KE Weimao College of Computer Science Beijing University of Technology College of Information Engineering Capital Normal University College of Computing and Informatics Drexel University

The Least recently used(LRU) replacement has been widely employed by on-chip shared caches. With the increase of cache associativity, the performance gap between LRU and theoretical optimal replacement algorithm is significant, motivating us to design alternative replacement algorithms to improve cache performance. We propose a Partition-based cache replacement(PCR) algorithm to manage multi-core shared L2 caches. PCR takes into consideration recency and frequency information of cache access, and cache resource interference among multiple competing applications. PCR is effective to filter out the less frequently reused blocks through a dynamic insertion/promotion policy based on the target partitions, and ensures that some fraction of the working set is retained in the cache to contribute to more hits. Our evaluation shows that PCR improves performance of an 8-core system by an average of 11.3% over LRU-based cache.

关键词： Multi-core Shared cache replacement algorithm Cache partition

来源：评论

学校读者我要写书评

暂无评论

An Efficacious Page replacement Technique for NAND Flash Memory

An Efficacious Page Replacement Technique for NAND Flash Mem...

引用

International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS)

作者： Dubey, Kumkum Kumar, Shailesh Singh, P. K. Madan Mohan Malaviya Univ Technol Comp Sci & Engn Gorakhpur Uttar Pradesh India

ISBN: (纸本)9781509032945

An Efficacious Page replacement Techniques(EPRT) customized for distinct types of NAND flash Memory with various cost ratios of write method to read method, is describe in this paper. In main memory, all dirty victim pages is break-down into fixed number of flash-pages. EPRT enroll a weighted value to every victim page and select a less weighted value as a victim page. Dirty page are two types, hot dirty page and cold dirty page. The very recent reference method is used to break-down the dirty victim page into hot dirty page and cold once. When a dirty victim is selected, EPRT writes only the dirty page within the victim page-block.

关键词： Flash memory replacement algorithm Window size

来源：评论

学校读者我要写书评

暂无评论

A General Approach to Scalable Buffer Pool Management

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2016年第8期27卷 2182-2195页

作者： Ding, Xiaoning Shan, Jianchen Jiang, Song New Jersey Inst Technol Dept Comp Sci Newark NJ 07041 USA Wayne State Univ Dept Elect & Comp Engn Detroit MI 48202 USA

In high-end data processing systems, such as databases, the execution concurrency level rises continuously since the introduction of multicore processors. This happens both on premises and in the cloud. For these systems, a buffer pool management of high scalability plays an important role on overall system performance. The scalability of buffer pool management is largely determined by its data replacement algorithm, which is a major component in the buffer pool management. It can seriously degrade the scalability if not designed and implemented properly. The root cause is its use of lock-protected data structures that incurs high contention with concurrent accesses. A common practice is to modify the replacement algorithm to reduce the contention on the lock(s), such as approximating the LRU replacement with the CLOCK algorithm or partitioning the data structures and using distributed locks. Unfortunately, the modification usually compromises the algorithm's hit ratio, a major performance goal. It may also involve significant effort on overhauling the original algorithm design and implementation. This paper provides a general solution to improve the scalability of a buffer pool management using any replacement algorithms for the data processing systems on physical on-premises machines and virtual machines in the cloud. Instead of making a difficult trade-off between the high hit ratio of a replacement algorithm and the low lock contention of its approximation, we design a system framework, called BP-Wrapper, that eliminates almost all lock contention without requiring any changes to an existing algorithm. In BP-Wrapper, we use a dynamic batching technique and a prefetching technique to reduce lock contention and to retain high hit ratio. The implementation of BP-Wrapper in PostgreSQL adds only about 300 lines of C code. It can increase the throughput by up to two folds compared with the replacement algorithms with lock contention when running TPC-C-like and TPC-W-l

关键词： Buffer pool management replacement algorithm lock contention multi-core

来源：评论

学校读者我要写书评

暂无评论

A scalable and efficient cooperative system for Web caches

引用

IEEE CONCURRENCY 2000年第3期8卷 56-62页

作者： Menaud, JM Issarny, V Banâtre, M IRISA INRIA Rennes F-35042 Rennes France Inst Natl Rech Informat & Automat F-78153 Le Chesnay France

The authors propose two novel algorithms that exploit the latest reports about Web usage. From the standpoint of cooperating caches, they propose a cooperation protocol that minimizes the associated network bandwidth,... 详细信息

关键词： Cache Management Caching Effectiveness Cooperative Caching replacement algorithm Simulation World Wide Web

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：