text:
The present invention provides a process scheduler or dispatcher for a multiprocessor system for real time applications. This embodiment of the present invention proposes a dispatcher model that maintains a dispatch queue for each processor and a separate global dispatch queue for unbound higher priority real time threads. A processor has its own queue and a dispatcher. Each queue has a separate schedule lock associated with it to protect scheduling operations. A processor's dispatcher selects a thread for execution from one of the queues in the system as a candidate thread to execute. When a candidate thread is selected for execution, the processor proceeds to verify against threads in the global real time queue and the processor's own dispatch queue to select a highest priority runnable thread in the system. Thus, the present invention allows the dispatcher to prevent race conditions and minimize lock contention while assuring that high-priority threads are dispatched as quickly as possible. The present invention is implemented by a synchronization between the operations of dispatching a thread and making a thread runnable.
1. A multiprocessor scheduling system comprising:
a plurality of processors;
a plurality of schedulers, each of said plurality of processors coupled to one of said plurality of schedulers;
a plurality of local dispatch queues, each of said plurality of processors coupled to one of said plurality of local dispatch queues;
said plurality of schedulers coupled to a communication medium;
a global dispatch queue coupled to a communication medium;
a shared memory coupled to said communication medium;
wherein said plurality of local queues and said global queue each have a respective lock that is obtained before a thread is removed from the respective queue, and wherein said plurality of schedulers are coupled to a communication medium wherein at least one of said plurality of schedulers is configured to:
select for execution on an associated one of said plurality of processors a candidate highest priority runnable thread from said global dispatch queue and one of said local dispatch queues;
notify said plurality of processors of the candidate highest priority runnable thread;
verify that the selected thread is the highest priority thread by checking whether a higher priority thread having higher priority than said candidate thread is available on said global dispatch queue or one of said local dispatch queues;
preempt the selected thread with a new highest priority thread if the verification is negative.
2. The multiprocessor scheduling system of
3. The multiprocessor scheduling system of
4. A multiprocessor system comprising:
a plurality of processors;
a plurality of local dispatch queues, each of said plurality of local dispatch queues associated with a respective one of said plurality of processors;
a global dispatch queue accessible by said plurality of processors; and
a dispatcher configured to:
select a highest priority thread as a first thread for execution by one of said plurality of processors, said highest priority thread selected from said global queue and at least one of said local dispatch queues;
after obtaining said first thread, verify that said first thread is the highest priority thread by checking whether a higher priority thread having higher priority than said candidate thread is available on said global dispatch queue or one of said local dispatch queues; and
preempt said first thread with a higher priority thread if the verification is negative.
5. The system of
selecting the highest priority runnable thread from said global queue;
selecting the highest priority runnable thread from an associated local dispatch queue when there is no runnable thread in said global queue.
6. The system of
7. The system of
8. The system of
9. The system of
10. The system of
11. The system of
12. The system of
13. The system of
14. The method of
This application is a continuation of U.S. application Ser. No. 08/643,543, filed May 6, 1996, now U.S. Pat. No. 5,826,081.
1. Field of the Invention
This invention relates to a method and apparatus for efficient process scheduling for a multiprocessor system in a real time environment.
2. Background Art
The multiprocessor system (MP) is characterized by the presence of multiple CPUs or processors which cooperate on common or shared computational tasks. By having multiple processors in a single computer system, one can obtain performance enhancement by allowing many processors to share the computational load or by allowing many smaller tasks to be performed in parallel in separate processors. A multiprocessor system can also improve the system reliability since the failure of one processor will not necessarily lead to a crash of the entire system.
The introduction of multiple processors, however, complicates the resource management and allocation problem since two or more processes execute simultaneously in the kernel on separate processors. Thus, a scheduler module of an operating system needs to decide which processor should execute a process and in its general form, schedule a set of processes on a set of processors with arbitrary characteristics in order to optimize some objective function. This involves the selection of a process for execution from a set of processes.
The basic abstractions in an operating system include "tasks" and "threads." A task is a unit of resource management and a thread is a single flow-of-control. Each thread possesses a register state and a stack. The system associates with each thread extra state information relating to its schedulability. These include the thread dispatch priority and processor affinity that determines on which processors a thread can execute.
FIG. 1(A) shows a prior art single queue dispatcher for a multiprocessor system wherein a dispatcher uses an array 101 of dispatch queues, indexed by dispatch priority. In FIG. 1(A), when a thread is made runnable, it is placed on a dispatch queue, typically at the end, corresponding to its dispatch priority. When a processor switches to a new thread, it always selects the thread at the beginning of the highest priority non-empty dispatch queue. Threads may not change dispatch priority while on a dispatch queue; the thread must be first removed, its dispatch priority adjusted, and then the thread may be placed on a different dispatch queue.
FIG. 1(B) illustrates a prior art single queue dispatcher where a thread that needs to wait on a synchronization object is placed on a sleep queue 102 associated with the synchronization object. The sleep queue is maintained in dispatch priority order, so that when the synchronization object is released, the highest priority thread waiting for the object is at the head of the sleep queue.
The prior art system shown in FIGS. 1(A) and 1(B) uses a single spin schedule lock to protect all scheduling operations. Each scheduler may obtain or release the lock. When the schedule lock is currently held by a processor, other processors that need the schedule lock "spin" on the lock, waiting for access. In particular, whenever the release of a synchronization object makes some thread runnable, the schedule lock is held while placing the thread on the dispatch queue. To prevent interference and delays from interrupt routines, the holder of the schedule lock runs at an elevated interrupt level.
Thus, in the prior art system shown in FIGS. 1(A) and 1(B), the contention for a single schedule lock can cause processors to wait in line to make a scheduling decision, resulting in some idle processors. As a result, not only the whole purpose of using multiple processors to achieve faster job processing is defeated, but valuable computer resources go unused.
This situation can be somewhat ameliorated by introducing a multiple dispatch queue system wherein each processor is allowed to have its own dispatch queue and its own schedule lock. Such a multi-queue multi-lock system is shown in FIG. 2(A) wherein each processor maintains its own dispatcher queue. For example, there is a separate dispatch queue associated with each of processors 1, 2, . . . , N in FIG. 2(A).
In the system of FIG. 2(A), a processor ready to take a new thread starts searching for a runnable thread in its own dispatch queue. When its own queue is not empty, the processor takes the highest priority runnable thread available off its own queue. However, when its own queue is empty, the processor starts searching other dispatch queues for available threads. Still referring to FIG. 2(A), if there is an available runnable thread at any other dispatch queue, unless the thread is marked as only runnable on a particular processor, the processor can take the thread from the other dispatch queue and execute the thread. However, prior art dispatchers such as shown in FIGS. 1 and 2 are not suitable for real time applications.
A real time computing system is designed to deliver a required level of service or processing within a bounded time. Real time computing systems find applications in the areas of virtual reality, factory automation, robotics, teleconferencing, and multimedia broadcast system. These applications are typically "mixed-mode," that is, they are partitionable into schedulable entities, some of which require real time response. To achieve a bounded time response, time-critical applications require control over their scheduling behavior.
When a multiprocessor system is utilized to support real time applications, the scheduling of processes becomes even more complicated and consequently a real time operating system must be able to provide some real time capability to time critical tasks. Thus, a real time system must be capable of providing immediate response to specific external events and scheduling particular processes to run within a specified time limit after occurrence of an event. A real time system also needs to guarantee that the operating system can schedule a particular process within a fixed time limit.
To service real time high priority threads as rapidly as possible, the system in FIG. 2(A) can be improved to have a separate real time queue as shown in FIG. 2(B). In FIG. 2(B), an additional superqueue is added at a higher level of multiple dispatcher queues to provide system-wide visibility of runnable real time threads. The superqueue is a queue of dispatch queues containing those processor queues that hold unbound real time threads with priority higher than some predetermined threshold priority level. Thus the superqueue lists those processors whose highest priority thread has sufficient priority to be considered a real time thread.
Referring to FIG. 2(B), a processor first searches for runnable threads in the superqueue. If there is a non-empty high priority queue in the superqueue, the processor takes the highest priority runnable thread off that queue. If the superqueue is empty, the processor checks its own queue. If its own queue is still empty, then the processor goes on to other dispatcher queues for runnable threads. If there is any non-empty dispatcher queue in the system, the processor takes the highest priority runnable thread off that queue and starts executing the thread.
Real time threads would be dispatched by examining the superqueue. Thus, when a processor is selecting a thread to run, it first examines the superqueue and then its own queue.
Although the above solution outlined with respect to FIG. 2(B) represents an improvement over prior art and offers a straightforward solution to real time multiprocessor scheduling, it presents a critical race problem in scheduling real time threads. For example, a race condition can be created under the following scenario: suppose processors 1 and 2 are notified that there are two real time threads that are runnable in the superqueue. Processors 1 and 2 proceed to check the superqueue to find which processor queues have the two threads. The two real time threads are in, for example, processor 3 and processor 4's dispatch queues with the real time thread in processor 3's queue having higher priority than the one in processor 4's queue.
After finding from the superqueue that the highest real time thread is in processor 3's dispatch queue, both processors 1 and 2 attempt to access, and take the real time thread off, processor 3's queue. However, processor 1 accesses the processor 3's queue first and takes the real time thread. Then processor 2, still looking for a thread in processor 3's queue and not knowing that the highest priority real time thread has just been taken by processor 1, attempts to take the next highest priority thread off processor 3's queue. The next highest runnable thread in processor 3's queue, however, may be a very low priority one. As a result, the real time thread in processor 4's queue is left in the queue waiting to be scheduled until some processor becomes available to service it.
In the above scenario, which is an example of many possible disadvantages due to imprecise synchronization, the lack of communication between processors 1 and 2 leads to a race condition, which results in higher priority real time thread waiting in a queue while a lower priority thread is being serviced. Imprecise system synchronization, thus, can cause missed deadlines for real time threads even under low levels of processor utilization.
Thus, prior art dispatchers, fraught with race conditions and errors in the implementation of the dispatcher, can result in non-real time behavior for real time (RT) threads and in some cases can hang up the system.
Thus, presently, a variety of apparatus and methods are employed to provide a dispatcher for a multiprocessor system. However, they are not suitable for real time applications, do not deliver real time service for many applications, and are fraught with race conditions. Accordingly, it would be advantageous to provide a dispatcher that can efficiently support both time sharing (TS) and real time (RT) scheduling policies for a multiprocessor system.
The present invention provides a process scheduler or dispatcher for a multiprocessor system for real time applications. In the embodiments of the present invention, each processor has its own queue and a dispatcher so that the system can maintain a dispatch queue for each processor and a separate global dispatch-queue for unbound higher priority real time threads. Each queue has a separate schedule lock associated with it to protect scheduling operations. A processor is allowed to place a new thread on the global high priority real time queue, the processor's own queue, or any other processor's queue.
A processor's dispatcher can select a thread for execution from the global real time queue, a processor's own queue, or another processor's queue as a candidate thread to execute, based upon priority variables associated with each queue. The examination of the priorities on queues for thread selection does not require any schedule locks and miscommunication is prevented by using a suitable synchronization algorithm. When a candidate thread is selected for execution, the processor notifies other processors of its selection and proceeds to verify against threads in the global real time queue and the processor's own dispatch queue to select the highest priority runnable thread in the system.
Thus, the present invention allows the dispatcher to prevent race conditions and minimize lock contention while assuring that high-priority threads are dispatched as quickly as possible. The preferred embodiment of the present invention is implemented by a synchronization between the operations of dispatching a thread and making a thread runnable.
FIG. 1(A) shows a prior art single queue dispatcher system for a multiprocessor environment wherein a dispatcher uses an array of dispatch queues, indexed by dispatch priority.
FIG. 1(B) shows a prior art single queue dispatcher system wherein blocked threads are waiting on a synchronization object.
FIG. 2(A) shows a multi-queue multi-lock system.
FIG. 2(B) shows a multi-queue multi-lock system with an additional superqueue.
FIG. 3 illustrates a general purpose computer suitable for implementing an embodiment of the invention.
FIG. 4(A) shows a preferred embodiment of multiple dispatcher queue system according to the present invention.
FIG. 4(B) shows a dispatch queue structure in greater detail using dispatch queue for a processor of FIG. 4(A).
FIG. 5 shows a preferred configuration of the multiprocessor system according to the present invention.
FIG. 6 shows a flowchart describing a dispatcher scheduling a thread to run on a processor.
FIG. 7 shows a flowchart describing in greater detail the thread selection process of step 601 of FIG. 6.
FIG. 8 illustrates a global priority mapping strategy.
FIG. 9 shows a flowchart describing a processor making a thread runnable.
FIG. 10 illustrates a flowchart describing in greater detail the processor selection step 905 of FIG. 9.
The present invention is a multiprocessor scheduling system described with respect to real time applications. In the following description, numerous specific details are set forth to provide a more thorough description of the present invention. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without these specific details. In other instances, well known features have not been described in detail so as not to obscure the present invention.
In a multiprocessor system, there are basically two resource allocation decisions that are made. One is where to locate code and data in physical memory and the other is on which processor to execute each process—an assignment decision or processor management. These decisions are challenging in a multiprocessor system and optimization of the processor management is important in a multiprocessor system.
Assignment decision or job and processor scheduling includes multi-level scheduling policies: high-level scheduling or job scheduling that determines which jobs shall be allowed to compete actively for system resources; intermediate-level scheduling that determines which processes shall be allowed to compete for system resources; and low-level scheduling performed by a dispatcher. A dispatcher determines which ready process will be assigned to which processor when it next becomes runnable.
A fully preemptive scheduling scheme is used in the preferred embodiment of the present invention, in which a processor can be taken away from a process that it is currently running to let other higher priority process come in for execution. Although preemption involves overhead due to context switching, it is useful in systems in which high priority processes require rapid attention. In real time systems, for example, missing a hard deadline can bring fatal consequences and thus, preemptive scheduling is necessary in guaranteeing acceptable service times.
In the present invention, a process scheduler or dispatcher performs its function each time a running process is blocked or preempted. Its purpose is to select the next running process from the set of ready queues. The dispatcher resides in the operating system kernel, monitoring the ready queues and handling requests to load applications. This involves creating all the tasks and threads of the application, reserving memory, and loading the code and data into the memory. All the resources are reserved before an application is considered successfully loaded and ready to run. Thus, a dispatcher should be fairly efficient to minimize operating system overhead.
In a multiprocessor system, real time priority scheduling must meet one constraint: for each processor, there is no higher priority thread on any queue than can be run on that processor. From throughput point of view, it is best that each processor has its own dispatch queue, thus minimizing the lock contention between processors.
This embodiment of the present invention, therefore, proposes a dispatcher model that maintains a separate global dispatch queue for unbound higher priority real time threads in addition to processors' own dispatch queues. Further, instead of guaranteeing that the dispatcher always makes correct decisions, this embodiment of the present invention uses a select and verify scheme. Both of these features allow this embodiment of the present invention to minimize lock contention while assuring that high-priority threads are dispatched as quickly as possible. This is implemented by a synchronization between the operations of dispatching a thread and making a thread runnable. The dispatcher model of this embodiment of the present invention is implemented in SunOS Solaris 2.5.
The present invention can be implemented on a general purpose computer such as illustrated in FIG. 3. A keyboard 310 and mouse 311 are coupled to a bi-directional system bus 318. The keyboard and mouse are for introducing user input to the computer system and communicating that user input to CPU 313. The computer system of FIG. 3 also includes a video memory 314, main memory 315 and mass storage 312, all coupled to bi-directional system bus 318 along with keyboard 310, mouse 311 and CPU 313. The mass storage 312 may include both fixed and removable media, such as magnetic, optical or magnetic optical storage systems or any other available mass storage technology. Bus 318 may contain, for example, 32 address lines for addressing video memory 314 or main memory 315. The system bus 318 also includes; for example, a 32-bit DATA bus for transferring DATA between and among the components, such as CPU 313, main memory 315, video memory 314 and mass storage 312. Alternatively, multiplex DATA/address lines may be used instead of separate DATA and address lines.
Main memory 315 is comprised of dynamic random access memory (DRAM). Video memory 314 is a dual-ported video random access memory. One port of the video memory 314 is coupled to video amplifier 316. The video amplifier 316 is used to drive the cathode ray tube (CRT) raster monitor 317. Video amplifier 316 is well known in the art and may be implemented by any suitable means. This circuitry converts pixel DATA stored in video memory 314 to a raster signal suitable for use by monitor 317. Monitor 317 is a type of monitor suitable for displaying graphic images.
The computer system described above is for purposes of example only. The present invention may be implemented in any type of computer system or programming or processing environment.
FIG. 4(A) shows a multiple dispatcher queue system according to a preferred embodiment of the present invention. Referring to FIG. 4(A), the multiple dispatcher queue system comprises separate dispatcher queues 401, 402, . . . , 403 for processors 1, 2, . . . , N and in addition, a global high priority real time queue 404, which is used to hold high priority real time threads. Each dispatch queue has its own scheduling lock associated with it to protect all scheduling operations so that any processor attempting to dispatch a thread from a queue needs to acquire a lock for that queue before taking the thread off the queue. Thus, lock contention is reduced in the present invention with multiple schedule locks for multiple dispatch queues in contrast to prior art schedulers wherein a single schedule lock is used for a single dispatch queue for all processors.
In the preferred embodiment of FIG. 4(A), a dispatcher uses an array of dispatch queues, indexed by dispatch priority. Also, when a thread is made runnable, it is placed on a dispatch queue, typically at the end, corresponding to its dispatch priority. However, other schemes can be used for queueing instead of FIFO thread queueing. For example, LIFO (Last In First Out), SJF (Shortest Job First), SRT (Shortest Remaining Time) or other sophisticated queueing mechanism can be used depending on real time application scheduling requirements.
FIG. 4(B) shows a dispatch queue structure in greater detail using dispatch queue for processor 1 of FIG. 4(A). In FIG. 4(B), threads 1, 2, and 3 of some priority value are queued in the dispatch queue. Thread 1 is on top of the queue and, if a FIFO system is applied, would be the first thread in that priority category to be dispatched from the queue for execution. Threads in FIG. 4(B) also have processor affinity characteristics associated with them.
A processor affinity is used to determine on which processors a thread can execute. Most of threads are executable on all processors and are accordingly labeled so. However, there are threads that are only executable on a particular processor and no other processors. This thread then is given a processor affinity for that particular designated processor. When a thread has an affinity for a particular processor, it cannot be stolen by, or migrate to, other processors. Thread 2 in FIG. 4(B), for example, has a processor affinity for processor 1 and is only executable on processor 1. Thus a thread that is only runnable on one processor, i.e. a bound thread, can only appear on its bound processor's dispatch queue and will only be dispatched by that processor.
For a processor to be able to steal a thread from other processors, the thread must be runnable on the stealing processor. For example, referring to FIG. 4(B), threads 1 and 3 can be stolen, taken off the queue, and executed by other processors than processor 1.
FIG. 5 shows a configuration of the mutiprocessor system according to a preferred embodiment of the present invention. Each processor 1, 2, . . . , N has its own scheduler and dispatch queue as shown in FIG. 5. For example, processor 1 has scheduler 505 and dispatch queue 509 coupled to it through a bus. Schedulers or dispatchers determine when and which threads are to be dispatched for execution on the system processors. Schedulers 1, 2, . . . , N and therefore processors 1, 2, . . . , N are coupled via a bus to global high priority real time queue 501 and shared memory 503. Threads can interact using synchronization objects that are shared by all processors.
Associated with each processor in FIG. 5 are a set of scheduling variables used for various purposes. For example, variables cpu_runrun and cpu_kprunrun record requests for preemption of the current thread and are used to make scheduling decisions. Other variables include cpu_dispthread and cpu_thread. The variable cpu_thread refers to the thread currently executing on a processor. The variable cpu_dispthread is used for communication with other processors and records the identity of the thread last selected for dispatch on the processor.
The variable cpu_runrun or cpu_kprunrun is set for a processor by other processors when they put a new thread in the processor's queue and find that the processor is running a thread of lower priority than the new thread just put on the processor's queue. The variable cpu_kprunrun has higher priority than the variable cpu_runrun. When variable cpu-runrun or cpu_kprunrun is set, the processor needs to make a scheduling decision to preempt the current thread and service a new higher priority thread.
Any processor in FIG. 5 is capable of putting a thread on any of the queues in the system for execution. For example, processor 1 can put a new thread on its own queue, the global high priority real time queue, or other processors' queues unless the new thread has a particular processor affinity characteristic.
Although FIG. 5 shows multiprocessors connected via a single bus, other alternate architectures are certainly possible for an embodiment of the present invention. For example, multibus multiprocessor organization or crossbar switch system can be used for interconnection network to enhance the multiprocessor system performance.
To dispatch or schedule a thread on a processor, the processor needs to find a thread to run. FIG. 6 shows a flowchart describing a dispatcher scheduling a thread to run on a processor using a select and verify scheme.
Referring to FIG. 6, a processor ready for a next thread starts to select a thread to run by checking in the high priority real time queue to see if it has any entries at step 601. FIG. 7 shows a flowchart describing in greater detail the thread selection process of step 601.
The examination of the priorities on queues involve checking local variable associated with each processor and does not require any locks. For example, priority variable disp_maxrunpri can be used to indicate maximum priority level on a queue. Then variable disp_maxrunpri can be checked on both the processor dispatch queue and the real time queue using some suitable synchronization algorithm such as Dekker's algorithm to prevent miscommunication. However, any other suitable synchronization algorithm can be used in alternate embodiments of the present invention. Since the priority variables to be examined are atomic variables that are maintained in each dispatch queue, any scheduling errors caused by selecting a wrong queue will be caught in the a verification step. However, a schedule lock is required to take a thread from a selected queue.
Referring now to FIG. 7, if the real time queue has a higher priority thread than its own dispatch queue at decision block 701, the processor dispatcher acquires a lock for the real time queue and takes a highest priority thread at step 702 from the real time queue such as queue 404 of FIG. 4 and proceeds to execute the thread.
A processor that becomes available to take a next thread first looks at the real time queue before checking their own queues, thereby servicing threads in the higher priority real time queue ahead of threads in their own queues to provide the fastest possible service to real time threads. If, at decision block 701, it is determined that the real time queue has no higher threads available, the processor proceeds to step 703 to check its own dispatch queue for a runnable thread. If its own queue is not empty, then the processor proceeds to step 704 to acquire a lock for its own queue and take a highest priority thread off its own queue.
If the processor's own dispatch queue is empty, then the processor proceeds to step 705 where it checks other processors' dispatcher queues to find a runnable thread. If there is a runnable thread with no particular processor affinity in any other dispatch queue, the processor acquires a scheduling lock for that dispatch queue and proceeds to steal the thread from the other processor at step 706.
If the processor cannot find any non-empty dispatch queues or runnable threads in them at decision block 705, the processor proceeds to step 707 to choose an idle thread, thereby completing the thread selection process. An idle thread is a special thread that has a lower priority than any dispatch priority and never appears in the dispatch queue. An idle thread is selected for execution whenever no other thread is runnable, and switches whenever another thread becomes runnable.
Thus, a thread can be selected for execution by a processor from any one of the high priority queue, its own dispatch queue, and other processors' dispatch queues in the system. However, by first checking the high priority real time queue such as 404 before checking its own queue or other dispatch queues, a processor gives higher priority to the real time queue than other dispatch queues. This global priority mapping is illustrated in FIG. 8.
As shown in FIG. 8, the time-sharing threads are given the lowest priority in job scheduling or dispatching. The time-sharing threads are supported by a time slicing technique and scheduled dynamically with a few hundred milliseconds per time slice. The time-sharing scheduler switches the context in a round-robin fashion often enough to give every thread an equal opportunity to run. The system threads having higher priority than the time-sharing threads comprise special system threads and interrupt threads. Interrupt threads are always given the highest priority in the system.
Real time threads are situated between interrupt threads and the system threads in FIG. 8. Real time threads are scheduled strictly on the basis of their priority and the time quantum associated with them. A time quantum or time slice is assigned to a thread to limit the amount of processor time allowed to run the thread. If a thread does not complete before its time quantum expires, the thread is preempted and the next waiting highest priority thread is dispatched to execute. For example, a real time thread with infinite time quantum runs until it terminates, blocks, or is preempted.
The criteria for determining what priority level can be used as dividing lines for different priority regions in FIG. 8, and therefore what priority thread qualifies to be in, for example, the global real time queue, can be set by considering a number of factors. For example, threads in the real time queue are optimized for responsiveness while thread not in the real time queue are optimized for throughput, maximizing the number of instructions executed per unit time.
Referring back to FIG. 6, after selecting a candidate thread to run at step 601, the processor proceeds to step 602 where it releases the schedule lock it acquired in step 601 after broadcasting to other processors a tentative notification that it will be running the selected candidate thread by setting local processor variables, for example by setting variable cpu_dispthread to indicate the most updated thread priority.
At step 603, the processor clears all notifications that this processor should reschedule by, for example, clearing cpu_runrun and cpu_kprunrun variables. However, the processor still can not confirm that the selected candidate thread is the highest priority runnable thread it can take since there is a possibility that a new higher priority thread could have been placed in the global real time queue or in its own queue by some other processors while the processor was in the thread selection process. This can create the race conditions as discussed earlier in the background unless the scheduler can verify that the selected candidate thread is the best choice.
Thus, at step 604, a verification is made as to whether the selected thread is a best possible selection. This requires going back to the high priority real time queue and its own queue, and checking them again to see if there is a higher priority thread newly placed in the high priority real time queue or its own queue. If the selected candidate thread has higher priority than any other thread in either queue, then the processor continues to step 605 to execute the selected candidate thread.
If, however, a new higher priority thread is found in either queue, the selecting processor puts the selected candidate thread back on some queue, probably on the queue the thread was taken off, depending on a queue placement algorithm, and goes back to step 601 to start the thread selection process anew.
The select and verify scheme of this embodiment of the present invention, thus, guarantees that the final selected thread will indeed have the highest priority that the processor can select to execute. Also, the race problems such as discussed in the background art are now prevented and higher priority threads in the system are guaranteed a real time service with minimum dispatch latency.
FIG. 9 shows a flowchart describing a processor making a thread runnable. At step 901, a processor is selected for the thread and at decision block 901, a determination is made whether the thread is bound. If the thread is bound, the thread is put on the selected processor's queue at step 902. If the thread is not bound, a determination is made at decision block 903 as to whether the thread has real time property. Real time threads are threads that have sufficient priority that responsiveness of the system in dispatching the threads is more important than throughput.
A predetermined threshold value can be used as a criterion to distinguish real time threads. For example, variable kppreemptpri is used in the preferred embodiment as the threshold value to determine real time threads. Variable kppreemptpri can be set to any appropriate value depending upon system applications. Thus, if the thread is unbound and its priority is above kppreemptpri, the thread is put on the high priority real time queue at step 904. At step 905, a processor is selected to schedule the thread on before proceeding to step 907. If, at step 903, it is determined that the thread has a priority below kppreemptpri, then the processor proceeds to step 906 to put the thread on the processor it last ran on and proceeds to step 907.
FIG. 10 illustrates the processor selection step 905 of FIG. 9 in greater detail. At step 1001, "best processor" is set to be the processor the thread last ran on. Then each processor in the system determines if its current thread is of lower priority than the thread being inserted at step 1002. If its current thread is of higher priority, then it proceeds to step 1005. Otherwise, a determination is made at step 1003 whether the processor's current thread is of lower priority than the thread on "best processor." If the current thread is of lower priority, then at step 1004, "best processor" is set equal to current processor. At step 1005, "best processor" is selected as the target processor to schedule the thread being inserted.
Turning back to FIG. 9, after a target processor is selected to run the thread, a determination is made, at decision block 907, as to whether the thread has a higher priority than the last thread the processor committed to. If the thread has a higher priority, the processor is notified at step 908 by setting some local variables, for example cpu_runrun and cpu_kprunrun variables. If the thread does not have a higher priority at step 907, the scheduling processor continues to step 909.
It is understood that particular embodiments described herein should not limit the present invention thereby. This invention can be practiced in connection with any multiprocessor system that uses a preemptive priority scheduling system.
Thus, a process scheduler or dispatcher for a multiprocessor system suitable for real time applications has been described.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
You won't be able to dismiss this by usual means (escape or click button), but you can close it programatically based on user choices or actions.
"These enclosure cards were perfect to go along with our formal invitations. We were able to work in information about the reception location, directions, and RSVP instructions (since we were having our guests RSVP online). Great back and forth with the custom designer. Only docked 1 star for design because I would have loved if it automatically came with the same back design as the invitation (instead of plain white)."
"I used this card for directions. It looked beautiful. I was very happy with the overall look. The quality was great. I do recommend."
"My fiance and I selected this enclosure card to list accomidation options for our destination wedding in Key West, FL. We ordered the sample in the basil color first and thought it looked great, but decided to change the color to Bay to fit with the rest of the colors we are using for our wedding. The paper that the cards are printed on is a nice heavy card stock and custom color came out looking beautiful!"
"I liked everything about the product. The "milk" color font is not as ivory-like as I thought, but all in all, nicely done cards."
"I love how I was able to personalize this card to include information on our wedding gift registry. The black was not as deep or rich as i expected but the matte was interesting."

