نتایج جستجو برای: access pattern

تعداد نتایج: 666151  

Journal: :J. Instruction-Level Parallelism 2011
Yasuo Ishii Mary Inaba Kei Hiraki

Hardware data prefetching is widely adopted to hide long memory latency. A hardware data prefetcher predicts the memory address that will be accessed in the near future and fetches the data at the predicted address into the cache memory in advance. To detect memory access patterns such as a constant stride, most existing prefetchers use differences between addresses in a sequence of memory acce...

Journal: :Int. Arab J. e-Technol. 2014
Gopalakrishna Kurup Raju Achuthan Nair Rajimol

Sequential Pattern Mining is an important data mining technique that finds out all frequent sequential patterns in a sequence database. Applications in wide range of important domains make Sequential Pattern Mining an interesting area of research. Conventional approach for sequential pattern mining treats each and every item in the sequence with equal importance and thus fails to reflect the in...

2010
Byunghyun Jang Dana Schaa Perhaad Mistry David Kaeli

The performance of data-parallel processing can be highly sensitive to any contention in memory. In contrast to multi-core CPUs which employ a number of memory latency minimization techniques such as multi-level caching and prefetching, Graphics Processing Units (GPUs) require that the data-parallel computations reference memory in a deterministic pattern in order to reap the benefits of these ...

2012
Mohammad Saiful Islam Mehmet Kuzu Murat Kantarcioglu

The advent of cloud computing has ushered in an era of mass data storage in remote servers. Remote data storage offers reduced data management overhead for data owners in a cost effective manner. Sensitive documents, however, need to be stored in encrypted format due to security concerns. But, encrypted storage makes it difficult to search on the stored documents. Therefore, this poses a major ...

Journal: :Inf. Process. Lett. 1993
Jeong Uk Kim Ho-Chang Tag Gon Kim

The problem of multidisk partial match file design is a file allocation problem among multiple independently accessible disks so that, for all possible partial match queries, maximal disk access concurrency can be obtained. Since this problem has been shown to be NP-hard, there are a few heuristic methods based upon the Disk Modulo (DM) allocation method [5,6,9]. The file systems proposed for t...

2008
Dinesh Rajan Christian Poellabauer Nitesh Chawla

Energy management mechanisms in resource constrained environments such as mobile systems are typically based on the current status of various system parameters such as utilization and quality of service requirements. Any knowledge gained about future system resource usage and other significant dynamics in the system can further lead to increased optimizations in such mechanisms. Future knowledg...

2002
Xiaozhe Wang Ajith Abraham Kate Smith-Miles

Web servers play a crucial role to convey knowledge and information to the end users. With the popularity of the WWW, discovering the hidden information about the users and usage or access pattern is critical to determine effective marketing strategies and to optimize the server usage or to accommodate future growth. Many of the currently available or conventional server analysis tools could pr...

2003
Avanti Nadgir Mahmut Kandemir Guangyu Chen Guilin Chen

Increasing leakage energy consumption is an important problem for SOC-based platforms as such platforms rely on large on-chip SRAMs. While most of the previous techniques focus on hardware based leakage optimization, in this paper, we present an application access pattern oriented strategy for reducing instruction cache leakage energy. This strategy keeps track of the dynamic transitions betwee...

Journal: :KES Journal 2006
Baoyao Zhou Siu Cheung Hui Alvis Cheuk M. Fong

Sequential access pattern mining discovers interesting and frequent user access patterns from web logs. Most of the previous studies have adopted Apriori-like sequential pattern mining techniques, which faced the problem on requiring expensive multiple scans of databases. More recent algorithms that are based on the Web Access Pattern tree (or WAP-tree) can achieve an order of magnitude faster ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید