Talk:Bélády's anomaly

This is the talk page for discussing improvements to the Bélády's anomaly article.
This is not a forum for general discussion of the article's subject.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Computing: Software / CompSci Low‑importance

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles

Low

This article has been rated as Low-importance on the project's importance scale.

This article is supported by WikiProject Software (assessed as Low-importance).

This article is supported by WikiProject Computer science (assessed as Low-importance).

This article is supported by Computer hardware task force (assessed as Low-importance).

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Unnamed section

Should link to Lazlo Belady ?

The table in the article gets a little confusing. It appears from the table that the pages gets "moved" to a different frame for each consequtive timing, especially so when you labelled "Frame" at the side. I believe you are illustrating the FIFO queue data structure such that the head of the queue is the 'oldest' page and the tail of the queue the 'youngest' page.

By Phail_Saph,

The first chart is wrong. It will still lead to 10 interrupts. If you want an example that is correct the previous two charts in the history tab are correct.

I don't understand the table at all. cagliost 15:47, 19 May 2007 (UTC)[reply]

I don't understand the table me neither. It needs reconstruction considering an other visualization method for the memory frames —Preceding unsigned comment added by Teohaik (talk • contribs) 19:28, 12 January 2008 (UTC)[reply]

previously believed

 Previously, it was believed that an increase in the number of page frames
 would always provide the same number or fewer page faults.

i dont get the "fact" (?). the more data you have to hit the bigger is the chance you miss. eg smaller the chance you hit the stuff. its probability. it's an uproved claim and hard to believe one. Xchmelmilos (talk) 18:51, 24 April 2008 (UTC) for it makes no sense i have deleted it and instead of "he stated" i placed "proved". i don't wanna be an azz here. so please fixme if it is wrong. thought is bloody hard to believe someone believed that. Xchmelmilos (talk) 19:05, 24 April 2008 (UTC)[reply]

I don't really understand what you're trying to say. This certainly has nothing to do with probability; it's about carefully constructing relatively improbable requests to make bigger caches fail more often. And the "previously believed" bit does make sense, Belady's anomaly isn't exactly obvious. .froth. (talk) 00:58, 4 June 2010 (UTC)[reply]

I agree, the anomaly is far from obvious. The point is that for the same data set that needs to be used, you can get more page faults if you use more pages. This is quite weird, as you would expect to have to do less page replacement etc, resulting in fewer faults. If I understand your comment correctly, you (Xchmelmilos) seem to be referring to getting more misses when you have more data to fetch. That is obvious, but nothing to do with belady's anomaly, as far as I know. Correct me if I'm wrong. Chaos.squirrel (talk) 06:25, 23 June 2010 (UTC)[reply]