subset: commoncrawl


text:
City anchor: BMC overwhelmed as 17,000 apply for 400 engineers posts
Top Stories
- Manmohan Singh a 'person of integrity, probity', says Sonia
- Now, a sting in Kejriwal's tale: Colleague taped him saying let's break Cong
- Dimapur mob lynching: Police say it's rape, Naga govt says could be consensual sex
- Aamir Khan: I apologise if 'PK' has hurt sentiments
- The AAP exchange, letter for letter
BMC has received a whopping 17,000 applications for 400 vacant posts of engineers, and the civic administration will for the first time screen them through an online entrance test later this week. The civic administration has appointed an agency which conducts similar exams for banks.
The vacancies are for posts of sub-engineers and junior engineers in categories such as civil and mechanical, and architects for crucial civic departments like roads, solid waste management, water supply and sewerage.
"We had recruited engineers from other districts such as Latur, Marathwada, Sangli based on qualifications through walk-in interviews. It is usually easier to get higher marks in such places as compared to here, as Mumbai University has a tougher system," said Rahul Shewale, standing committee chairman and Shiv Sena corporator.
A senior official from the roads department said, "The engineers recruited last year did not match up to the civic administration's standards. These recruits were mostly from outside and did not know much about the civic and infrastructure issues in Mumbai to be able to work on the ground level."
General secretary of BMC's Engineers Union Sainath Rajadhyaksha said, "This recruitment is for crucial departments such as roads and hydraulic engineering, which need the best talent in specialised fields. During last year's recruitment drive, we selected engineers based on highest marks. Engineers from Latur and other districts who scored 90-95 per cent were selected while better applicants from Pune and Mumbai were rejected."
The online entrance exam will be followed by an interview or an oral test. Final selection will be based on the applicants' educational qualifications, including Marathi as a subject.
How okay is your GK?
Applicants will have to answer general knowledge questions like 'who wote the novel Two States', 'For which food item has the US Patent Office given a patent to a Texan company', and 'which state has the maximum population below poverty line'.
... contd.


