LRUmap - revision history

Dank at 22:49, 10 October 2022

2022-10-10T22:49:09Z

← Older revision		Revision as of 22:49, 10 October 2022
Line 1:		Line 1:
	O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[media:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]], spring 2010. VLHU (Volatile Least Heavily Used) is a replacement algorithm designed to allow large-scale changes in the tracked set over time, but to be resistant against a burst of new entries. These properties are desirable, for instance, when tracking entities in a network which can be temporarily overwhelmed by an attacker capable of spoofing, or tracking memory locations in a computer when non-temporal bursting traffic (say, a block of text being passed read only once by an [[online algorithm]]) is equivalent to the size of the cache.		O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[media:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]] at Georgia Tech, spring 2010. VLHU (Volatile Least Heavily Used) is a replacement algorithm designed to allow large-scale changes in the tracked set over time, but to be resistant against a burst of new entries. These properties are desirable, for instance, when tracking entities in a network which can be temporarily overwhelmed by an attacker capable of spoofing, or tracking memory locations in a computer when non-temporal bursting traffic (say, a block of text being passed read only once by an [[online algorithm]]) is equivalent to the size of the cache.

	Source code can be found at GitHub: http://github.com/dankamongmen/lrumap.		Source code can be found at GitHub: http://github.com/dankamongmen/lrumap.

Dank at 16:14, 10 May 2013

2013-05-10T16:14:22Z

← Older revision		Revision as of 16:14, 10 May 2013
Line 1:		Line 1:
	O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[media:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]], spring 2010. VLHU (Volatile Least Heavily Used) is a replacement algorithm designed to allow large-scale changes in the tracked set over time, but to be resistant against a burst of new entries. These properties are desirable, for instance, when tracking entities in a network which can be temporarily overwhelmed by an attacker capable of spoofing, or tracking memory locations in a computer when non-temporal bursting traffic (say, a block of text being passed read only once by an [[online algorithm]]) is equivalent to the size of the cache.		O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[media:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]], spring 2010. VLHU (Volatile Least Heavily Used) is a replacement algorithm designed to allow large-scale changes in the tracked set over time, but to be resistant against a burst of new entries. These properties are desirable, for instance, when tracking entities in a network which can be temporarily overwhelmed by an attacker capable of spoofing, or tracking memory locations in a computer when non-temporal bursting traffic (say, a block of text being passed read only once by an [[online algorithm]]) is equivalent to the size of the cache.

			Source code can be found at GitHub: http://github.com/dankamongmen/lrumap.

	==Origin==		==Origin==
	VLHU is a data structure of, to the best of my knowledge, my creation. It is a sufficiently trivial idea that I'm sure it's been invented and discarded countless times. I first used it in the Reflex Interceptor in 2003.		VLHU is a data structure of, to the best of my knowledge, my creation. It is a sufficiently trivial idea that I'm sure it's been invented and discarded countless times. I first used it in the Reflex Interceptor in 2003.

	~~Source code can be found at GitHub: http://github.com/dankamongmen/lrumap.~~
	[[Category: Projects]]		[[Category: Projects]]

Dank at 16:14, 10 May 2013

2013-05-10T16:14:12Z

← Older revision		Revision as of 16:14, 10 May 2013
Line 1:		Line 1:
	O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[media:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]], spring 2010.		O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[media:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]], spring 2010. VLHU (Volatile Least Heavily Used) is a replacement algorithm designed to allow large-scale changes in the tracked set over time, but to be resistant against a burst of new entries. These properties are desirable, for instance, when tracking entities in a network which can be temporarily overwhelmed by an attacker capable of spoofing, or tracking memory locations in a computer when non-temporal bursting traffic (say, a block of text being passed read only once by an [[online algorithm]]) is equivalent to the size of the cache.

			==Origin==
			VLHU is a data structure of, to the best of my knowledge, my creation. It is a sufficiently trivial idea that I'm sure it's been invented and discarded countless times. I first used it in the Reflex Interceptor in 2003.

	Source code can be found at GitHub: http://github.com/dankamongmen/lrumap.		Source code can be found at GitHub: http://github.com/dankamongmen/lrumap.
	[[Category: Projects]]		[[Category: Projects]]

Dank at 07:43, 18 May 2010

2010-05-18T07:43:34Z

← Older revision		Revision as of 07:43, 18 May 2010
Line 2:		Line 2:

	Source code can be found at GitHub: http://github.com/dankamongmen/lrumap.		Source code can be found at GitHub: http://github.com/dankamongmen/lrumap.
			[[Category: Projects]]

Dank at 05:54, 10 May 2010

2010-05-10T05:54:28Z

← Older revision		Revision as of 05:54, 10 May 2010
Line 1:		Line 1:
	O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[media:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]], spring 2010.		O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[media:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]], spring 2010.

			Source code can be found at GitHub: http://github.com/dankamongmen/lrumap.

Dank at 05:47, 10 May 2010

2010-05-10T05:47:09Z

← Older revision		Revision as of 05:47, 10 May 2010
Line 1:		Line 1:
	O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[~~File~~:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]], spring 2010.		O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[media:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]], spring 2010.

Dank at 05:46, 10 May 2010

2010-05-10T05:46:36Z

← Older revision		Revision as of 05:46, 10 May 2010
Line 1:		Line 1:
	O(1)-time LRU which grows more space-efficient as the number of LRU sets increases.		O(1)-time LRU which grows more space-efficient as the number of LRU sets increases, introduced by [[File:Cs7260final.pdf\|this paper]] from [[Grad school\|CS7260]], spring 2010.

Dank: Created page with 'O(1)-time LRU which grows more space-efficient as the number of LRU sets increases.'

2010-05-10T04:01:48Z

Created page with 'O(1)-time LRU which grows more space-efficient as the number of LRU sets increases.'

New page

O(1)-time LRU which grows more space-efficient as the number of LRU sets increases.