Re: A Simpler Find Tool

[Simon Wright <simon@pushface.org>]

Brian Kolden <bakolden5@gmail.com> writes:

> I made a simple find tool for Linux, https://github.com/bkold/finda,
> and I was wondering if I could optimize the task scheduling a bit.
>
> 	protected body Task_Pool_Status is
> 		procedure Check (Thread_Pointer : out Thread_Access) is
> 		begin
> 			for I in Status'Range loop
> 				if Status(I) = Ready then
> 					Status(I) := Working;
> 					Thread_Pointer := Threads(I);
> 					return;
> 				end if;
> 			end loop;
> 			Thread_Pointer := Null;
> 		end Check;
>
> 		procedure End_Thread (Thread_Num : in CPU) is
> 		begin
> 			Status(Thread_Num) := Ready;
> 		end End_Thread;
> 	end Task_Pool_Status;
>
> I'm using a request and reserve model to determine which threads are
> waiting and which are busy. The threads call End_Thread when they
> finish their work in order to be available to be queued again. I think
> the model itself is good, but I was unhappy with how I find the
> sleeping threads. Does anyone have a cleaner suggestion?

Just how many threads are you expecting to have? Is it worth saving some
cycles here?

You could have a queue of Ready threads, pop a thread when required,
push when done. That would allow you to have an entry, which would save
the polling?

   entry Get (A_Thread : out Thread_Access) when Queue.Head /= null
   is