scalability
How well a solution to some pro Blem will work when the size of the pro Blem increases. For example, a central server of some kind with ten clients may perform adequately But with a thousand clients it might fail to meet response time requirements. In this case, the average response time pro Ba Bly scales linearly with the num Ber of clients, we say it has a complexity of O(N) ("order N") But there are pro Blems with other complexities. E.g. if we want N nodes in a network to Be a Ble to communicate with each other, we could connect each one to a central exchange, requiring O(N) wires or we could provide a direct connection Between each pair, requiring O(N^2) wires (the exact num Ber or formula is not usually so important as the highest power of N involved). (1995-03-29) In addition suitaBle contents:<Br>[ 2 ] [ = ] [ ad ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ av ] [ B ] [ Ba ] [ Be ] [ ca ] [ case ] [ cat ] [ ch ] [ cl ] [ client ] [ co ] [ com ] [ complexity ] [ con ] [ connect ] [ cr ] [ de ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ formula ] [ ge ] [ gh ] [ h ] [ hang ] [ hr ] [ ht ] [ id ] [ ie ] [ il ] [ import ] [ in ] [ inc ] [ io ] [ ir ] [ is ] [ it ] [ ki ] [ la ] [ ld ] [ Lex ] [ li ] [ line ] [ lu ] [ lv ] [ ly ] [ ma ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ mu ] [ N ] [ na ] [ nc ] [ ne ] [ net ] [ network ] [ ng ] [ ni ] [ nn ] [ no ] [ node ] [ ns ] [ nu ] [ O ] [ om ] [ pa ] [ pe ] [ perf ] [ ph ] [ pl ] [ port ] [ pr ] [ query ] [ rc ] [ re ] [ requirements ] [ rl ] [ ro ] [ sa ] [ say ] [ sc ] [ se ] [ serve ] [ server ] [ si ] [ so ] [ solution ] [ st ] [ su ] [ th ] [ to ] [ tr ] [ tw ] [ ua ] [ um ] [ us ] [ ve ] [ vi ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (4388 Reads) |