text:
@mrconventrix I'm having a totally uninteresting time. :) How about you?
Rainbow Dash Network is a microblogging service brought to you by womaninflatesaballoonandsitsonitandpopsit.com. It runs the StatusNet microblogging software, version 1.0.1, available under the GNU Affero General Public License.
Content and data of Rainbow Dash Network are private and confidential.
Content and data copyright by Rainbow Dash Network. All rights reserved.
Switch to mobile site layout.


text:
- Description
- Specs
- Reviews
- Catalogs
World's Largest Aftermarket Motorcycle Parts and Accessories Superstore!
Input the part number and quantity to add a part directly to your cart.
Everyday Low Price: $5.99
Gold Club Price: What's This? $5.39
J&P Part: 133-081
rider357 Posted:
Good quality as usual from Zan in the Flydanna!
stevesgirl57 Posted:
Bought this for my boyfriend, wears it all the time when he rides.
wyodiver Posted:
Fits well and does all the things you would expect it to do. Also brings attention to the MIA/POW issue.
tereichert Posted:
enjoy this purchase very much
Requires a browser that supports HTML5.
Call Us 24/7 1-800-318-4823


text:
Xavier can't control his overwhelming tendency to lash out at others. Chased endlessly, MarcX runs for his life.
Loading more stuff…
Hmm…it looks like things are taking a while to load. Try again?
TM + © 2015 Vimeo, LLC. All rights reserved.
Made with k in NYC.
Your content preferences apply to any Vimeo videos you view. Learn more about content preferences in our FAQ.


