Con Kolivas

From Wikipedia, the free encyclopedia
(Redirected from Rotating Staircase Deadline)
Jump to navigation Jump to search

Con Kolivas
Born
OccupationAnesthesiologist
Known forLinux kernel development

Con Kolivas is a Greek-Australian anaesthetist.[1] He has worked as a computer programmer on the Linux kernel and on the development of the cryptographic currency mining software CGMiner.[2] His Linux contributions include patches for the kernel to improve its desktop performance, particularly reducing I/O impact.

Linux

[edit | edit source]

Kolivas is most notable for his work with CPU scheduling, most significantly his implementation of "fair scheduling", which inspired Ingo Molnár to develop his Completely Fair Scheduler, as a replacement for the earlier O(1) scheduler, crediting Kolivas in his announcement.[3] Kolivas developed several CPU schedulers such as the Staircase in 2004,[4] then Rotating Staircase Deadline (RSDL),[5] and subsequently Staircase Deadline (SD)[6] schedulers to address interactivity concerns of the Linux kernel with respect to desktop computing. Additionally, he has written a "swap prefetch" patch, which allows processes to respond quickly after the operating system has been idle for some time and their working sets have been swapped out.[7] Many of his experimental "-CK" patches, such as his prefetching and scheduling code, did not get merged with the official Linux kernel.

In 2007, Kolivas announced in an email that he would cease developing for the Linux kernel. Discussing his reasons in an interview, he expressed frustration with aspects of the mainline kernel development process, which he felt did not give sufficient priority to desktop interactivity, in addition to hacking taking a toll on his health, work and family.[8][9]

He has also written a benchmarking tool called ConTest[10] that can be used to compare the performance of different kernel versions.[11]

On 31 August 2009, Kolivas posted a new scheduler called BFS (Brain Fuck Scheduler).[12] It is designed for desktop use and to be very simple (hence it may not scale well to machines with many CPU cores). Con Kolivas did not intend to get it merged into the mainline kernel.[13] He has since retired BFS in favour of MuQSS, a rewritten implementation of the same concept.

CGMiner

[edit | edit source]

On 13 July 2011, Kolivas introduced a new piece of software for "windows, linux, OSX and other" called CGMiner, which is used for mining cryptocurrencies such as bitcoin and Litecoin.

References

[edit | edit source]
  1. ^ Anaesthesia Information Page Archived 4 August 2009 at the Wayback Machine by Kolivas, Jan 2001
  2. ^ CGMiner GitHub repository, "ASIC and FPGA miner in c for bitcoin"
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)., 18 April 2007, KernelTrap.org
  4. ^ The staircase scheduler [LWN.net]
  5. ^ The Rotating Staircase Deadline Scheduler [LWN.net]
  6. ^ LKML: Con Kolivas: [PATCH]Staircase scheduler - experimental
  7. ^ Swap prefetching [LWN.net]
  8. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  9. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  10. ^ The homepage of contest
  11. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)., 16 October 2002, KernelTrap.org
  12. ^ Con Kolivas returns with a new scheduler [LWN.net]
  13. ^ BFS FAQ
[edit | edit source]