Acceptable memory usage as a function of input size
I know that if a computation takes linear or linearithmic time based on the size of the input, that’s good, and if it takes quadratic time, then that’s not so good.
How can I improve my application’s memory use? [closed]
Closed 8 years ago.
Why not use unmanaged safe code in C#
There is an option in C# to execute code unchecked. It’s generally not advised to do so, as managed code is much safer and it overcomes a lot of problems.
Instruction vs data cache usage
Say I’ve got a cache memory where instruction and data have different cache memories (“Harvard architecture”). Which cache, instruction or data, is used most often? I mean “most often” as in time, not amount of data since data memory might be used “more” in terms of amount of data while instruction cache might be used “more often” especially depending on the program.
What is the point of using lists over vectors, in C++?
I’ve run 3 different experiments involving C++ lists and vectors.
Please help me understand the relationship between script file size and memory usage?
I am programming in PHP and I have an include file that I have to, well, include, as part of my script. The include file is 400 MB, and it contains an array of objects which are nothing more than configuration settings for a larger project. Here is an example of the contents:
Static vs. dynamic memory allocation – lots of constant objects, only small part of them used at runtime
Here are two options:
Static vs. dynamic memory allocation – lots of constant objects, only small part of them used at runtime
Here are two options:
Comparing performance of different C++ self-made tree data structures
I have two tree data-structures that I made in C++ , and they give a response for range queries/point queries in that program. I am using Ubuntu. I need help in understanding the way to compare the performance of these two data structures (for answering the query in that program) in external memory. How can I do this?
Comparing performance of different C++ self-made tree data structures
I have two tree data-structures that I made in C++ , and they give a response for range queries/point queries in that program. I am using Ubuntu. I need help in understanding the way to compare the performance of these two data structures (for answering the query in that program) in external memory. How can I do this?