ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent/lib/AnyEvent.pm
(Generate patch)

Comparing AnyEvent/lib/AnyEvent.pm (file contents):
Revision 1.90 by root, Fri Apr 25 14:24:29 2008 UTC vs.
Revision 1.102 by root, Sun Apr 27 21:16:26 2008 UTC

65technically possible. 65technically possible.
66 66
67Of course, if you want lots of policy (this can arguably be somewhat 67Of course, if you want lots of policy (this can arguably be somewhat
68useful) and you want to force your users to use the one and only event 68useful) and you want to force your users to use the one and only event
69model, you should I<not> use this module. 69model, you should I<not> use this module.
70
71 70
72=head1 DESCRIPTION 71=head1 DESCRIPTION
73 72
74L<AnyEvent> provides an identical interface to multiple event loops. This 73L<AnyEvent> provides an identical interface to multiple event loops. This
75allows module authors to utilise an event loop without forcing module 74allows module authors to utilise an event loop without forcing module
457might chose the wrong one unless you load the correct one yourself. 456might chose the wrong one unless you load the correct one yourself.
458 457
459You can chose to use a rather inefficient pure-perl implementation by 458You can chose to use a rather inefficient pure-perl implementation by
460loading the C<AnyEvent::Impl::Perl> module, which gives you similar 459loading the C<AnyEvent::Impl::Perl> module, which gives you similar
461behaviour everywhere, but letting AnyEvent chose is generally better. 460behaviour everywhere, but letting AnyEvent chose is generally better.
461
462=head1 OTHER MODULES
463
464The following is a non-exhaustive list of additional modules that use
465AnyEvent and can therefore be mixed easily with other AnyEvent modules
466in the same program. Some of the modules come with AnyEvent, some are
467available via CPAN.
468
469=over 4
470
471=item L<AnyEvent::Util>
472
473Contains various utility functions that replace often-used but blocking
474functions such as C<inet_aton> by event-/callback-based versions.
475
476=item L<AnyEvent::Handle>
477
478Provide read and write buffers and manages watchers for reads and writes.
479
480=item L<AnyEvent::Socket>
481
482Provides a means to do non-blocking connects, accepts etc.
483
484=item L<AnyEvent::HTTPD>
485
486Provides a simple web application server framework.
487
488=item L<AnyEvent::DNS>
489
490Provides asynchronous DNS resolver capabilities, beyond what
491L<AnyEvent::Util> offers.
492
493=item L<AnyEvent::FastPing>
494
495The fastest ping in the west.
496
497=item L<Net::IRC3>
498
499AnyEvent based IRC client module family.
500
501=item L<Net::XMPP2>
502
503AnyEvent based XMPP (Jabber protocol) module family.
504
505=item L<Net::FCP>
506
507AnyEvent-based implementation of the Freenet Client Protocol, birthplace
508of AnyEvent.
509
510=item L<Event::ExecFlow>
511
512High level API for event-based execution flow control.
513
514=item L<Coro>
515
516Has special support for AnyEvent.
517
518=item L<IO::Lambda>
519
520The lambda approach to I/O - don't ask, look there. Can use AnyEvent.
521
522=item L<IO::AIO>
523
524Truly asynchronous I/O, should be in the toolbox of every event
525programmer. Can be trivially made to use AnyEvent.
526
527=item L<BDB>
528
529Truly asynchronous Berkeley DB access. Can be trivially made to use
530AnyEvent.
531
532=back
462 533
463=cut 534=cut
464 535
465package AnyEvent; 536package AnyEvent;
466 537
894 }); 965 });
895 966
896 $quit->wait; 967 $quit->wait;
897 968
898 969
899=head1 BENCHMARK 970=head1 BENCHMARKS
900 971
901To give you an idea of the performance and overheads that AnyEvent adds 972To give you an idea of the performance and overheads that AnyEvent adds
902over the event loops themselves (and to give you an impression of the 973over the event loops themselves and to give you an impression of the speed
903speed of various event loops), here is a benchmark of various supported 974of various event loops I prepared some benchmarks.
904event models natively and with anyevent. The benchmark creates a lot of 975
905timers (with a zero timeout) and I/O watchers (watching STDOUT, a pty, to 976=head2 BENCHMARKING ANYEVENT OVERHEAD
977
978Here is a benchmark of various supported event models used natively and
979through anyevent. The benchmark creates a lot of timers (with a zero
980timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
906become writable, which it is), lets them fire exactly once and destroys 981which it is), lets them fire exactly once and destroys them again.
907them again.
908 982
909Rewriting the benchmark to use many different sockets instead of using 983Source code for this benchmark is found as F<eg/bench> in the AnyEvent
910the same filehandle for all I/O watchers results in a much longer runtime 984distribution.
911(socket creation is expensive), but qualitatively the same figures, so it
912was not used.
913 985
914=head2 Explanation of the columns 986=head3 Explanation of the columns
915 987
916I<watcher> is the number of event watchers created/destroyed. Since 988I<watcher> is the number of event watchers created/destroyed. Since
917different event models feature vastly different performances, each event 989different event models feature vastly different performances, each event
918loop was given a number of watchers so that overall runtime is acceptable 990loop was given a number of watchers so that overall runtime is acceptable
919and similar between tested event loop (and keep them from crashing): Glib 991and similar between tested event loop (and keep them from crashing): Glib
935signal the end of this phase. 1007signal the end of this phase.
936 1008
937I<destroy> is the time, in microseconds, that it takes to destroy a single 1009I<destroy> is the time, in microseconds, that it takes to destroy a single
938watcher. 1010watcher.
939 1011
940=head2 Results 1012=head3 Results
941 1013
942 name watchers bytes create invoke destroy comment 1014 name watchers bytes create invoke destroy comment
943 EV/EV 400000 244 0.56 0.46 0.31 EV native interface 1015 EV/EV 400000 244 0.56 0.46 0.31 EV native interface
944 EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers 1016 EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers
945 CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal 1017 CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal
946 Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation 1018 Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation
947 Event/Event 16000 516 31.88 31.30 0.85 Event native interface 1019 Event/Event 16000 516 31.88 31.30 0.85 Event native interface
948 Event/Any 16000 936 39.17 33.63 1.43 Event + AnyEvent watchers 1020 Event/Any 16000 590 35.75 31.42 1.08 Event + AnyEvent watchers
949 Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour 1021 Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour
950 Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers 1022 Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers
951 POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event 1023 POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event
952 POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select 1024 POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select
953 1025
954=head2 Discussion 1026=head3 Discussion
955 1027
956The benchmark does I<not> measure scalability of the event loop very 1028The benchmark does I<not> measure scalability of the event loop very
957well. For example, a select-based event loop (such as the pure perl one) 1029well. For example, a select-based event loop (such as the pure perl one)
958can never compete with an event loop that uses epoll when the number of 1030can never compete with an event loop that uses epoll when the number of
959file descriptors grows high. In this benchmark, all events become ready at 1031file descriptors grows high. In this benchmark, all events become ready at
960the same time, so select/poll-based implementations get an unnatural speed 1032the same time, so select/poll-based implementations get an unnatural speed
961boost. 1033boost.
1034
1035Also, note that the number of watchers usually has a nonlinear effect on
1036overall speed, that is, creating twice as many watchers doesn't take twice
1037the time - usually it takes longer. This puts event loops tested with a
1038higher number of watchers at a disadvantage.
1039
1040To put the range of results into perspective, consider that on the
1041benchmark machine, handling an event takes roughly 1600 CPU cycles with
1042EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
1043cycles with POE.
962 1044
963C<EV> is the sole leader regarding speed and memory use, which are both 1045C<EV> is the sole leader regarding speed and memory use, which are both
964maximal/minimal, respectively. Even when going through AnyEvent, it uses 1046maximal/minimal, respectively. Even when going through AnyEvent, it uses
965far less memory than any other event loop and is still faster than Event 1047far less memory than any other event loop and is still faster than Event
966natively. 1048natively.
1001implementation. The design of the POE adaptor class in AnyEvent can not 1083implementation. The design of the POE adaptor class in AnyEvent can not
1002really account for this, as session creation overhead is small compared 1084really account for this, as session creation overhead is small compared
1003to execution of the state machine, which is coded pretty optimally within 1085to execution of the state machine, which is coded pretty optimally within
1004L<AnyEvent::Impl::POE>. POE simply seems to be abysmally slow. 1086L<AnyEvent::Impl::POE>. POE simply seems to be abysmally slow.
1005 1087
1006=head2 Summary 1088=head3 Summary
1007 1089
1008=over 4 1090=over 4
1009 1091
1010=item * Using EV through AnyEvent is faster than any other event loop 1092=item * Using EV through AnyEvent is faster than any other event loop
1011(even when used without AnyEvent), but most event loops have acceptable 1093(even when used without AnyEvent), but most event loops have acceptable
1015the actual event loop, only with extremely fast event loops such as EV 1097the actual event loop, only with extremely fast event loops such as EV
1016adds AnyEvent significant overhead. 1098adds AnyEvent significant overhead.
1017 1099
1018=item * You should avoid POE like the plague if you want performance or 1100=item * You should avoid POE like the plague if you want performance or
1019reasonable memory usage. 1101reasonable memory usage.
1102
1103=back
1104
1105=head2 BENCHMARKING THE LARGE SERVER CASE
1106
1107This benchmark atcually benchmarks the event loop itself. It works by
1108creating a number of "servers": each server consists of a socketpair, a
1109timeout watcher that gets reset on activity (but never fires), and an I/O
1110watcher waiting for input on one side of the socket. Each time the socket
1111watcher reads a byte it will write that byte to a random other "server".
1112
1113The effect is that there will be a lot of I/O watchers, only part of which
1114are active at any one point (so there is a constant number of active
1115fds for each loop iterstaion, but which fds these are is random). The
1116timeout is reset each time something is read because that reflects how
1117most timeouts work (and puts extra pressure on the event loops).
1118
1119In this benchmark, we use 10000 socketpairs (20000 sockets), of which 100
1120(1%) are active. This mirrors the activity of large servers with many
1121connections, most of which are idle at any one point in time.
1122
1123Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1124distribution.
1125
1126=head3 Explanation of the columns
1127
1128I<sockets> is the number of sockets, and twice the number of "servers" (as
1129each server has a read and write socket end).
1130
1131I<create> is the time it takes to create a socketpair (which is
1132nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1133
1134I<request>, the most important value, is the time it takes to handle a
1135single "request", that is, reading the token from the pipe and forwarding
1136it to another server. This includes deleting the old timeout and creating
1137a new one that moves the timeout into the future.
1138
1139=head3 Results
1140
1141 name sockets create request
1142 EV 20000 69.01 11.16
1143 Perl 20000 73.32 35.87
1144 Event 20000 212.62 257.32
1145 Glib 20000 651.16 1896.30
1146 POE 20000 349.67 12317.24 uses POE::Loop::Event
1147
1148=head3 Discussion
1149
1150This benchmark I<does> measure scalability and overall performance of the
1151particular event loop.
1152
1153EV is again fastest. Since it is using epoll on my system, the setup time
1154is relatively high, though.
1155
1156Perl surprisingly comes second. It is much faster than the C-based event
1157loops Event and Glib.
1158
1159Event suffers from high setup time as well (look at its code and you will
1160understand why). Callback invocation also has a high overhead compared to
1161the C<< $_->() for .. >>-style loop that the Perl event loop uses. Event
1162uses select or poll in basically all documented configurations.
1163
1164Glib is hit hard by its quadratic behaviour w.r.t. many watchers. It
1165clearly fails to perform with many filehandles or in busy servers.
1166
1167POE is still completely out of the picture, taking over 1000 times as long
1168as EV, and over 100 times as long as the Perl implementation, even though
1169it uses a C-based event loop in this case.
1170
1171=head3 Summary
1172
1173=over 4
1174
1175=item * The pure perl implementation performs extremely well, considering
1176that it uses select.
1177
1178=item * Avoid Glib or POE in large projects where performance matters.
1179
1180=back
1181
1182=head2 BENCHMARKING SMALL SERVERS
1183
1184While event loops should scale (and select-based ones do not...) even to
1185large servers, most programs we (or I :) actually write have only a few
1186I/O watchers.
1187
1188In this benchmark, I use the same benchmark program as in the large server
1189case, but it uses only eight "servers", of which three are active at any
1190one time. This should reflect performance for a small server relatively
1191well.
1192
1193The columns are identical to the previous table.
1194
1195=head3 Results
1196
1197 name sockets create request
1198 EV 16 20.00 6.54
1199 Perl 16 25.75 12.62
1200 Event 16 81.27 35.86
1201 Glib 16 32.63 15.48
1202 POE 16 261.87 276.28 uses POE::Loop::Event
1203
1204=head3 Discussion
1205
1206The benchmark tries to test the performance of a typical small
1207server. While knowing how various event loops perform is interesting, keep
1208in mind that their overhead in this case is usually not as important, due
1209to the small absolute number of watchers (that is, you need efficiency and
1210speed most when you have lots of watchers, not when you only have a few of
1211them).
1212
1213EV is again fastest.
1214
1215Perl again comes second. It is noticably faster than the C-based event
1216loops Event and Glib, although the difference is too small to really
1217matter.
1218
1219POE also performs much better in this case, but is is still far behind the
1220others.
1221
1222=head3 Summary
1223
1224=over 4
1225
1226=item * C-based event loops perform very well with small number of
1227watchers, as the management overhead dominates.
1020 1228
1021=back 1229=back
1022 1230
1023 1231
1024=head1 FORK 1232=head1 FORK

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines