Constructive combinatorics
Line (block) size choice for CPU cache memories
IEEE Transactions on Computers
Improving CISC instruction decoding performance using a fill unit
Proceedings of the 28th annual international symposium on Microarchitecture
Execution characteristics of desktop applications on Windows NT
Proceedings of the 25th annual international symposium on Computer architecture
Evaluation of Design Options for the Trace Cache Fetch Mechanism
IEEE Transactions on Computers - Special issue on cache memory and related problems
Adapting cache line size to application behavior
ICS '99 Proceedings of the 13th international conference on Supercomputing
A new algorithm for floorplan design
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A national trace collection and distribution resource
ACM SIGARCH Computer Architecture News
A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems
Artificial Intelligence Review
Row and column generation technique for a multistage cutting stock problem
Computers and Operations Research
Performance Evaluation of a Decoded Instruction Cache for Variable Instruction Length Computers
IEEE Transactions on Computers
Cache Line Impact on 3D PDE Solvers
ISHPC '02 Proceedings of the 4th International Symposium on High Performance Computing
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Performance Characterization of the Pentium® Pro Processor
HPCA '97 Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture
Tiny instruction caches for low power embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Micro-operation cache: a power aware frontend for variable instruction length ISA
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on low power
Circuit and microarchitectural techniques for reducing cache leakage power
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Computer Architecture, Fourth Edition: A Quantitative Approach
Computer Architecture, Fourth Edition: A Quantitative Approach
A one-shot configurable-cache tuner for improved energy and performance
Proceedings of the conference on Design, automation and test in Europe
Chip placement in a reticle for multiple-project wafer fabrication
ACM Transactions on Design Automation of Electronic Systems (TODAES)
DeFFS: Duplication-eliminated flash file system
Computers and Electrical Engineering
| Hi-index | 0.00 |
In this paper we study the problem of packing a sequence of objects into bins. The objects are all either divisible or indivisible and occur in accordance with a certain probability distribution. We would like to find the average number of entries wasted in a bin if objects are indivisible and the probability of splitting the last object in a bin if objects are divisible. We solve this problem under a unified formulation by modeling a packing process as a Markov chain whose state transition probabilities are derived from an application of the partitions of integers. An application of this study to instruction cache design shows that a line size of 16bytes has minimized the probability of splitting the last x86 instruction in a cache line. For micro-op cache design, a line size of four entries has minimized the number of entries wasted per line.