Curve fitting based shared cache partitioning scheme for energy saving

Huang, Kai; Wang, Ke; Zhang, Xiaoxu; Yan, Xiao

doi:10.1587/elex.15.20180886

Cited by 9 publications

(10 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3.1 Example taken from Huang et al ( 2018) Huang et al (2018) provide an example of a curve which is divided into two subregions (Fig. 1).…”

Section: Worked Examplesmentioning

confidence: 99%

“…Spline regression or other piecewise functions are then often employed to obtain a sensible model, but these are not continuous function and often employ dummy variables to 'join' the separate functions together. For instance, Huang et al (2018) split a curve in two or three portions and derived functions for each portion. A computer program was used to analyse the curve and suggest the in ection points for each portion.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A method of joining piecewise functions to produce continuous functions of difficult data

Orszulik

2021

Preprint

View full text Add to dashboard Cite

This article describes a method of modelling data that involves splitting the curve into two (or more) and creating separate piecewise functions for each part; these functions are then concatenated via a linking function to create one overall continuous function that better describes the original data than is otherwise achievable. The linking function is able to do this by separating the original two (or more) subfunctions so that they are each active in only the relevant portion of the overall curve without the use of dummy variables. The final result is a continuous function in which it is straightforward to smooth the transition at the knot between the piecewise subfunctions. In addition, the piecewise subfunctions do not need to align at the knot since the degree of smoothing is very readily controlled. All types of functions may be concatenated so that the method is flexible and relatively simple to apply.

show abstract

“…3.1 Example taken from Huang et al ( 2018) Huang et al (2018) provide an example of a curve which is divided into two subregions (Fig. 1).…”

Section: Worked Examplesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A method of joining piecewise functions to produce continuous functions of difficult data

Orszulik

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The cache array has at least one more transparent cache for the DRAM. Since the cache array is physically or logically separated inside a multi-port architecture [12,13,14], it allows access to the memory interleaving scheme. Therefore, the destination and source addresses for the PIM operations can be simultaneously accessed.…”

Section: Cache Management Policies For Pimmentioning

confidence: 99%

Cache memory organization for processing in memory

Kim

Moon

Kim

et al. 2019

IEICE Electron. Express

View full text Add to dashboard Cite

A promising solution for assuring ultra-low latency in dataintensive application processing systems is processing in memory (PIM). Although most studies that have examined PIM-based computing systems have used cache memory, few have adequately explored a reasonable cache management policy for PIM. Therefore, this paper studies cache management policies for PIM-based computing systems and classifies existing PIM policies according to where they are located and how they are managed. To evaluate the policies, we model three types of PIM-based computing systems used in an in-memory system architecture. One model employs an internal-single cache, another an external cache hierarchy, and the other internal multiple cache-based PIM. We also simulate the performance and power consumption of the three models by their workloads, each with diverse characteristics. The experimental results show how cache policies influence the performance and power of PIM-based inmemory computing systems.

show abstract

“…8 Mbytes) [7], utilizing last-level cache (LLC) is more flexible and promising. Prior LLC management schemes partition cache to isolate memory traffic with different characteristics and optimize resource allocation [8,9,10], or propose the optimal cache line replacement policy by accurately estimating reuse distance [11,12,13,14,15,16,17,18,19]. Some propose both partition and replacement scheme [20,21].…”

Section: Introductionmentioning

confidence: 99%

IP-aware cache partition and replacement scheme for mobile computing devices

Kim

Lee

2019

IEICE Electron. Express

View full text Add to dashboard Cite

Mobile computing devices employ multiple task-specific IP cores to improve performance and energy. With the main memory shared by all CPU cores and IPs, it becomes a critical bottleneck as increasing multimedia IPs consume significant memory bandwidth whereas the improvement of memory bandwidth lags behind. We propose an IP-aware cache management scheme for the last-level cache to reduce the load on the main-memory, while satisfying QoS requirements of frame-based multimedia applications. Evaluation with CPU applications and 4 K/ 60 fps video streaming applications shows that our proposed scheme reduces DRAM bandwidth by 28.62% on average over LRU and completely avoids frame-drops.

show abstract

Curve fitting based shared cache partitioning scheme for energy saving

Cited by 9 publications

References 7 publications

A method of joining piecewise functions to produce continuous functions of difficult data

A method of joining piecewise functions to produce continuous functions of difficult data

Cache memory organization for processing in memory

IP-aware cache partition and replacement scheme for mobile computing devices

Contact Info

Product

Resources

About