text:
Teachers accept cuts
|| Print |
|High Five
|Friday, June 19, 2009
In order to protect classrooms, many Portland-area teachers have accepted pay freezes and other cuts. But while those schools will see few changes in the fall, smaller districts will have larger classes and fewer programs to make up for budget shortfalls.
Read the full article at Oregonlive.com.
|Get on the bus!
|Bike Chic: 7 stylish options for cyclists
|Beam Me Up
|Power Players
|Emperor of the Sea
|Epitaph for a Boondoggle
|Student loan debtors face default in repayment strike
|Jay Z unveils streaming music service
|Volvo plans $500M car factory in US
|Oil crash starting to hurt in Texas
|Swiss bankers guilty of tax fraud avoid jail
|US grants Texan rhino hunter permit to bring back trophy
|Norwegian Air tweaks cockpit rules after Germanwings crash
A new report highlights how Oregon bankers are giving back to their communities.
Since 1932 Tidewater Transportation & Terminals (operating as Tidewater Barge Lines and Tidewater Terminal Company) has operated a multicommodity transportation and terminal company based in Vancouver, Washington. The friendly expression on the company's shipping containers reflects the attitude of about 330 safety and community-conscious employees but belies how complicated the barge business really is.
The Port of The Dalles has run marine facilities since the 1930s, but they are part of a larger mission to strengthen the local economy. They focus on regional economic development with a strong bent toward adding good-paying jobs in high tech, manufacturing and other industries.
The Atkinson Graduate School of Management at Willamette University has maintained its business accreditation by AACSB International—The Association to Advance Collegiate Schools of Business.
Like the advent of the locomotive, the cloud creates business opportunities that simply weren't possible before now. Get up to speed fast in May at an exciting cloud-empowered Portland event.
Registration is now open for Portland Business Alliance's Annual Meeting, one of the largest business gatherings in Portland each year.


text:
LOOKING for: Dirt Cake
Does anyone have a recipe for this? One that you made and liked. Thanks!!!!
There are as many recipes as there are people!
I made one for my grandson a while back, make a brownie from a mix in a 4 inch deep springform pan, made a double batch of cooked Jello chociolate pudding put that on top, whirred some Oreos in the cuisinart and added them on top, added some of those speckled malted milk balls for rocks, buried some gummy worms and set it in front of him.
Word of warning....the gummy worms melt and become a slimy mess if not eaten promptly....leftover cake is not a good thing if it has gummy worms in it!!
Linda C
I've made this one a number of times:
1 pk Oreo Cookies
1/4 c butter, melted and cooled
1 8oz pk cream cheese
2pk instant chocolate pudding
3 c milk
12 oz container Cool Whip
Gummy worms.
In food processor, chop Oreos and butter.
Reserve 1 c crumbs and press the rest into a 9x13" pan.
Mix next 3 ingredients until smooth. Fold in Cool Whip and spread over Oreo Crust. Top with reserved crust and chill 2 hours. Top with gummy worms and serve.
I have made this many times. We call it Dirt Dessert and use the recipe roselin 32 posted. I served it in a new flower pot or hanging planter. You may use a bowl inside of the pot if you have one that fits and will not show. I place chocolate crumbs on top and place a new small garden scoop in the side and stick a sprig of fake flowers in the center. It looks just like a real flower pot in bloom. Use the scoop to serve.


text:
Covario: 2014 Search Outlook for Brand Advertisers (Blogshare)
ADOTAS – In a recent blog post, Covario's head of global paid media strategy, Alex Funk, offered a 2014 Search Marketing Outlook for Brand Advertisers, as well as reporting on the Death of 10 Blue Links. But first, he recapped the year just past and how it set the state for the year ahead.
"With the door officially closed on 2013, we pause to look back at a year where saw many changes in the Google search landscape," writes Funk. "As noted in a previous post, the Knowledge Graph, Local Carousel, and the more recent algorithm change Hummingbird all brought large changes to brand advertisers.
"In 2013 Product Listing Ads (PLAs) became common place and began cannibalizing click share from traditional text ads. But the biggest change for advertisers came around the mid-year point with the upgrade to Google's Enhanced Campaigns (previously thought to be the AdWords Apocalypse). This overhaul of a decade old system bestowed advertisers more rich text ad formats, with pictures, larger ad copy, more sitelinks and ad extensions options than we had ever seen."
Reader Comments.
No comments yet
Leave a Comment
Article Sponsor
More Features
- A Clear View–Finally! Sizmek study validates IAB's 70% viewable threshold for measured impressions
- "Cassandra Report: Gen Z" Uncovers Massive Attitude Shifts
- Solving the Cross-Device Problem
- Sizmek Presents: Ads of the Week March 23rd -27th
- iPinYou Releases 2015 Report: Key Trends & Insights of Programmatic Advertising in China


text:
VIEWS: 37 PAGES: 1 CATEGORY: Business POSTED ON: 10/23/2011
how quickly the list of google adsense
bloggers want to, I let my artike Copas trick or how quickly the list English-speaking blog on blogging trick, do not of google adsense forget to include the source yes.Just copy and paste to 10 articles met. Yesterday I lists 10 articles + 2 Photos, 2 hours of direct approved 6. Once you've shared 10 articles / photos / video, my friend will instantly presented with google adsense registration form, please enter a new email on the form before registration google adsense in Flixya, then check your email inbox sign up to get links google adsense, please Google adsense adsense program could be the register as usual , self data content based on ID most popular among bloggers, popular because 7. After the list of google adsense, please wait many are already direject, many are banned, the for notification from google. While waiting for it's disabled and many are successfully able dollars good buddy still submit articles / photos / videos from google adsense. When creating a new blog on Flixya. on blogger, we are automatically presented with google adsense registration form (on the Hopefully your Adsense approved, approved Monetize tab).But, if the content of our blog in time varies, if you've done in accordance trick Indonesian language, it is hard to be above 90% chance of approval approved. Nha for bloggers who have repeatedly rejected it and adsense for bloggers who want a list of google adsense, in this post I will describe a fast trick on adsense approve it. Yesterday I practice this way for my friend daftarin, 2 google adsense approve within 3 hours. just please be listened to these tricks. Register googel adsense tricks that I describe here is to use third-party sites, namely flixya.com. Flixya is a video sharing websites, photos and blogs that work with Google. So google adsense rate blogs, videos and photos on Flixya for our Adsense. With Flixya, google adsense can approve most cepet (which I've experienced) 2 hours. Immediately, to do the following: Preparation step (step recommendations): 1. Make a new email in Gmail (Recommendation) 2. Secondary Email not have to be filled (Recommended), because if charged and the email was never registered with google adsense, adsense you are likely to be rejected 3. Done email list, follow the next steps under the Registration step Flixya and Adsense 1. First, to the scene in Flixya.com 2. Please list (sign up), just fill out the registration form according to the data mate, and that already use the new email list above 3. Check your email for verification Flixya 4. Once you are registered with Flixya, you must share at least 10 pictures / video / blog (article) 5. I recommend my friend share the blog (the article) only. Try to speak english article or topic of interest (tips, tricks, computer, SEO, etc.). If
Pages to are hidden for
"google adsense"Please download to view full document


text:
Log Out
Call in to speak with the host
(323) 927-2913
France born and Brooklyn raised Pascal Antoine joins host Alice B. of www.kiskeacity.com to discuss the nuts and bolts of his recent move to Haiti despite having no close relatives there.
Pascal Antoine is the founder of www.HaitiXchange.com, a multi-media website that features Haitian news and culture. He is a media entrepreneur, video editor, producer and voice-over actor. A graduate of the Massachusetts Institute of Technology, he was born in Paris, France and raised in Brooklyn New York by Haitian parents. He has recently decided to make Port-au-Prince, Haiti his home, following a lifelong desire to contribute to the country's advancement from the source itself.
Sorry we couldn't complete your registration. Please try again.
Please enter your email to finish creating your account.
old-style code for hosted blogs
Player Size
300 x 295
400 x 370
640 x 550
Receive a personalized list of podcasts based on your preferences.


text:
Get An Early Taste of The Roast of Justin Bieber In The Brand New Red Carpet Pre-Show
Watch the red carpet pre-show online.
OMG Rihanna Just Dropped Her New Single: Hear It Now!
Our new fave song
Ed Sheeran Surprises A Couple At Their Wedding And Remains Coolest
Prepare to cry
Zayn Malik Has Officially Left One Direction
October 31st, 2012
So, what do you get when you have N*E*R*D's Pharrell, Miley Cyrus, and Odd Future's Tyler, the Creator together in a studio? Beats us. Pharrell tweeted out a picture of the three of them in the studio and we're so curious as to what they have cooking up! But seriously, this is probably the most interesting and incredible collaborations we've seen in awhile! Miley recently revealed just how awesome the moment was when Pharrell said that he wanted to work with her saying, "It was magic. Pharrell said, 'Don't be offended because this is how I talk, but [I thought], 'That b***h is actually living. She's not sitting there with her Momager's chain on her door. I want to free that b***h. I want her out of her cage'." Not the most eloquent thing Pharrell has said, but ah well. Pharrell makes so great music.
This news comes hot off the heels of reports of Miley's upcoming wedding nuptials to Aussie hottie Liam Hemsworth. Miley Cyrus is set to marry the guy several times in different locals and has set aside at least a million dollars for the party. Nuts, no?
What do you guys think? Check out Tyler, The Creator's Yonkers video below and tell us your opinions in the comments section!
Tags: miley cyrus, n*e*r*d, Odd Future, pharrell, Tyler The Creator
Posted on Wednesday, October 31st, 2012 at 1:41 pm by Aimee and is filed under Blog, Celeb Life, Music.Tweet


