algorithm that change a data structure without inflicting expensive cache misses

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



Hi,

This question is raised Quick Quiz 9.23 and I think it is impossible because
any changes on a data structure will inevitably inflict cache miss (on other
CPUs). The only way we can help is to make the reader *ignore* the cache miss,
or do the invalidation proactively.

I cannot think of any existing algorithm. Can anyone provide any references
(if that really exist)?

Thanks,
Yubin
--
To unsubscribe from this list: send the line "unsubscribe perfbook" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html



[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Index of Archives]     [Linux NFS]     [Linux NILFS]     [Linux USB Devel]     [Video for Linux]     [Linux Audio Users]     [Yosemite News]     [Linux Kernel]     [Linux SCSI]

  Powered by Linux