[Mono-bugs] [Bug 418272] Scheduling time complexity of Sys.Threading.Timer is O(n)

[bugzilla_noreply at novell.com]

https://bugzilla.novell.com/show_bug.cgi?id=418272

User juraj at hotfeet.ch added comment
https://bugzilla.novell.com/show_bug.cgi?id=418272#c1





--- Comment #1 from Juraj Skripsky <juraj at hotfeet.ch>  2008-08-19 07:17:16 MDT ---
Created an attachment (id=234115)
 --> (https://bugzilla.novell.com/attachment.cgi?id=234115)
test case

This test case first starts a given number of timers, which will just sit there
waiting. Then it start a single timer which increments an counter every 10ms.
The resulting counter value is printed every 100ms.

In an ideal world the output of "mono TimerTest.exe 100000" would be:

0 timers started.
1000 timers started.
2000 timers started.
..
100000 timers started.
1.0
1.0
1.0
1.0
1.0
.
.
.

The printed number will be smaller than 1 in any actual test run. The higher
the scheduling overhead, the smaller the number.

With increasing number of timers, the overhead rises much faster on Mono than
on .NET.


-- 
Configure bugmail: https://bugzilla.novell.com/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You are the QA contact for the bug.
You are the assignee for the bug.