text:
I ordered my contact juggling ball on New Year's Eve, it was my January goal for a new year of 12 new hobbies. I was worried that I wouldn't have it...Read More ->
This site is truely the Wal-Mart for all your magic needs. You can be guaranteed the best price and reliable service.Read More ->


text:
View Questions and Answers by Category
When an SQL select statement doesn't return any rows, is an SQLException thrown?
Hi Friend,
No. If you want to throw an exception, you have to wrap the SQL related code in a custom class and throw Exception like ObjectNotFoundException when the returned ResultSet is empty.


text:
Start preparing your nomination today - find out how to nominate here.
Nominations close on 02nd April 2015.
Current Individual or Corporate members of the Institute of Public Administration Australia WA (IPAA WA) can nominate an individual or organisation per the nomination criteria (find out more on becoming a member).
These Awards are open to any employee or organisation (as applicable) that works in Western Australia in any tier of the public service including; Local, State, or Federal Government, the Not-for-Profit sector and Academic sectors.
Entering the Achievement Awards provides you with the opportunity to:
There are a total of 15 Awards, ten open to individuals and five best practice awards for organisations.
View the Judging Panel list here.
There are limited opportunities to sponsor an Award category. Please contact us for further information.


text:
Student Loan Default Rate Lowest in History
September 21, 2004
The Department of Education announced a record low 5.2 percent default rate on federal student loans for the 2002 federal fiscal year. The default rate is calculated using the percentage of student loan borrowers defaulting within two years of leaving a higher education institution.
The default rate, which is also calculated for borrowers from individual institutions (known as the "cohort default rate"), is at record low levels because of historically low interest rates and better management from the Department of Education, according to an ED news release. ED also announced availability of cohort default rates for institutions.
Institutions can be dropped from participation in the federal student loan program if their default rate is either more than 40 percent for one year or more than 25 percent for three consecutive years. Only one institution exceeded the cohort default rate in FY 2002.
Until this year, historically black colleges and universities and tribal community colleges had been exempt from the cohort default rate sanctions. Although the exemption expired on June 30, 2004, all HBCUs fall below the default rate thresholds and are thus eligible for participation in the federal student loan program.
For more information, see the Education Department Web site.
Stay Current
Latest Headlines
- Financial Responsibility Scores Released for FY13
- IRS Publishes Guidance on "Cadillac" Health Coverage
- 2014 NACUBO-Commonfund Study of Endowments Now Available Online
Upcoming Events
Distance Learning
- ON-DEMAND: How to Build, Develop, and Support a Compliance Program at Your Institution
- ON-DEMAND: Strategic Tuition Assessment and Tuition Restructuring
- ON-DEMAND: Are Shared Services Right for Your Organization – The KU Journey
- ON-DEMAND: VIRTUAL: 2014 Annual Meeting
- ON-DEMAND: VIRTUAL: Student Financial Services Conference
- ON-DEMAND: VIRTUAL: Higher Education Accounting Forum
Business Officer
- A Guide to College and University Budgeting: Foundations for Institutional Effectiveness, 4th ed. - by Larry Goldstein
- NACUBO's Guide to Unitizing Investment Pools - by Mary S. Wheeler
- Managing and Collecting Student Accounts and Loans - by David R. Glezerman and Dennis DeSantis


text:
"Great company with great people. "
- Comp & Benefits
- Work/Life Balance
- Senior Management
- Career Opportunities
I have been working at Contech Engineered Solutions
Great work atmosphere, very professional yet laid back. Great people, everyone seems to really enjoy their job. Benefits are great.
The work hours are long and compensation for work may not be as high as other companies. The work environment does not allow for much physical activity.
- Any Location
- Any Job Title
1 person found this helpful
"Mid-size with the small company atmosphere "
- Comp & Benefits
- Work/Life Balance
- Senior Management
- Career Opportunities
I worked at Contech Engineered SolutionsPros
Free snacks and beverages
Competitive pay
experienced upper managementCons
Lack of direction
No development opportunities for non-management employeesAdvice to ManagementAdvice
Establish programs and training for entry level employeesRecommendsNo opinion of CEO
2 people found this helpful
I worked at Contech Engineered SolutionsPros
Freedom to make own schedule. pay was decent when construction was strong, overall an interesting jobCons
poor management, no opportunity for advancementAdvice to ManagementAdvice
get rid of middle managementDoesn't RecommendNo opinion of CEO


text:
26, Saint Rose, LAI am passionate about helping people I love life and love helping others. I enjoy being outside and I love to travel and see the world. I have never really done the online dat...
54, Destrehan, LAI am an easy-going person who enjoys a good laugh and tries to see the bright side to everything. I enjoy going to festivals, the French Quarter, the beach, traveling, gardeni...
28, Norco, LAHi! My name is desiree!I'm an exotic half Spanish, half Caucasian lady. I'm a laid back, mellow, and go with the flow kinda girl. I'm a Big Music, fantasy football, and mo...
80, Norco, LAI love to cook ,eat and be merry,best TV programs ,westerns,bioragofies[spel?],love to fish ,lie water sports,fle markets,antiques,and brozing on the computer.Lots more we wil...
47, Destrehan, LAMy family is a very important part of my life, and as it is a large family, it is loud and complicated at times. I love movies, music, swimming, biking, and most outdoor acti...
27, Destrehan, LAHello! :) Decided to give this a try...I am so thankful for my life and want to share it with someone who will help me live it to the fullest! I am passionate about learning,...
28, Destrehan, LAIm a down to earth woman with a big heart who love helping others. I enjoy reading,dancing,painting,fishing,going to church and spending time with my family and friends.
55, Norco, LAI am the single father of an awesome 7-year old son, whose mother died in March of last year. I am gainfully employed in an honorable profession; have an excellent credit rat...
60, Kenner, LAI love Louisiana my birthplace, a gumbo mix of citizens with ethnic backgrounds and personalities. Our diverse backgrounds and cultures are unique and provide an environment ...
64, La Place, LAI try to live a Christian life. I am divorced and would like to have someone to do things with. Life is shorter than most of us realize. I enjoy most things in life and am ...
58, Kenner, LAI am passionate about my family and friends. I recently retired and am learning to just enjoy life. My bucket list includes visiting all 50 states during my lifetime, of whi...
38, Kenner, LAI am ready to open myself up new possibilities. I have lived most of my life in the GNO. I love the community I live in. There is always something to do. I spend most of my ti...
Browse Catholic Singles by Gender:
Catholic Dating By Major City:
- Destrehan,
- Norco,
- Luling,
- Saint Rose,
- Hahnville,
- Boutte,
- La Place,
- Kenner,
- New Orleans,
- Paradis,
- Metairie,
- Ama,
- Edgard,
- Westwego,
- Reserve
Catholic Dating By Diocese:
- Archdiocese of New Orleans,
- Diocese of Alexandria,
- Diocese of Baton Rouge,
- Diocese of Houma-Thibodaux,
- Diocese of Lafayette,
- Diocese of Lake Charles,
- Diocese of Shreveport


text:
Public urged to voice views on parish's future
Published: Monday, November 5, 2001 at 6:01 a.m.
Last Modified: Sunday, November 4, 2001 at 11:00 p.m.
BAYOU BLUE - A local activist group is urging residents to attend the first public forum on the parish's master plan.
The meeting is scheduled for 6 p.m. Nov. 8 at the Houma-Terrebonne Civic Center.
"As things currently stand, Terrebonne property owners are not included in the right-to-know loop," said John Rochelle, co-chairman of Keep Our Peaceful Environment.
Though the group's main purpose is to oppose a dirt car-racing track in Bayou Blue, it has also gotten involved in other community issues.
"At an early meeting of Bayou Blue-Coteau homeowners in November 1999, a parish official explained there was no ordinance that required the parish to tell people about a proposed dirt racetrack," Rochelle said. "KOPE hopes to change that situation by working within the system."
At the meeting, public officials and consultants will discuss a parish "inventory" that describes current land uses and rules that affect growth. Also set to be discussed are population shifts and future development outlooks.
The meeting will give parish residents the opportunity to join focus groups that will influence the plan, which is expected to set the course for growth and development in the parish for years to come.
KOPE said his group will be active in the process.
At the group's October meeting, its mission statement was changed to "promote a program of civic education that will encourage residents of the two-parish area to better understand land-use issues through access to the press, public forums and public records."
Matt Gresham is a staff writer for The Courier. He can be reached at 857-2204 or by e-mail at email@example.com.
Reader comments posted to this article may be published in our print edition. All rights reserved. This copyrighted material may not be re-published without permission. Links are encouraged.
Comments are currently unavailable on this article


