假设有两个程序a.outb.out做同样的事情:对元素进行排序。 a.out实现QuickSort排序算法,这需要O(nlogn)时间和O(logn)内存,b.out实现BubbleSort排序算法,这需要O(n^2)时间和O(1)内存。我想对这两种算法之间的时间和内存比较有一些直观的了解,因此,是否有任何Linux命令来测量程序运行后的时间和内存使用情况?

最佳答案

在编程上,我将使用getrusage(),它使您能够测量单个函数,并且比timetop更详细。例如:

#include <sys/time.h>
#include <sys/resource.h>
#include <unistd.h>

int main (int argc, char *argv[])
{
    struct rusage start;
    struct rusage end;

    getrusage (RUSAGE_SELF, &start);    // get time at start

    some_function ();                   // Function to measure

    getrusage (RUSAGE_SELF, &end);      // get time at end

    printf ("System: %d usecs, User: %d usecs\n",
            end.ru_stime.tv_usec - start.ru_stime.tv_usec,
            end.ru_utime.tv_usec - start.ru_utime.tv_usec);
...
rusage结构包含以下内容:
struct rusage {
    struct timeval ru_utime;    // user time used
    struct timeval ru_stime;    // system time used
    long   ru_maxrss;           // maximum resident set size
    long   ru_ixrss;            // integral shared memory size
    long   ru_idrss;            // integral unshared data size
    long   ru_isrss;            // integral unshared stack size
    long   ru_minflt;           // page reclaims
    long   ru_majflt;           // page faults
    long   ru_nswap;            // swaps
    long   ru_inblock;          // block input operations
    long   ru_oublock;          // block output operations
    long   ru_msgsnd;           // messages sent
    long   ru_msgrcv;           // messages received
    long   ru_nsignals;         // signals received
    long   ru_nvcsw;            // voluntary context switches
    long   ru_nivcsw;           // involuntary context switches
};

关于c++ - Linux命令来检测程序的计算机资源使用情况,我们在Stack Overflow上找到一个类似的问题:https://stackoverflow.com/questions/15355978/

10-11 19:32
查看更多