User:Titoo.R
Tray of snacks algorithm[edit]
In the late months of the year 2009 to 2010 data transfer( developed in c# from one system to another ) was a major constraint for Titoo.R. When data was transferred two or more simultaneous data request was collided and data was lost. So some data transferred and some did not. So Titoo.R developed a new algorithm which avoided collisions and data was transferred without loss and with more speed. The new algorithm was later named by Titoo.R as Tray of snacks algorithm. Tray of snacks algorithm name was chosen because this algorithm is similar to the snacks in a tray given to arriving guest and makes sure that each guest takes his pack of snack in proper time interval. The algorithm was developed in the design process for the data transfer that was needed from one system to another. The name is by analogy with the way by which snacks are given in a tray for each guest.
The Tray of snacks algorithm is a new data transfer collision avoidance algorithm programmed and developed by Titoo.R in the year 2009 that test for collision avoidance by simulating the allocation of pre-determined conditioned data transfer from one system to another.
The Tray of snacks algorithm is run by the system whenever a data transfer is needed. The algorithm facilitates offline connectivity by postponing the request if it determines that system is offline and the request is processed when ever the system is online, data are processed according to the fifo method so that data is not lost. This algorithm avoids collision of one or more request coming simultaneously by a new method called fifo_batch_multi_threading. Some of the resources that are tracked in real time systems are memory, semaphores and network access. Tray of snacks algorithm in real time was sucessfully tested and implemented on jan 2012 with two different database.Just 1 year after the 2011 development.