Searched refs:schedule (Results 51 - 73 of 73) sorted by relevance

123

/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/core/
H A Dfmr_pool.c195 schedule();
/barrelfish-master/kernel/
H A Dschedule_rbed.c293 * \return Next DCB to schedule or NULL if wait for interrupts.
295 struct dcb *schedule(void) function
332 // in the schedule yet. We just have them to reduce book-keeping.
342 debug(SUBSYS_DISPATCH, "schedule: no dcb runnable\n");
371 // Dispatch first guy in schedule if not over budget
439 // No-Op if already in schedule
505 // No-Op if not in schedule
H A Dsyscall.c776 dispatch(schedule());
812 // schedule something in the other kcb
813 dispatch(schedule());
/barrelfish-master/usr/skb/programs/
H A Dscheduler.pl36 schedule(S) :-
/barrelfish-master/usr/bench/bomp_mm/
H A Dmm.c279 #pragma omp for nowait schedule (static, 1)
/barrelfish-master/kernel/arch/x86/
H A Dstartup_x86.c542 struct dcb *next = schedule();
/barrelfish-master/doc/000-overview/
H A DOverview.tex79 and schedule its own threads. Multiple dispatchers can be combined
136 CPU drivers schedule dispatchers. The scheduling algorithm employed
195 The main upcall is \texttt{run()}. When the kernel decides to schedule a
206 can decide to schedule another thread, in which case it must first save the
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Drepairtut.tex294 Suppose the requirement is to complete the schedule as early as
321 schedule(Starts,End) :-
H A Dfdintro.tex279 schedule tasks with their earliest possible starting time.
/barrelfish-master/usr/eclipseclp/documents/visualisation/
H A Dclients.tex190 problem. The resulting schedule/partial schedule is rendered as a
/barrelfish-master/usr/eclipseclp/icparc_solvers/
H A Dic_probing_for_scheduling.pl309 % Example program: simple schedule optimisation
377 summary: "Find a resource-feasible schedule that minimises the
427 summary: "Find a resource-feasible schedule that minimises the
H A Dprobing_for_scheduling.pl309 % Example program: simple schedule optimisation
377 summary: "Find a resource-feasible schedule that minimises the
427 summary: "Find a resource-feasible schedule that minimises the
/barrelfish-master/usr/eclipseclp/ecrc_solvers/
H A Dset.pl260 % schedule suspensions as a result of instantiating to Val
275 % schedule suspensions as a result of updating the domain to NewMin..NewMax
/barrelfish-master/kernel/arch/armv8/
H A Dsyscall.c1198 dispatch(schedule());
/barrelfish-master/kernel/arch/armv7/
H A Dsyscall.c1276 dispatch(schedule());
/barrelfish-master/kernel/arch/x86_32/
H A Dsyscall.c1166 dispatch(schedule());
/barrelfish-master/kernel/arch/x86_64/
H A Dsyscall.c1857 dispatch(schedule());
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dexthsusp.tex1167 \about{Attribute}, and schedule them for execution.
1220 is to be able to schedule several suspension lists before the
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dbranch_and_bound.pl420 % to be re-imposed. It will itself schedule another event to be raised
H A Dkernel.pl5747 which schedule themselves up/down one level depending on whether they
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dkernel.tex1857 schedule
1870 Demon: schedule
/barrelfish-master/doc/022-armv8/
H A Dreport.tex940 terms, the \emph{CPU driver}), does not schedule threads directly, but instead
/barrelfish-master/usr/eclipseclp/icparc_solvers/ech/
H A Dech.pl2298 schedule_suspensions(N, CS0), % schedule either CS0 or CS1 here

Completed in 393 milliseconds

123