<s>
Lottery	B-Operating_System
scheduling	I-Operating_System
is	O
a	O
probabilistic	O
scheduling	O
algorithm	O
for	O
processes	B-Operating_System
in	O
an	O
operating	B-General_Concept
system	I-General_Concept
.	O
</s>
<s>
Processes	B-Operating_System
are	O
each	O
assigned	O
some	O
number	O
of	O
lottery	O
tickets	O
,	O
and	O
the	O
scheduler	O
draws	O
a	O
random	O
ticket	O
to	O
select	O
the	O
next	O
process	O
.	O
</s>
<s>
Shortest	B-Operating_System
job	I-Operating_System
next	I-Operating_System
and	O
Fair-share	B-Operating_System
scheduling	I-Operating_System
.	O
</s>
<s>
Lottery	B-Operating_System
scheduling	I-Operating_System
solves	O
the	O
problem	O
of	O
starvation	B-Operating_System
.	O
</s>
<s>
Implementations	O
of	O
lottery	B-Operating_System
scheduling	I-Operating_System
should	O
take	O
into	O
consideration	O
that	O
there	O
could	O
be	O
billions	O
of	O
tickets	O
distributed	O
among	O
a	O
large	O
pool	O
of	O
threads	O
.	O
</s>
<s>
Lottery	B-Operating_System
scheduling	I-Operating_System
can	O
be	O
preemptive	O
or	O
non-preemptive	O
.	O
</s>
