WinFuture-Forum.de: Was Ist "prozessoraffinität" - WinFuture-Forum.de

Zum Inhalt wechseln

Beiträge in diesem Forum erhöhen euren Beitragszähler nicht.
Seite 1 von 1

Was Ist "prozessoraffinität"


#1 Mitglied ist offline   free 

  • Gruppe: aktive Mitglieder
  • Beiträge: 948
  • Beigetreten: 18. Dezember 04
  • Reputation: 0

geschrieben 20. Mai 2007 - 19:25

Habe nichts gescheites bei Google gefunden.

Kann mir das jemand mal erklären?
Eingefügtes Bild

Anzeige



#2 Mitglied ist offline   Com-In 

  • Gruppe: aktive Mitglieder
  • Beiträge: 365
  • Beigetreten: 08. April 07
  • Reputation: 0
  • Interessen:PC, Linux

geschrieben 20. Mai 2007 - 19:54

das spuckt die "exalead"-suchmaschine aus: >>> http://www.tecchanne...2541/index.html

#3 Mitglied ist offline   Sandokan 

  • Gruppe: aktive Mitglieder
  • Beiträge: 505
  • Beigetreten: 06. Mai 05
  • Reputation: 0

geschrieben 20. Mai 2007 - 22:28

Hallo, kann dir das so leider auch nicht sagen, habe aber was gefunden, ist jedoch auf englisch:

Processor affinity is a modification of the native central queue scheduling algorithm. Each task (be it process or thread) in the queue has a tag indicating its preferred / kin processor. At allocation time, each task is allocated to its kin processor in preference to others.

Processor affinity takes advantage of the fact that some remnants of a process may remain in one processor's state (in particular, in its cache) from the last time the process ran, and so scheduling it to run on the same processor the next time could result in the process running more efficiently than if it were to run on another processor.

Actual scheduling algorithm implementations vary in how strongly they will adhere to processor affinity. Under certain circumstances some implementations will allow a task to change to another processor if this is deemed to be most efficient under the circumstances. An obvious example involves two processor-intensive tasks (A & B) having affinity to one processor while another processor lies unused. Many algorithms would shift task B to the second processor in order to maximize processor utilization. Task B would then acquire affinity with the second processor while task A would continue to have affinity with the original processor.

Processor affinity can effectively reduce cache problems but it does not curb the persistent load-balancing problem.

Processor affinity becomes more complicated in systems with non-uniform architectures. As an example, a system with two dual-core hyper-threaded CPUs presents a challenge to a scheduling algorithm. There is complete affinity between two virtual CPUs implemented on the same core via hyper-threading; partial affinity between two cores on the same physical chip (as the cores share some, but not all, cache), and no affinity between separate physical chips.

On Linux the CPU affinity of a process might be altered with the taskset(1) program. On SGI systems, dplace binds a process to a set of CPUs.


Quelle: http://en.wikipedia....cessor_affinity

Gruß
Sandokan

Thema verteilen:


Seite 1 von 1

1 Besucher lesen dieses Thema
Mitglieder: 0, Gäste: 1, unsichtbare Mitglieder: 0