text:
Our special coverage of the closest race for years
Explore the personal stories of Syrian refugees in Lebanon
Gulf kingdom's top army officer says airstrikes into Yemen have pushed Houthi rebels out of contested air bases.
29 Mar 2015 09:48 GMT | War & Conflict, Middle East
Record number of voters turn out despite Boko Haram threat, but technical malfunction force officials to extend voting.
29 Mar 2015 10:38 GMT | Politics, Africa
US Secretary of State to stay in Switzerland to ensure deal on Iran's nuclear programme is agreed by March 31.
29 Mar 2015 10:36 GMT | Politics, United States
Denouncing deadly attack on Bardo museum, foreign dignitaries and Tunisians are expected to attend solidarity march.
29 Mar 2015 08:11 GMT | Middle East, Tunisia, Beji Caid Essebsi
Tens of thousands line streets to witness elaborate state funeral for country's first PM and founding father.
29 Mar 2015 09:34 GMT | Politics, Singapore, Asia Pacific
Father of one of 150 victims of plane crash in French Alps says pilot welfare must be taken into greater consideration.
29 Mar 2015 07:31 GMT | Europe, Germany
Rebel groups, led by al-Qaeda's Syrian affiliate, seize Idlib city for the first time after several days of clashes.
29 Mar 2015 05:06 GMT | War & Conflict, Middle East, Syria
Ahmed Idris and Ali Mustafa have been detained by the Nigerian military since Tuesday.
28 Mar 2015 13:38 GMT | Media, Africa, Nigeria, Nigeria Decides, #FreeAJStaff
The crisis in Yemen is at the top of the agenda at a meeting of Arab leaders in Egypt's Sharm el-Sheikh.
28 Mar 2015 22:54 GMT | War & Conflict, Middle East, Yemen, Saudi Arabia, Egypt
Africa's most populous country goes to the polls on March 28 to elect a president. And it's too close to call.
An Indian industrialist's love for the sport has made him create a cricket museum in his Dubai backyard.
28 Mar 2015 15:28 GMT | Sport, Cricket, Cricket World Cup, UAE
While Istanbul has long been a hub for migrants, Syrians have found themselves trapped in Turkey.
28 Mar 2015 13:32 GMT | Politics, Humanitarian crises, War & Conflict, Turkey, Syria: Broken Nation
Event offered space to put forward ideas for better society based on principles of equality, reciprocity and solidarity.
28 Mar 2015 09:23 GMT | Arts & Culture, Middle East, Tunisia
WHO aims to eradicate the infectious disease by 2018, but it remains endemic in three countries.
28 Mar 2015 09:04 GMT | Health, Polio, Afghanistan, Pakistan, Nigeria
A Saudi-led coalition has begun hitting Houthi targets in Yemen. But who is supporting the action? And how?
27 Mar 2015 15:45 GMT | War & Conflict, Yemen
It is a source of sustenance but also of tension and new political realities are now increasing uncertainty.
Egypt, Sudan, Middle East
A media post-mortem into the UK's surveillance report. Plus, why five years on in Argentina the media looks so familiar.
Media, Edward Snowden, Security
The untold story of how the Lebanese community overcame the odds and found their place in multicultural Australia.
Asia Pacific, Australia, Lebanon
How to keep a telenovela profitable and demanding sponsors happy while inspiring the production team to stay passionate.
Arts & Culture, Mexico, Latin America


text:
Wire your boat for power with electrical wiring, 12 volt batteries, fuses, fuse blocks, and switch panels from Blue Sea Systems and SeaSense. We have ProMariner Onboard Battery Chargers and Inverters plus solar panels and solar chargers from Sunforce. You'll find battery switches, ignition switches, 12 volt outlets, and power cords for shore power.
Xtreme 600 Marine Engine Compartment Heater
600 - 800 Watts
675 Cubic Feet
Dimensions: 8" x 4" x 5-1/8"
New! Sierra Carside Connector, Sierra Part #WH10240
Sierra Part #WH10240
Carside connector
Xtreme 450 Marine Engine Compartment Heater
450 - 625 Watts
350 Cubic Feet
Dimensions: 8" x 4" x 5-1/8"
Blue Sea 1011 12V DC Socket
Withstands rigorous movement
Designed for multiple mounting positions
New! Honda Parallel Cable Kit w/ RV Adapter
Obtain more power without having to upgrade
Used to power small AC units and other appliances
Double the power by chaining two generators
Blue Sea 2017 Dual PowerPost Cable Connectors, 2 x 3/8" ...
Designed for connecting high amp conductors
Includes one black and one red insulator
2 x 3/8" studs
Blue Sea Systems Automatic Charging Relay Only
Safe for installation aboard gasoline-powered boat
Accepts up to 4/0 battery cables
Tactile textures indicate knob position by touch
Simple on/off switching in normal operation
32V DC max
Honda EU2000i Companion, 50 State
Displacement: 98.5cc
AC Output: 120V 2000W max
Fuel Tank Capacity: 1.1 gal.
Dry Weight: 45.9 lbs.
Noise Level: 59 dB(A) @ rated load
Sportsman GEN10K 10,000 Watt Gasoline Generator w/ Wheel Kit
No Manual Switching Between Voltage
Includes Non-Flat Tires And Fold Down Handle
8 Gallon Fuel Tank
F6TC spark plug included
Runs 120V 240V At the Same Time
Honda EU3000iSAC Residential Generator
Eco-Throttle runs for 20 hours on 3.4 gal. fuel
Protected by Oil Alert
Convenient electric startup
Nearly silent operation-49 to 58 dB.
USDA-qualified spark arrestor/muffler
Honda EU1000IKC Generator
Eco-Throttle runs for 8.3 hours on 0.6 gal. fuel
Protected by Oil Alert
Can be run parallel with another EU1000i
Nearly silent operation-53 to 59 dB
USDA-qualified spark arrestor/muffler
Mastervolt Mass Combi APC Remote
Reads actual AC status of Mass Combi
Prevents overload situations from occuring
Remote connection cable is included
Blue Sea Terminal Feed-Through Connector
Protects cables from chafing
Designed for watertight installation
Mastervolt DC-DC Converter
Recreational and semi-professional use
Easy to install
Ideal for active telephone use
Sportsman Series 2,000-Watt Portable Generator
Ideal for camping trips or a backup power source
4-stroke 87cc 2.8-HP OHV engine with recoil start
Automatic low-oil shutdown prevents engine damage
1.8-gallon tank for use with unleaded gasoline
EPA approved
Blue Sea 1015 12V DC Plug And Dash Socket (1010 And 1011)
Withstands rigorous movement
Large contact surfaces
Blue Sea 2145 ML-Series Remote Control Contura Switch - (ON) OFF...
Champion Power Equipment 3500/4000 Watt Generator with FREE Wheel...
Includes FREE wheel kit ($50 value)
196cc OHV engine with cast iron sleeve
Fold-away handlebar for portability and storage
Easy starting and efficient combustion
Runs 12 hours on a full tank of gas at 50% load
Sperry Instruments Wire Tracker Wire Tracer
Audible and visual indication of wires
Adjustable sensitivity
Auto-off function
Select adapters included
Sierra Split Loom, Sierra Part #EC01620
Sierra Part #EC01620
Split loom


text:
When writing LINQ queries in C#, I know I can perform a join using the
join keyword. But what does the following do?
from c in Companies
from e in c.Employees
select e;
A LINQ book I have say it's a type of join, but not a proper join (which uses the
join keyword). So exactly what type of join is it then?


text:
New Movies (This Week): 'Black Sea,' 'The Boy Next Door,' 'Mortdecai,' 'Song One' and 'Strange Magic' [Video]
This week's new movie releases includes story lines involving stolen paintings, goblins, hockey and a little bit of everything else.
This week's new movie releases includes story lines involving stolen paintings, goblins, hockey and a little bit of everything else.
For the last five days, what's being called DeflateGate has been dominating the sports headlines.
The question at large: Did the New England Patriots deflate the footballs in the AFC Championship game -- a 45-7 win against the Indianapolis Colts -- last weekend?
It sure looks like it.
Madonna's upcoming album, 'Rebel Heart,' finally has a release date.
Gilda's Laughfest announced Tuesday that this year's Signature Event will celebrate the festival's fifth year with a lineup of returning LaughFest comedians coming together for the first time
LaughFest also announced the remaining acts for the 2015 festival, which will run from March 5 to 15 at venues in Grand Rapids, Lowell and Holland.
The Signature Event will take place on Tuesday, March 10, at DeVos Performance Hall and will be hosted by Michael Kosta, the winner of LaughFest's 2011 stand-up competition. The event will feature headlining acts from LaughFest's past years, including Jim Breuer, Kathleen Madigan, Sinbad and Justin Willman.
An elderly West Michigan man recently got a real shock when he found out that he had a 61-year-old son, despite trying unsuccessfully to have children with his wife throughout their marriage.
Parents who refuse to get their children vaccinated due to philosophical or religious reasons will now have to take more steps spelled out in a new policy by the Michigan Department of Community Health.
As of Jan. 1, parents will have to have their vaccination waivers certified by their local health department, WZZM-13 reported.
WGRD debuted Motley Crue's final single "All Bad Things" during Liquid Lunch today!
We first heard the song when they kicked off their final tour here in Grand Rapids at Van Andel Arena this past summer.
Check out "All Bad Things" and the new music video below!
Motley Crue also revealed details on the last leg of their final tour, called the Final Tour.
Two contestants on the newest season of "The Amazing Race" are from Northern Michigan.
Dating couple Rochelle Nevedal and Michael Dombrowski from Kalkaska will be taking part this season.
Former NHL great Mike Knuble, now retired from hockey and living in Grand Rapids, stopped by "The Jojo Show" on Tuesday to talk about the WGRD Pond Hockey Classic 2015 and his early days skating on ponds in the Kentwood area.
New Kids on The Block, with special guests TLC and Nelly, will be hitting the stage at Grand Rapids' Van Andel Arena on May 30 -- a Saturday.
Tickets go on sale on Saturday, Jan. 31.


text:
You can now filter search results with text. Example: "person: john" will search only person pages for "john".
As Ultron attacks at a grand scale, we get a look at what he's really all about.
It's time for the Season 5 finale! That means it'll be a totally relaxing and happy episode, right?
Diggle and Lyla get married! Obviously, nothing will go wrong and they live happily ever after, right?
Volume »
Published by Marvel. Started in 1973.
No recent wiki edits to this page.
A reprint series of earlier adventures of Thor.
Issue #19
Let There Be Chaos!
November 1, 1975
Issue #18
The Wrath of Odin!
October 1, 1975
Issue #17
If the Thunder Be Gone!
September 1, 1975
Issue #16
Abandoned on Earth!
August 1, 1975
Issue #15
This Battleground Earth!
June 1, 1975
Issue #14
And Soon Shall Come the Enchanters!
March 1, 1975
Issue #13
The Scourge of the Super Skrull!
January 1, 1975
Issue #12
The Wrath of Replicus
December 1, 1974
Issue #11
The Growing Man
November 1, 1974
Issue #10
To Die Like a God
October 1, 1974
Issue #9
The Flames of Battle!
September 1, 1974
Issue #8
The Thunder God and the Troll
July 1, 1974
Issue #7
To Become an Immortal
May 1, 1974
Issue #6
The Maddening Menace of the Super-Beast
March 1, 1974
Issue #5
The People-Breeders
January 1, 1974
Issue #4
Behold...the Living Planet
November 1, 1973
Issue #3
Thunder in the Netherworld
October 1, 1973
Issue #2
The Verdict of Zeus
September 1, 1973
Issue #1
The Power of Pluto!
August 1, 1973
This edit will also create new pages on Comic Vine for:
Until you earn 1000 points all your submissions need to be vetted by other
Comic Vine users. This process takes no more than a few hours and we'll
send you an email once approved.
Because you're new to wiki editing, we sent your
submission off to our moderators to check it over. Most
changes are approved within a few hours. We'll send an
email when it is.
Once you've earned over points you'll be able
to bypass this step and make live edits to our system.
Until then, gain points by continuing to edit pages.
No changes were submitted, nothing was done! Please make changes to the wiki!
Thanks for continuing to improve the site. Some of your changes are
now live. However, some of your changes were sent to moderation because you do not
have enough points to make those live edits. You need points to
live edit the changes you commited.
For the changes that went through, our robot math gave you points for this
Thanks for continuing to improve the site. Your changes are
now live. Our robot math gave you points for this
Use your keyboard!
Log in to comment


text:
I did not make this headline up
Who's ready for some Michigan Basketball?
Stream for tonight's Michigan mens bball game
Does anyone have a free stream for this game? Is it on t.v.?
Tip - Off 2013
Get ready!!!
Progress picture of Stauskas' off season weight gain (OMG Shirtless)
It'll be interesting to see how this affects his game.
GRIII > Gravity
Will be team MVP over McGary, write it down
Michigan assistant Jeff Meyer related the latest of Robinson's can-you-believe-it feats on Tuesday morning. During an interview with WTKA's Michigan Insider, Meyer explained that U-M players' vertical leaps are measured on a Vertec. The apparatus is a straight pole with movable tabs on one side. Players jump alongside the pole, reaching for the highest tab they can touch. The highest tab moved accounts for the individual's vertical leap.
Michigan's Vertec measures up to 12 feet, 3 inches.
Michigan needs a new Vertec.
"We've not had anybody inside our program get all 12 feet, 3 inches -- that was until Glenn Robinson," Meyer said.
Robinson stands 6-feet, 6-inches tall. He has an expansive wingspan, but is not a pterodactyl. He's always had a lengthy reach and shake-your-head leaping ability (just ask Minnesota). This latest feat, though -- reaching 12-foot-3 on the Vertec -- is a product of Robinson's offseason work.
2013-2014 Cagers Thread
So, my copy of the new Hail to Hoops & Hockey book arrived last night and I promptly read through the whole thing. With the Football Bye Week I figured it might be a good time to talk about just how excited you are for Michigan Basketball.
When I was a student I went to 1 basketball game (they lost. And were not good). I went to 3 last year and I live in Chicago. Michigan baskteball is back to being an event - and a damn good one.
The preview mag posits that there are maybe 5 teams that have as much talent as Michigan. Michigan will start lottery picks (as of now) at the 4 and 5 (or 3 and 4) with another great recruiting class coming in.
We also return a great shooter - and not just a (drink) who according to the coaches this morning on Michigan Insider has gained about 20lbs of muscle and added 6" to his vertical.
How good do you think this team will be? Can they win the B1G or the B1G tournament? What are you most excited for with Michigan Basketball?


text:
Funding Source: This study was funded by Merck & Co., Inc.
Migraine Treatment With Rizatriptan and Almotriptan: A Crossover Study
Article first published online: 27 APR 2009
DOI: 10.1111/j.1526-4610.2009.01404.x
© 2009 the Authors. Journal compilation © 2009 American Headache Society
Headache: The Journal of Head and Face Pain
Volume 49, Issue 5, pages 655–662, May 2009
Additional Information
How to Cite
Ng-Mak, D. S., Hu, X. H. and Bigal, M. (2009), Migraine Treatment With Rizatriptan and Almotriptan: A Crossover Study. Headache: The Journal of Head and Face Pain, 49: 655–662. doi: 10.1111/j.1526-4610.2009.01404.x
Conflict of Interest: All authors of this manuscript are employees of Merck & Co., Inc.
Publication History
- Issue published online: 27 APR 2009
- Article first published online: 27 APR 2009
- Accepted for publication January 6, 2009.
- Abstract
- Article
- References
- Cited By
- acute migraine;
- triptan;
- almotriptan;
- rizatriptan;
- onset of efficacy
Background.— Rizatriptan and almotriptan are effective and well-tolerated triptans that have not been compared directly.
Objective.— To evaluate the effectiveness of rizatriptan 10 mg and almotriptan for the acute treatment of migraine, in a real-world setting.
Methods.— Of a large, multicenter, open-label, crossover study, we conducted a substudy to contrast the effectiveness of rizatriptan 10 mg and almotriptan 12.5 mg for the acute treatment of 2 migraine attacks in a sequential, crossover manner. Time to outcome was assessed using stopwatches. Mean and median times to onset of pain relief (PR) and pain freedom (PF) for rizatriptan and almotriptan were compared. The effect of rizatriptan on times to onset of PR and PF, adjusting for potential confounding factors (treatment sequence, treatment order, and use of rescue medication), was computed via a Cox proportional hazard model.
Results.— Out of the 146 patients taking almotriptan as their usual care medication, 79 used stopwatch for both attacks. Significantly more patients taking rizatriptan achieved onset of PR within 2 hours after dosing than those taking almotriptan (88.6% vs 73.4%, P = .007). A higher proportion of patients taking rizatriptan achieved PF within 2 hours after dosing than those taking almotriptan (55.7% vs 45.6%, P = .10). Times to onset of PR and PF were significantly shorter with those patients taking rizatriptan than with those taking almotriptan (median time to PR: 45 vs 60 minutes, P = .002; median time to PF: 100 vs 135 minutes, P = .004). The adjusted proportional hazard ratios (rizatriptan vs almotriptan) for times to onset of PR and PF were 1.51 (95% confidence interval 1.20 to 1.88) and 1.42 (95% confidence interval 1.15 to 1.76), respectively. More patients were very satisfied when treating their attacks with rizatriptan than with almotriptan. Rizatriptan was preferred by most patients.
Conclusions.— Times to achieve PR and PF were significantly shorter for patients using rizatriptan, as compared with those using almotriptan.


text:
Download Document
Showing pages : 1 - 3 of 3
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
This is the end of the preview. Sign up to access the rest of the document.
This is an unformatted preview. Sign up to view the full document.View Full Document
Print Request: Current Document: 9 Time Of Request: Tuesday, June 03, 2008 Send To: ntun0165084 [3e98c600:019dc63] NOTTINGHAM TRENT UNIVERSITY BOOTS LIBRAR GOLDSMITH ST NOTTINGHAM, GBR NG1 5LS Terms: (tinn v hoffmann) Source: All Subscribed Sources Project ID: None 14:38:55 Page 1 Tinn v Hoffmann & Co (1873) 29 LT 271 Court: pre-SCJA 1873 Judgment Date: circa 1873 Cases referring to this case Annotations: All Cases Court: ALL COURTS Sort by: Judgment Date (Latest First) Treatment Case Name Citations Court Date Applied Manchester Diocesan [1969] 3 All ER 1593, Council for Education v [1970] 1 WLR 241, 21 P Commercial and General & CR 38, 114 Sol Jo 70 Investments Ltd Ch D circa 1969 Followed Willis v Baggs and Salt (1925) 69 Sol Jo 543, 41 TLR 453 KBD Signal circa 1925 Catchwords & Digest CONTRACT - FORMATION OF CONTRACT - CONTRACTS MADE THROUGH THE POST - OFFER WHEN MADE - LETTERS CROSSING -- WHETHER CONTRACT Two persons, each in ignorance at the time of what the other had done, wrote a letter to each other on the same day, the one offering to buy a certain article at a certain price, and the other offering to sell the same article at the same price. The letters crossed each other in the post: Held such cross offers would not make a binding contract, and the offer in one of such letters could not amount to an acceptance of the offer contained in the other. 'Reply by return of post,' does not mean exclusively, 'reply by letter by return of post.' A reply by telegram or by verbal message, or by any means, not later than a letter sent by post would reach its destination, would equally satisfy the requisition (per curium). ---- End of Request ---Print Request: Current Document: 9 Time Of Request: Tuesday, June 03, 2008 14:38:55 ... View Full Document
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
The Undignified Death of the Casus Omissus Rule
Q-3 of 2000 (Nov) (B)
Tinn v Hoffmann
Tinn v Hoffmann-Students
Manchester Diocesan Council of Education v Commercial
Offer + Acceptance
Offer + Acceptance
Copyright © 2015. Course Hero, Inc.
Course Hero is not sponsored or endorsed by any college or university.


text:
Shop Online
The item you requested cannot be found.
Please go back and try again, or visit the home page: http://www.nittanyoutlet.com .
Recommended Accessories
Penn State Navy Scarf With Frills
Penn State Reversible Camo Winter Hat Block S
Penn State Infinity Scarf Navy and White Warm
Penn State Camo Winter Hat
Mossy Oak
Penn State Nittany Lions Knit Hat White
Penn State Bold Navy Scarf
Penn State Navy Scarf Two Tone
Penn State Nittany Lions Winter Ski Gloves


text:
Family members of an elderly Bishop woman who went missing almost two decades ago are offering a reward for any information that may provide some resolution in the case.
The Bishop Police Department investigated when Jennie Wyckoff, 90, disappearance 19 years ago, but the trail went cold and officials ultimately declared her dead after three years.
Earlier this year, Bishop Police Chief Chris Cater, at the request of the family, decided to revisit the case to see if modern technology could provide any new leads.
As Carter works his side of the case, the family is hoping someone in the community may remember something that could help the investigation.
ŌĆ£We, the family, are offering a reward of $10,000 to anyone who finds the clue to this mystery that will allow the Bishop Police Department to close the case,ŌĆØ a statement from the family says. ŌĆ£It is likely that a small item or distinct memory may bring an answer to this puzzle and then the daily thoughts of never knowing what happened to our loved may be closed forever.ŌĆØ
Wyckoff went missing from High Sierra Manor assisted living facility, her ŌĆ£Memory Care secure facility,ŌĆØ on Feb. 3, 1996. The facility was located at 371 S. Warren St., and later became Sierra Villa, and today houses the Inyo-Mono Association for the Handicapped offices and thrift store.
According to the family, Wyckoff ŌĆ£left on a snowy, cold night ŌĆ" wearing her night clothes and carrying nothing to keep her warm. Despite the best search efforts of this community, its service organizations and many volunteers in this county and beyond, no trace has yet been found.ŌĆØ
The Bishop PD ruled the investigation was a ŌĆ£cold caseŌĆØ and Wyckoff was declared deceased in 1999.
Earlier this year, WyckoffŌĆÖs family contacted the PD, asking that investigators reexamine the case, which had never been closed.
Carter is personally handling the investigation. He said earlier this year that he hopes new technology and the national DNA database can provide more clues as to the fate of the missing woman.
Staff at High Sierra Manor reported that Wyckoff had last been seen in her room at about 8 p.m. on the evening prior and was discovered missing when they went to check on her the morning of Feb. 3. During the initial investigation, police learned that Wyckoff was suffering from AlzheimerŌĆÖs disease and had a history of walking away from the care facility.
The search for Wyckoff continued for several days and, according to Carter, every reported sighting was investigated. Hospitals and law enforcement agencies throughout California and Nevada were notified and both local and national media broadcast WyckoffŌĆÖs picture and description to the public.
ŌĆ£Despite these efforts, Jennie was never located,ŌĆØ Carter said earlier this year.
The case was reexamined in early 1997, but by that time, Carter explained, a civil action had been filed by the family against High Sierra Manor ŌĆ£and involved witnesses were reluctant to speak with investigators.ŌĆØ
While no clear indication of foul play was ever present, the possibility was never eliminated. The 1997 inquiry revealed no new leads or clues and the case remained dormant.
According to grandson Dave Mull, the smallest item, such as bone fragments or clothing, might be a clue that will provide the answer so long sought by the family. ŌĆ£The family lives each day in the hope that some news will come which will answer the question of what happened on that ago February night.ŌĆØ
Anyone with new information is asked to contact the Bishop PD at (760) 873-5866 or Dave Mull at (760) 876-5586 or (760) 878-2354.


text:
Vassago used to sell off inventory on black friday, and while there gone, is anyone else taking up the tradition?
Any shops having specials, or maybe frame makers.
Just curious and thanks
Results 1 to 5 of 5
Thread: Vassago and Black Friday
Hot Deals See All Hot Deals >>
Latest Mountain Bike Articles
MTBR on Facebook


text:
Photo Galleries
< MyNorthwest
Wednesday in photos
Aug. 14: World Athletics Championships in Moscow, Fire crews investigate a UPS cargo plane crash, Indian Navy kilo class submarine fire.
1 of 15
A boatman takes tourists for a ride around the water lily plants on a lake at Zizhuyuan Park, known as Purple Bamboo Park in Beijing, China Wednesday, Aug. 14, 2013. Purple Bamboo Park, one of the seven biggest parks in Beijing, is a classical Chinese garden which draws many tourists. (AP Photo/Andy Wong)
Photo by Andy Wong
Photo by Andy Wong
1 of 15
More Photo Galleries
Hundreds gather to commemorate one-year mark of Oso mudslide
A solemn crowd gathered to honor 43 people who lost their lives a year ago in the deadliest landslide in U.S. history.
Photos: Oso one year after deadly mudslide
Sunday is the one-year anniversary of the slide, and although most of the mangled cars and homes have been cleaned up, reminders of loss are everywhere.
Week in photos
Take a look at the best photos of the week from around the world.
Tuesday in photos
St. Patrick's Day, March 17, 2015.
Monday in photos
Monday, March 16, 2015.
Week in photos
Photos from around the world this week.
Friday in photos
The second of three Friday the 13ths in 2015; Friday, March 13, 2015.
Thursday in photos
Thursday, March 12, 2015.
Wednesday in photos
Wednesday, March 11, 2015.
Tuesday in photos
Tuesday, March 10, 2015.


text:
How many wicking baskets for a shallow container?
Athenian(USDA 10B/Sunset 22)June 3, 2012
I'm thinking of using a galvanized washtub as a self-watering herb planter. Since the tub is only about 11" tall, I'm thinking of using multiple 2" net pots as wicking baskets. Should I use 2 or 3 wicking baskets for a 24" diameter tub or just go with a larger 4" backet and shallower soil?


text: TOP 10 Top 10 Entertainment Coolest Tech Gadgets Back to Top ▲ Coolest Tech Gadgets 3 Never call a locksmith again Share on Facebook Share on Twitter 0 Shares Thanks to this nifty gadget, you need never prostrate yourself before the locksmith again. Next Page TOP 5 4 3 2 1 Comments Show Comments More Like This Tech News This New Workplace Technology Is Actually Pretty Creepy Read More Tech News Good News, Everyone. The Government Just Made Our Lives A Whole Lot Safer. Read More A Better Look Will 3D Printing Really Change The World? Read More Entertainment Galleries 50 Cool Things You Can Make With A 3D Printer Read More Guy Gear BlackBerry Is Reborn: Why The 10 Is So Good Read More Top 10 Dating 10 Surprisingly Effective Places To Meet Beautiful Women That You Might Have Overlooked Read More Promoted Around the Web Special Features Special Feature 50 Ways To Look Better Than You Do Now. Smooth Up, Man. Read More AskMen Exclusive Want To Win $1,000 To Stock Your Home Bar? Read More


text:
Some facilities remain closed in low season, please check at the time of booking if there is an activity or facility which is key to your holiday.
Camping Les Ilates
Ile de Rè, VendeeSite code: AT013
Facilities and Amenities
- Languages Spoken: French, English
- Other Services: Tourist information
- Internet Access Available
- WiFi Free - may only be available in certain parts of the parc
- Credit Cards Accepted: Eurocard, Mastercard, Visa, Maestro
- Bar sells butter and jam
- Restaurant: Small site restaurant serving traditional and local produce Kids Menu Available Local Dishes Available Location: Main facilities area Open 13/05/2015 - 03/09/2015
- Takeaway: Pizzas, burgers, chips etc. Open 14/04/2015 - 14/09/2015
- Bar: Open 04/04/2015 - 27/09/2015 Location: In the restaurant
- Animation Team: Aquagym, sports tournaments, karaoke, bingo etc. Open 11/07/2015 - 22/08/2015
- TV Room: tv
- Games Room: Pinball, air hockey, video games, pool table, table tennis
- Family Disco: Open 11/07/2015 - 22/08/2015
- Adult Disco: Open 11/07/2015 - 22/08/2015
- Children's Disco: Open 11/07/2015 - 22/08/2015
- Hot Showers
- Baby Baths
- Baby Changing
- Dishwashing Sinks
- Toilets
- Children's Toilets
- Washers: 2 x machines €5.00 per load
- Dryers: 2 x machines €3.00 per load
General Information
Dogs allowed on this campsite. Leash required. Max dogs: 2.Dogs are allowed in the following Eurocamp accommodation: All accommodation types except Aspect, Vista, Espace, and Safari tent.
This Parc has facilities for disabled people. Please contact our Customer Sales Staff for more information.


text:
Coverage: ESPN/WatchESPN
7:15 PM ET, December 3, 2013
Carrier Dome, Syracuse, New York
Photo 16 of 43
SYRACUSE, NY - DECEMBER 03: Head coach Jim Boeheim of the Syracuse Orange talks with his team during a time out in the second half against the Indiana Hoosiers at the Carrier Dome on December 3, 2013 in Syracuse, New York. Syracuse defeated Indiana 69-52. (Photo by Rich Barnes/Getty Images)
Photo 16 of 43


text:
The Top 10 In Action Sports
01Sailing Into A Cyclone: This Has To Be One Of The Most Dangerous Races On Earth
02Ever Wanted To Own Your Own Ski Resort? Now You Can... For Just $900,000
03This is What Happened When Three Pros Tried To Go Mountain Biking on a Glacier
04Dirt Jumps, Zebras and A Motocross Legend: This Red Bull Feature is Essential Viewing For Any MX Fan
05Introducing The Greatest Skateboarder You've Never Heard Of… And He's Only 11 Years Old
06This is What It Looks Like To Break The World Record For The Fastest Time on a Bike
07This All-Action Edit Encapsulates Every Single Reason We Should All Love Motocross
08A Glacier The Size Of Manhattan Has Disappeared, And These Guys Got It On Film
09Cork 720s and Flipping Madness: The World's Best Slopestyle Stars Just Opened the MTB Season in Style
10Win a Holiday for 2 in Chamonix with Three #holidayspam
Brett Rheeder goes big on his new Trek Session 9.9
A Mountain Biking video by trek - 3,149 views
The week before the 2012 Red Bull Rampage, Brett Rheeder took a trip to Kelowna, BC to get his new Session 9.9 dialed in. We'd say it was a successful trip. Check out the OCLV Mountain carbon Trek Session 9.9 at http://www.trekbikes.com/session.
What Do You Think?
Get the best in action sports straight to your inbox


text:
Recap: 'Big Brother' Wednesday - Another PoV Shakeup
I'm not much for prognostication, as a general rule. But even if I were a long-term "Big Brother" viewer, I would have ceased long ago trying to figure out who is the favorite to win this season. Trying to apply things like "logical reasoning" to what's gone down this year is a sure fire way to drive oneself crazy. The best way to think about anything that happens is to assume that the person making the latest bizarre decision just got hit in the head with a shovel by Julie Chen. If you go off of that premise, then everything else falls into place.
When last I dropped in on the show here at Monkeys as Critics, Kalia was HoH, Brendon was out of the house, and Lawon had only just come up with what certainly has to be considered one of the worst strategic moves in reality television history. Daniele managed to win HoH at a critical time in the game…only to put up two relative floaters instead of purging the field of fellow veteran competitors. My best guess at to why she did it?? Brendon is in fact a Dementor. It makes sense, in that every time I look at him I worry that I will never, ever feel happiness again.
Guess that means the next hour will be sour, if you'll indulge a brief moment of recap poetry. Only one way to find out…


text:
Cotton Rope 2 Person Hammock with Pad and Pillow 1 1
Great Product I did not expect this item to be of such quality. It is well designed, well made and very comfortable. June 13, 2013
1-1 of 1
Related Products
With this fantastic Festive Stripe 2 Person 13' ...
Made for one, this 11' Single Hammock is ...
You and a friend will enjoy endless hours ...
Recently Viewed Items


text:
I have cwmr 22.214.171.124 and i need to change to cwm philz to flash ROMs (due to infinite bootloop) I have made a backup and I was just wondering will these backups work on philz recovery?
They should work, but even if they don't, you can always switch recoveries anytime, regardless of what ROM you're on.
XDA Developers was founded by developers, for developers. It is now a valuable resource for people who want to make the most of their mobile devices, from customizing the look and feel to adding new functionality.
Are you a developer?
Copyright © xda-developers. Hosted by Leaseweb