ANUNTURI
+14
Faun
mastermind
itina
Vax Populi
Woo Woo
atat de simplu
Pingu
habibi77
elis27
oli
Radu
seaman65
parwous
pitulicea
18 participanți
Pagina 5 din 11
Pagina 5 din 11 • 1, 2, 3, 4, 5, 6 ... 9, 10, 11
ANUNTURI
Rezumarea primului mesaj :
Daca ai ceva de anuntat, sau vrei sa pui o intrebare la care speri sa primesti raspuns "urgent", foloseste cu incredere topicul acesta
Nu garantez ca va fi citit in timp util si de catre toata lumea, dar merita sa faci o incercare 
Daca e IMPORTANT si e ANUNT, exista sanse mari sa fie citit.
Nu se accepta anunturile la misto si ironiile ieftine. Mesajele care nu corespund topicului vor fi sterse de catre administrator.
Daca ai ceva de anuntat, sau vrei sa pui o intrebare la care speri sa primesti raspuns "urgent", foloseste cu incredere topicul acesta


Daca e IMPORTANT si e ANUNT, exista sanse mari sa fie citit.

Nu se accepta anunturile la misto si ironiile ieftine. Mesajele care nu corespund topicului vor fi sterse de catre administrator.
pitulicea- 6
Re: ANUNTURI
Da, functioneaza, trebuia sa postez de cand ai spus tu, dar am crezut ca ai virusi si nu te-as fi lipsit de la o intalnire cu ex-iubi. 

Vizitator- Vizitator
Re: ANUNTURI
malware-ul pe care il aveam noi, nu merge sters asa, din pacate. Ala a fost rau si nesuferit, se insinuase peste tot, magarul
In toate moroarele de cautare, peste tot aparea porcaria aia de omiga-plus, nu mai puteai folosi motoarele preferate, nemaivorbind ca era exasperant de incet si plin de reclame sau invitatii sa descarci tot felul de programe tampite, spionaj de fata


Vizitator- Vizitator
Re: ANUNTURI
Instalezi ce ai acolo. Atat ai de facut: :"add to firefox". E o treaba simpla.
atat de simplu- 6
help aka f1
Paella deci sa inteleg ca la tine pot apela daca am o problema pe partea de software ?
chiar am niste neplaceri cu load balancing-ul in mac os x 10.5.8
Multumesc anticipat pt psobilul ajutor



Vax Populi- 2
Re: ANUNTURI
load balancing
Techniques which aim to spread
tasks among the processors in a parallel processor to avoid
some processors being idle while others have tasks queueing
for execution. Load balancing may be performed either by
heavily loaded processors (with many tasks in their queues)
sending tasks to other processors; by idle processors
requesting work from others; by some centralised task
distribution mechanism; or some combination of these. Some
systems allow tasks to be moved after they have started
executing ("{task migration") others do not. It is important
that the overhead of executing the load balancing
algorithm does not contribute significantly to the overall
processing or communications load.
Distributed scheduling algorithms may be static, dynamic or
preemptive. Static algorithms allocate processes to
processors at run time while taking no account of current
network load. Dynamic algorithms are more flexible, though
more computationally expensive, and give some consideration to
the network load before allocating the new process to a
processor. Preemptive algorithms are more expensive and
flexible still, and may migrate running processes from one
host to another if deemed beneficial. Research to date
indicates that dynamic algorithms yield significant
performance benefits, but that further (though lesser) gains
may be had through the addition of process migration
facilities.
Despre asta vorbesti?!?
Cu drag !
Techniques which aim to spread
tasks among the processors in a parallel processor to avoid
some processors being idle while others have tasks queueing
for execution. Load balancing may be performed either by
heavily loaded processors (with many tasks in their queues)
sending tasks to other processors; by idle processors
requesting work from others; by some centralised task
distribution mechanism; or some combination of these. Some
systems allow tasks to be moved after they have started
executing ("{task migration") others do not. It is important
that the overhead of executing the load balancing
algorithm does not contribute significantly to the overall
processing or communications load.
Distributed scheduling algorithms may be static, dynamic or
preemptive. Static algorithms allocate processes to
processors at run time while taking no account of current
network load. Dynamic algorithms are more flexible, though
more computationally expensive, and give some consideration to
the network load before allocating the new process to a
processor. Preemptive algorithms are more expensive and
flexible still, and may migrate running processes from one
host to another if deemed beneficial. Research to date
indicates that dynamic algorithms yield significant
performance benefits, but that further (though lesser) gains
may be had through the addition of process migration
facilities.
Despre asta vorbesti?!?



Cu drag !
Vizitator- Vizitator
Re: ANUNTURI
Dupa ce ca o sa-mi iau na, na din cauza ta ca nu avem voie sa copy/paste mai mult de 5 randuri, mai esti si pretentios?!?
Vizitator- Vizitator
Re: ANUNTURI
Eu cred ca baiatul vrea sa te cunoasca mai bine
Daca vrea lectii de IT, sa le ia in particular.
A facut strigarea, i s-a raspuns... restul e off-topic


A facut strigarea, i s-a raspuns... restul e off-topic

pitulicea- 6
Re: ANUNTURI
Soer sa nu ma omoare Pitu, va las aici unde ma puteti asculta pe radio :
Listen : [Trebuie sa fiti inscris si conectat pentru a vedea acest link]
Facebook : [Trebuie sa fiti inscris si conectat pentru a vedea acest link]
Chat - [Trebuie sa fiti inscris si conectat pentru a vedea acest link]
YM - radio.west
Listen : [Trebuie sa fiti inscris si conectat pentru a vedea acest link]
Facebook : [Trebuie sa fiti inscris si conectat pentru a vedea acest link]
Chat - [Trebuie sa fiti inscris si conectat pentru a vedea acest link]
YM - radio.west
Vizitator- Vizitator
Pagina 5 din 11 • 1, 2, 3, 4, 5, 6 ... 9, 10, 11
Pagina 5 din 11
Permisiunile acestui forum:
Nu puteti raspunde la subiectele acestui forum
|
|