Sponsored Content
Full Discussion: select vs poll
Special Forums IP Networking select vs poll Post 302115859 by porter on Saturday 28th of April 2007 05:18:59 PM
Old 04-28-2007
Quote:
Originally Posted by smanu
Do you by any chance have any idea about how much performance improvement can be achieved by replacing poll with Asynchronous I/O framework.
Alternatively consider pthreads. If your application takes advantage of threads for concurrent activity it will scale better on SMP hardware.
 

7 More Discussions You Might Find Interesting

1. Programming

How to convert the "select" function into a "poll" function

i have a program using the select function but i want to convert it to poll... how can i do this? thanks in advance... :) (1 Reply)
Discussion started by: rbolante
1 Replies

2. UNIX for Dummies Questions & Answers

Replace select/poll with kqueue/kevent

Hi, As far as I known, kqueue/kevent model can be used to improve the efficiency of systems event dispatching. I m wondering whether kqueue/kevent is same as the real-time OS event model. I also want to know when writing multiplexing app in real-time OS, what APIs need to be used for... (1 Reply)
Discussion started by: bsderss
1 Replies

3. Programming

select/poll and Signal Safety

Hi I am struggling to understand why one should use pselect()/ppoll() instead of wrapping an ordinary select() or poll() call around sigprocmask(). The linux man page talks about “race conditions”, but how would such dangers occur? I plan to use poll() for an application (since ppoll() isn't... (0 Replies)
Discussion started by: nopcoder
0 Replies

4. UNIX for Dummies Questions & Answers

Poll data from a file

I have to write a script where I poll a txt file for data (30 min interval) Dependent on the data read, the script should return a message. It should look something like the "code" below: -- do while <data recived> sleep 30m read data from file Done If <data> x return "A" If... (1 Reply)
Discussion started by: ioniCoder
1 Replies

5. Shell Programming and Scripting

how to poll for new files?

Hi , i have a requirement in which i have to ftp files to unix from windows and vice versa. I have to encrypt files in windows which will then be decrypted in unix and vice versa. Now the process needs to be automated ..therefore when windows server or unix server recieves the files a shell... (5 Replies)
Discussion started by: lifzgud
5 Replies

6. Shell Programming and Scripting

How to use poll() for I/O multiplex

Hi, guys: I want to write my own shell using C. I am confused about the usage of I/O multiplex. Does anyone know some examples or explain it to me ? Thanks so much (1 Reply)
Discussion started by: tomlee
1 Replies

7. What is on Your Mind?

Powerhouses and mainstream poll

This not a joke but a quite serious question to maybe have your point of view about this very topic of content on the net. So I start this poll to ask the users if they can imagine that the so called content industry of former times sooner or later or anyway will regain lost ground or not? Do you... (1 Reply)
Discussion started by: 1in10
1 Replies
dispatch_benchmark(3)					   BSD Library Functions Manual 				     dispatch_benchmark(3)

NAME
dispatch_benchmark -- Measures block execution time SYNOPSIS
#include <dispatch/dispatch.h> uint64_t dispatch_benchmark(size_t count, void (^block)(void)); uint64_t dispatch_benchmark_f(size_t count, void *context, void (*function)(void *)); DESCRIPTION
The dispatch_benchmark() function executes the given block multiple times according to the count variable and then returns the average number of nanoseconds per execution. This function is for debugging and performance analysis work. For the best results, pass a high count value to dispatch_benchmark(). When benchmarking concurrent code, please compare the serial version of the code against the concurrent version, and compare the concurrent version on different classes of hardware. Please look for inflection points with various data sets and keep the following facts in mind: o Code bound by computational bandwidth may be inferred by proportional changes in performance as concurrency is increased. o Code bound by memory bandwidth may be inferred by negligible changes in performance as concurrency is increased. o Code bound by critical sections may be inferred by retrograde changes in performance as concurrency is increased. o Intentional: locks, mutexes, and condition variables. o Accidental: unrelated and frequently modified data on the same cache-line. RETURN VALUE
The dispatch_benchmark() function returns the average number of nanoseconds the given block takes to execute. SEE ALSO
dispatch(3) Darwin May 1, 2009 Darwin
All times are GMT -4. The time now is 02:16 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy