Jeff Malcolm

Jeff "Flash" Malcolm (born 9 May 1956 in Cowra, New South Wales), is an Australian professional boxer who fought from 1971 until 2002. He won the Australian light welterweight title, New South Wales (Australia) State lightweight title, Australasian light welterweight title, South Pacific light welterweight title, Queensland (Australia) State welterweight title, International Boxing Council (IBC) welterweight title, South Pacific welterweight title, World Boxing Federation (WBF) Intercontinental welterweight title, WBF welterweight title, Pan Asian Boxing Association (PABA) welterweight title, World Boxing Association (WBA) Fedelatin welterweight title, PABA light middleweight title, and Commonwealth light welterweight title. He was also a challenger for the South Seas light welterweight title against Pat Leglise, Australian welterweight title against Wilf Gentzen, and World Boxing Organization (WBO) welterweight title against Manning Galloway. His professional fighting weight varied from 135 lb (61 kg; 9 st 9 lb), i.e. lightweight to 165 1⁄4 lb (75.0 kg; 11 st 11.3 lb), i.e. super middleweight.[1] He was inducted into the Australian National Boxing Hall of Fame in 2007.[2]

Jeff Malcolm
Statistics
Nickname(s)Flash
Weight(s)lightweight
light welterweight
welterweight
light middleweight
middleweight
super middleweight
Height5 ft 10 in (1.78 m)
NationalityAustralian
Born (1956-05-09) 9 May 1956
Cowra
StanceSouthpaw
Boxing record
Total fights138
Wins100 (KO 36)
Losses27 (KO 3)
Draws11

Professional boxing record
gollark: I agree. It's precisely [NUMBER OF AVAILABLE CPU THREADS] parallelized.
gollark: > While W is busy with a, other threads might come along and take b from its queue. That is called stealing b. Once a is done, W checks whether b was stolen by another thread and, if not, executes b itself. If W runs out of jobs in its own queue, it will look through the other threads' queues and try to steal work from them.
gollark: > Behind the scenes, Rayon uses a technique called work stealing to try and dynamically ascertain how much parallelism is available and exploit it. The idea is very simple: we always have a pool of worker threads available, waiting for some work to do. When you call join the first time, we shift over into that pool of threads. But if you call join(a, b) from a worker thread W, then W will place b into its work queue, advertising that this is work that other worker threads might help out with. W will then start executing a.
gollark: >
gollark: Maybe I should actually benchmark it.

References
  1. "Statistics at boxrec.com". boxrec.com. 31 December 2013. Retrieved 1 January 2013.
  2. "Biography at boxrec.com". boxrec.com. 31 December 2013. Retrieved 1 January 2013.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.