text:
A scheduler for allocating a computer system resource, such as processor time, among processes (e.g., database processes) according to a plan. A scheduling plan may include multiple sub-plans, and each plan and sub-plan may include multiple classes of processes with associated weights or values. Within a plan, the resource is first allocated to the classes and/or sub-plans included in a first level of the plan according to their associated weights. Any unallocated portion of the resource is then allocated to classes/sub-plans in subsequent levels, in turn, according to their assigned weights. If a given class of processes is empty when the resource is allocated in a level including the class, the allocation that would have been allotted to the class may be carried over into the next level. An active scheduling plan may be dynamically replaced during system operations.
1. A method of allocating a resource in a computer system, comprising:
identifying a plurality of requester classes among which the resource is to be allocated, each requester class including one or more requesters of the resource;
constructing a plan specifying an allocation of the resource among the plurality of requester classes, the plan including multiple levels;
for each level in the plan, associating a weight for allocating the resource with each of the plurality of requester classes; and
allocating the resource among the plurality of requester classes according to the plan by starting a first level of the plan and allocating the resource to requester classes according to the weights at the first level, and if any of the resource remaining after the first level, continuing on to successive levels of the plan, and allocating the resource according to the weights at each successive level until either the resource is fully allocated or allocation has taken place for each level.
2. The method of
associating an intra-class policy with each of the plurality of requester classes, the intra-class policy specifying a method of allocating the resource among the requesters in the requester class; and
allocating the resource among the requesters included in one of the plurality of requester classes according to the associated intra-class policy.
3. The method of
4. The method of
5. The method of
6. A method of allocating a resource in a computer system, comprising:
identifying a plurality of requester classes, each requester class including one or more requesters for the resource;
activating a first preconfigured plan for allocating the resource among the plurality of requester classes;
associating a weight with each of the plurality of requester classes in the first preconfigured plan, the weight specifying a portion of the resource to be allocated to the requester class; and
allocating the resource among the plurality of requester classes based on the weights in accordance with a first scheduling policy.
7. The method of
8. The method of
9. The method of
for each of the N levels, associating a percentage with each of the plurality of requester classes.
10. The method of
11. The method of
partitioning a remainder portion of the resource among the plurality of requester classes in a subsequent level;
wherein the remainder portion comprises a portion of the resource remaining unallocated after the resource was allocated in a previous level.
12. The method of
13. The method of
14. The method of
15. The method of
16. The method of
deactivating the first plan for allocating the resource; and
activating a second preconfigured plan for allocating the resource.
17. A computer system comprising:
a first memory for storing a plurality of process classes, each of the plurality of process classes being associated with N numerical values, where N>1;
a processor having execution time available for allocation among the plurality of process classes;
a scheduler memory for storing a preconfigured plan having N levels for allocating the execution time among the plurality of process classes in each of the N levels, the N levels of the plan corresponding to the N numerical values;
wherein the execution time is allocated among the plurality of process classes according to one or more of the numerical values.
18. The computer system of
19. A database system, comprising:
a process memory for storing one or more database processes;
a processor having execution time allocable among the database processes;
a plan module comprising:
a first set of predetermined values associated with the database processes, wherein each of the values represents a share of the execution time that may be allocated to the associated process in a first level of allocation; and
a series of instructions for allocating the execution time among the database processes; and
a scheduler engine coupled to the plan module for allocating, in one or more levels, the execution time among the database processes in accordance with the series of instructions;
wherein, in response to a query from a first of the database processes being executed by the processor, the scheduler engine identifies a second of the database processes for execution by the processor.
20. An operating system for scheduling execution of processes on a computer system, comprising:
a processor having processor time for allocation to processes;
a first set of processes;
a second set of processes;
a third set of processes;
a first set of percentages for allocating processor time between the first set of processes and the second set of processes, wherein each percentage in the first set of percentages comprises a percentage of processor time; and
a second set of percentages for allocating processor time between the first set of processes and the third set of processes;
wherein a first portion of the processor time is allocated according to the first set of percentages and, if a portion of the processor time remains unallocated after allocation according to the first set of percentages, the portion of unallocated time is allocated according to the second set of percentages.
21. A computer-readable medium storing instructions that, when executed by a computer, perform a method for allocating a computer resource among resource requester classes, the method comprising:
maintaining a plurality of resource requester classes, each resource requester class comprising one or more resource requesters;
activating a plan having N>1 levels for allocating the resource among the plurality of resource requester classes in accordance with an associated policy, wherein the policy specifies a method of dividing the computer resource among the plurality of resource requester classes in each level of the plan;
associating an emphasis factor with each of the plurality of resource requester classes in each of the N levels;
allocating the resource among the plurality of resource requester classes in a first level of the plan according to the associated emphasis factors; and
unless and until the resource is completely allocated, allocating the resource among the plurality of resource requester classes in a subsequent level of the plan according to the associated emphasis factors.
22. The computer-readable medium of
23. The method of
allowing a first requester to use the resource;
preempting the first requester's use of the resource; and
allowing a second requester to use the resource.
24. The method of
allowing a first requester to use the resource;
preempting the first requester's use of the resource; and
allowing a second requester to use the resource.
25. The database system of
26. A computer readable storage medium storing instructions that, when executed by a computer, cause the computer to perform a method of allocating a resource in a computer system, the method comprising:
identifying a plurality of requester classes among which the resource is to be allocated, each requester class including one or more requesters of the resource;
constructing a plan specifying an allocation of the resource among the plurality of requester classes, the plan including multiple levels;
for each level in the plan, associating a weight for allocating the resource with each of the plurality of requester classes; and
allocating the resource among the plurality of requester classes according to the plan by starting a first level of the plan and allocating the resource to requester classes according to the weights at the first level, and if any of the resource remaining after the first level, continuing on to successive levels of the plan, and allocating the resource according to the weights at each successive level until either the resource is fully allocated or allocation has taken place for each level.
27. A computer readable storage medium storing instructions that, when executed by a computer, cause the computer to perform a method of scheduling a resource in a computer system, the method comprising:
identifying a plurality of requester classes, each requester class including one or more requesters for the resource;
activating a first preconfigured plan for allocating the resource among the plurality of requester classes;
associating a weight with each of the plurality of requester classes in the first preconfigured plan, the weight specifying a portion of the resource to be allocated to the requester class; and
scheduling the resource among the plurality of requester classes based on the weights in accordance with a first scheduling policy.
1. Field of the Invention
The present invention relates to computer operating systems. More specifically, the invention relates to a method of scheduling the use of a computer system resource according to a non-preemptive and dynamically selectable allocation scheme.
2. Related Art
Today's computer systems are relied upon to perform a variety of operations. Performance of the requested operations requires the use of various system resources (e.g., processor, memory, mass storage, network access). The busier the system (i.e., the more users connected to the system and the more processes or jobs running on the system), the greater the demand upon each such resource. Whenever more than one process or user at a time requires one of the computer's resources, the resource must be shared between the requesting entities. Thus, some form of resource allocation and scheduling is needed.
Operating systems, which manage the allocation of a computer's resources, share the usage of each resource among requesting entities in accordance with some pre-set scheme. For example, in a "round-robin" scheme the operating system divides usage of a resource by granting each requesting process full use of the resource for a relatively short period of time, and by rapidly switching use of the resource among all requesters. In an alternative scheme, requesting entities are grouped according to their associated priority. Those processes given relatively high priorities receive larger portions or more frequent use of the shared resource than processes assigned lower priorities.
Each of these schemes has disadvantages. For example, transferring use of a resource among numerous requesters in a round-robin scheme can be inefficient because during the time it takes to effect the transfer (commonly termed a "context switch") the resource is not being productively used. The more frequently the resource is transferred, the less time it is actually in use and the lower its overall efficiency. A priority scheme may somewhat alleviate the waste of resource time inherent in context switches by providing for longer use of the resource in between transfers, but will be unfair to those requesters that must wait longer periods of time to use the resource.
The chosen method of sharing a resource among multiple requesters typically affects all system users, whether they interface directly with the operating system or operate within an application environment (e.g., a database management system (DBMS), a word processor, a modeling system). For example, instead of directly accessing the necessary computer resources to manage access to database tables on behalf of numerous users, a database management system typically calls upon the operating system to handle such access. Users within application environments are thus dependent upon the scheduling scheme implemented by the operating system, which may not provide the most efficient access to resources needed by those users. Because the operating system schedules use of all resources among all requesters according to a set scheme, an environment or process that would benefit from a different scheduling scheme suffers. The operating system's method of allocating resources is not flexible enough, and usually cannot be customized, to provide for the optimal sharing of resources among all requesters.
In a large database management system, for example, which may have thousands of processes and jobs running to accomplish various tasks (e.g., retrieving data, storing data, generating a report), a scheduling scheme that attempts to give each job or process equal execution time by a processor can be particularly inefficient. With so many processes waiting to execute, the processor time wasted due to context switches becomes excessive. Similarly, attempting to control allocation of a processor's execution time among DBMS users and processes according to a priority scheme does not provide very effective control of the processor's time. The priority scheme merely allows one class of users or processes to be assigned a higher priority than another and thus receive faster or longer use of a resource. This scheme does not provide the ability to assign a particular class a set portion of processor execution time, thus preventing a database administrator from enabling the most effective control of resource allocation within the DBMS.
Relying upon the operating system's method of resource allocation means that the allocation scheme for distributing resources within the computer system often cannot be dynamically altered according to the demands of system users and processes. In addition, the operating system is usually separate from application environments such as database management systems and therefore generally cannot know what, if any, inter-relationships exist between individual database users, processes and resources. Thus, the operating system may switch a first database process out of a processor while the process holds (i.e., has reserved or been assigned) a resource needed by a second database process. If the second process needs the resource in order to execute, then it is effectively blocked from executing until the first process relinquishes the resource, which may not occur until after the first process receives additional processor time. This situation is often termed "deadlock." In a priority-based allocation scheme where the first process mentioned above is at a lower priority than the second process, this may be termed "priority inversion."
As mentioned above, neither a priority-based scheduling scheme nor a round-robin scheme allows resources to be shared in a truly efficient manner. High priority processes are merely guaranteed to receive more of a resource than low priority processes. If processes or groups of processes could be accorded a particular percentage of a resource, system administrators would be able to allocate resources with much finer granularity. Further, the scheduling scheme implemented by an operating system is set at the time the operating system is loaded and begins executing. If a system manager or user wishes to implement a different scheduling scheme (whether for all or selected environments and processes), the operating system must be re-initialized or rebooted.
Thus, there is a need in the art for a method of allocating or scheduling resource usage that allows efficient resource sharing with minimal waste of the resource. Such a method will allow greater control over scheduling decisions by a system administrator. In particular, a need exists for a method of allocating resources according to ratios or percentages. A need also exists for a method of dynamically modifying a resource allocation plan without disrupting operation of a computer system or an application environment.
The present invention provides systems and methods for allocating a computer system resource among a plurality of resource requesters. In accordance with an embodiment of the invention, allocation of the resource is more finely controlled than has previously been possible. Resource requesters in the present embodiment include processes, jobs, and other entities operating within a computer system and requiring use of a system resource. Computer system resources that may be allocated or shared among resource requesters illustratively include a processor, memory, mass storage and communication bandwidth.
In one embodiment of the present invention, a database management system (DBMS) is provided. A resource scheduler within the DBMS allocates a processor's execution time (e.g., "quanta") among various requesting DBMS processes and jobs that require execution time in order to accomplish DBMS users' desired functions. The resource scheduler in this embodiment of the invention allocates processor time among classes of requesting processes and jobs according to dynamically selectable scheduling plans (e.g., during operation of the DBMS, the active scheduling plan can be changed). Scheduling plans in this embodiment comprise policies for allocating processor time between separate classes and/or among members of an individual class.
In one embodiment of the invention, resource requesters are grouped into classes based on their requirements for the resource, as specified by a database administrator (DBA). For example, in one illustrative plan classes are established for different processing functions (e.g., processing electronic mail or fixing programming errors). In another illustrative plan, resource requesters are classified according to their mode of execution (e.g., on-line, batch). After constructing requester classes, the DBA groups the classes in one or more scheduling plans. Only one plan at a time is active during operation of the DBMS, but each plan can include one or more sub-plans. Each sub-plan includes classes of requesters. During operation of the DBMS, a class can only be a member of one active plan or sub-plan and is thus allocated processor time only within that plan or sub-plan. Within each plan and sub-plan, processor time is assigned to the participating classes based on a policy.
In a present embodiment of the invention, an "emphasis" policy is provided in which processor time is allocated among a plan's classes and sub-plans by percentages. By adjusting the percentages, a DBA is able to increase or decrease the emphasis given to individual classes of resource requesters. In this embodiment, each plan and sub-plan implementing the emphasis policy is divided into multiple levels. Up to a maximum of 100% of the processor time available at a given level within a plan is distributed according to the percentages assigned to each class or sub-plan in the level. Thus, if 100% of processor time is allocated in the lowest, first level, classes in succeeding levels are shut out unless, as described below, a class is empty when its request for CPU time is granted.
One or more classes of resource requesters may participate in each level of a plan or sub-plan using the emphasis policy, and each class may participate in multiple levels of one plan or sub-plan. Processor time that is not allocated among the classes participating in the first level of a plan (or sub-plan) is available for allocation among the classes participating in subsequent levels. If processor time remains unallocated after being divided among the chosen number of levels, the remainder is recycled. In other words, after the total processor time is allocated among the classes participating in the first level of a plan, any processor time left over is allocated to the classes participating in the second level. Any processor time still remaining after allocation in the second level is carried over to the third level, and so on. Processor time left over after configuring the last level is distributed throughout the plan from the beginning.
During DBMS operation, when processor time is to be granted to a class of resource requesters within a particular level, if no requesters in the class are ready to execute, the processor time that the class would have received is carried over to the succeeding level.
Although only one scheduling plan is used at a time by the DBMS, multiple plans can be configured and stored, and the active plan can be changed at any time while the DBMS is running without restarting the operating system or DBMS. In a present embodiment, a plan may include one policy for allocating processor time between classes (e.g., the emphasis policy) and a separate policy for allocating processor time among the members of a single class (e.g., round-robin).
When operating conditions change (such as the composition of active DBMS users), a database administrator can activate one of the stored plans in place of the currently active plan. For example, the resource scheduler may first operate (e.g., during the business day) according to a plan that partitions processor time among classes of resource requesters according to the emphasis policy and a first set of percentages. Later, however (e.g., at night), a different plan may be implemented having the same classes but different percentages. Alternatively, the first scheduling plan may be changed to another plan in which processor time is allocated according to different classes or a different policy. In either event, the change in scheduling plan or policy can be made without restarting the DBMS.
FIG. 1 illustrates a database server on which one embodiment of the invention may be practiced.
FIG. 2 is a block diagram illustrating a resource scheduler according to one embodiment of the invention.
FIG. 3 depicts an emphasis plan for scheduling resources according to one embodiment of the invention.
FIG. 4 depicts one possible implementation of a priority resource allocation scheme, in accordance with an embodiment of the invention.
FIGS. 5A-5B depict an emphasis plan having a sub-plan in one embodiment of the invention.
FIG. 6 is a diagram demonstrating the partition of processor time according to the plans of FIGS. 3 and 5A-5B according to an embodiment of the invention.
FIG. 7 is a flow chart illustrating a procedure in which resource requesters requiring processor time interact with a resource scheduler to execute in one embodiment of the invention.
Class—a plurality of resource requesters. In one variation, a database administrator or system manager assigns a resource requester to a class.
Plan—a scheme for allocating a resource among a plurality of classes and/or sub-plans in accordance with a policy.
Policy—a strategy for allocating a resource.
Resource requester—an entity requesting use of, or access to, a system resource.
Sub-plan—a scheme for allocating a resource among a plurality of classes in accordance with a policy.
The following description is presented to enable any person skilled in the art to make and use the invention, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present invention. Thus, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein. For example, the present invention is described predominantly in terms of a database management system including a scheduler for scheduling or allocating a processor's execution time among a plurality of requesting entities. However, the concepts discussed herein are broad enough to provide for the allocation of any computer system resource among a plurality of entities needing the resource, within or without a particular application environment.
Throughout this detailed description, numerous specific details are set forth. To one skilled in the art, however, it will be understood that the present invention may be practiced without such specific details. In other instances, well-known control structures and system components have not been shown in detail in order not to obscure the present invention.
The present invention is not limited to any one particular implementation technique. Those of ordinary skill in the art will be able to implement the invention with various technologies without undue experimentation once the functionality to be carried out by such components is described. In some instances, components implemented by the present invention are described at an architectural, functional level. Many of the elements may be configured using well-known structures. Additionally, for logic to be included within the system of the present invention, functionality and flow diagrams are described in such a manner that those of ordinary skill in the art will be able to implement the particular methods without undue experimentation. It should also be understood that the techniques of the present invention can be implemented using a variety of technologies. For example, the resource scheduler described herein may be implemented in software running on a computer system, or implemented in hardware utilizing either a combination of microprocessors or other specially designed application specific integrated circuits, programmable logic devices, or various combinations thereof.
Sharing Resources in a Database Management System Environment
In one embodiment of the invention, a database management system (DBMS) is provided for operation on a database server. The DBMS includes a scheduler for allocating processor time among the various users, processes and jobs interacting with the DBMS environment. Illustratively, processor time is allocated in periods of time (e.g., "quanta") on the order of 20 milliseconds. The specific duration of allocable processor time may be determined by an operating system executing on the database server independently from the DBMS.
FIG. 1 depicts an illustrative database management system operating on database server 100. DBMS software 124 and operating system 122 are resident in shared memory 120, where they are executed by processor (or CPU) 130. DBMS software 124 includes scheduler 200. In an alternative embodiment, scheduler 200 is separate from DBMS software 124.
In the illustrated embodiment, the DBMS serves one or more clients. Illustratively, client 102 is a small computer system, such as a microcomputer, and client 104 is an application server offering the DBMS services of database server 100 to multiple end users. DBMS processes also reside in memory 120 and operate on behalf of end users, clients, a database administrator (DBA), or another process. Three database processes 112, 114 and 116 are illustrated in FIG. 1. One skilled in the art will recognize that server 100 can be configured to operate a wide range of processes numbering from a few into the thousands and that the scope of the invention is not limited by the number or type of processes executed on server 100.
Database processes executing on server 100 share memory 120, which is coupled to processor 130. In an alternative embodiment, server 100 employs multiple processors. In order to maximize the use of processor 130, one or more DBMS processes that are ready to execute (i.e. are "runnable") are illustratively placed in a run queue (not shown in FIG. 1) within memory 120. When an executing process completes execution or otherwise relinquishes control of the processor, a process within the run queue takes over.
In a present embodiment of the invention, DBMS software 124 is Oracle� RDBMS version 8.1 by the Oracle Corporation of Redwood Shores, Calif. and operating system 122 is Solaris, by Sun Microsystems, Inc. of Palo Alto, Calif. DBMS software 124 illustratively includes a portion of operating system-dependent code to interface between operating system 122 and DBMS software 124. In such an embodiment, the majority of the instructions included in DBMS software 124 are identical regardless of the brand or version of operating system 122. The operating system-dependent code, however, is tailored to the specific operating system (e.g., Solaris, Unix, Windows NT).
Operating system 122 manages the database server's resources (e.g., disk space, memory, network bandwidth, and processor 130) at a low level, sharing them among all requesting entities. However, a primary function of database server 100 in the present embodiment is to operate DBMS software 124 and serve the DBMS' clients and users. Therefore, the DBMS environment consumes the vast majority of the server's resources, including the execution time of processor 130. Thus, although the operating system manages processor time at a low level, most of the processor time is used within the DBMS where it is partitioned among classes of requesting entities by scheduler 200 as described below. Although in the present embodiment the scheduler simply allocates processor time among requesters (i.e., DBMS users, processes and jobs), in alternative embodiments the scheduler allocates other resources.
Scheduler 200 is highly flexible and employs an allocation, or scheduling, plan that is dynamically selectable. Multiple scheduling plans may be configured and stored on the server, although only one plan is active at a time. The active plan may be exchanged for another plan during the operation of the DBMS and server. A scheduling plan partitions processor time among classes of requesters assembled by a DBA or system manager. Classes and scheduling plans are further described below, following the description of an illustrative scheduler.
Description of a Database Scheduler
With reference now to FIG. 2, scheduler 200 is depicted according to one embodiment of the invention. In the illustrated embodiment, the scheduler comprises a portion of DBMS software 124 (from FIG. 1) other than operating system-dependent code. In this embodiment, multi-level scheduler 200 allocates processor time among various entities, herein termed "resource requesters." Resource requesters illustratively include processes and jobs (such as processes 112, 114 and 116 from FIG. 1) needing processor time to execute on behalf of DBMS clients and users.
Scheduler 200 includes engine 202, administrative interface 204, and one or more scheduling plans. Two scheduling plans 300, 510 are depicted in FIG. 2, although one skilled in the art will recognize that the number of plans configured and stored within scheduler 200 does not limit the scope of the present invention. Only one of plans 300, 510 at a time is implemented (i.e., "active") by scheduler 200 during the operation of the DBMS. A DBA may, however, exchange the active plan for a different one even during operation of the DBMS.
Administrative interface 204 is coupled to user interface 220, which is external to scheduler 200. User interface 220 and administrative interface 204 are employed by a DBA to configure scheduler 200. Through these interfaces, the DBA can configure (e.g., create, modify and delete) a class of resource requesters or select a scheduling plan for implementation by scheduler 200. The DBA can also modify scheduling plans, such as to change the classes within a plan or alter a plan's "policy" (described below) for allocating processor time.
In a present embodiment, the DBA also employs user interface 220 and administrative interface 204 to observe the performance of scheduler 200. Illustratively, parameters are stored by scheduler 200 concerning its operation, such as statistics reflecting the actual allocation of processor time, the number of entities requesting processor time, the amount of time that requesters or requester classes must wait to receive processor time, etc.
Resource requesters communicate with scheduler 200 in order to request and receive processor execution time. Two resource requesters 210, 212 are illustrated in FIG. 2. Illustratively, scheduler 200 keeps a count of the number of requesters that are "runnable," or ready to execute. In accordance with the active scheduling plan, engine 202 determines which requester class and/or individual requester is to receive processor time as it becomes available.
Only one of scheduling plans 300, 510 is active (i.e., is implemented by scheduler 200) at a time, but the active plan can be changed during the operation of the DBMS. In other words, engine 202 can quickly switch from implementing plan 300 to implementing plan 510 without interrupting the operation of the DBMS or server 100. Plans are installed at the time the DBMS is initialized and can be removed, modified and added as necessary. As described below, a plan allocates processor time among classes of resource requesters according to an associated policy and numerical values associated with each class. One plan may be well suited to efficiently meet the needs of certain types of requesters at certain times (e.g., during the business day when most of the requesters comprise processes representing on-line, interactive, users). A different plan, possibly comprising the same classes but having a different policy or different numerical values attached to the classes, may be more effective than the first at a different time (e.g., at nighttime, when most of the requesters are batch processes).
Scheduling Plans
The following is a description of an illustrative scheduling plan depicted in FIG. 3. It will be understood that a wide variety of scheduling plans may be configured in accordance with the present invention. In general, however, a DBA first assembles resource requesters into classes. Illustratively, class assignments are made based upon the requesters' requirements for processor time (e.g., batch vs. on-line users, administrative and maintenance functions vs. data processing). The DBA then assembles one or more classes into a plan. Within a plan, processor time is allocated to classes of requesters according to numerical values associated with each class in the plan. Multiple plans can include the same classes with different numerical values. In addition, a plan may be included in another plan as a sub-plan.
Within each plan, the DBA specifies an inter-class policy for partitioning processor time between the classes included in the plan. When a plan is to be implemented by scheduler 200, each class receives processor time according to its associated numerical value and the specified scheduling policy. An intra-class policy may also be specified for allocating processor time within a class. As mentioned above, only one plan is active at a time (which plan can include sub-plans), and each class can only be referred to in a single active plan (or sub-plan). One advantageous policy, termed an "emphasis" policy, is described immediately below. Other policies are possible, such as round-robin, strict preemption, priority, etc.
In a present embodiment of the invention plan 300 is an "emphasis" plan. In other words, plan 300 allocates processor time between classes of resource requesters according to an "emphasis" policy. Specifically, an emphasis plan or policy requires the division of processor time according to percentages of available processor time. When the emphasis policy is used for inter-class allocation, different classes of resource requesters are given different (or possibly equal) levels of emphasis relative to each other. Intra-class allocation may also use the emphasis policy. Thus, in an emphasis plan, individual resource requesters and/or classes of resource requesters are assigned specific percentages of available processor time. In a present embodiment of the invention, processor time is further partitioned in emphasis plans in multiple levels.
With reference now to FIG. 3, DATABASE plan 300 is depicted. DATABASE plan 300, which is an emphasis plan, consists of three levels (Level 1, Level 2 and Level 3), represented by the numerals 302, 304 and 306. On-line (or interactive), batch and DBMS maintenance classes are represented by the numerals 310, 312 and 314.
Within DATABASE plan 300, all processor time available to the DBMS is first allocated in Level 1 according to the percentages associated with each class included in the level. Thus, online and batch requesters receive 60% and 20%, respectively, of the available processor time. The processor time not allocated in Level 1 (i.e., 20% of all available processor time) is allocated among the classes participating in Level 2 according to their assigned percentages. Thus, online requesters and DBMS maintenance tasks each get 50% of the remaining 20% of processor time (i.e., each gets 10% of the total processor time). Finally, if processor time is somehow unallocated after Level 2, it is all allocated to the batch class in Level 3. For example, if a class participating in Level 1 or Level 2 is empty at the time scheduler 200 would have allocated processor time to the empty class, the processor time that would have been allocated to the empty class is given to the batch class in Level 3.
As plan 300 demonstrates, several levels may be configured in a plan. In a present embodiment of the invention, however, a maximum of eight levels may be configured. If, after the last level, processor time remains unallocated, it is recursively allocated according to the active plan.
The use of percentages in emphasis plans allows the allocation of processor time to be more finely-tuned than in a DBMS in which resources are allocated according to a round-robin or priority scheme. For example, a priority scheme may allow a DBA to specify that a first set or class of requesters is to receive faster, longer or preemptive access to processor 130 than a second set or class. An emphasis policy, however, allows the DBA to specify particular percentages of processor time for each set or class. Illustratively, a first class of requesters can be granted a high percentage of the processor's time but a second class can still be assured a certain, lower, percentage of time. Even if a particular class of requesters becomes heavily populated, other classes (and resource requesters in those classes) participating in the plan will not lose processor time as a result. Individual requesters within the over-populated class may, of course, receive less execution time as a result (depending on the intra-class scheduling policy). The DBA can address class over-crowding in several ways under the present invention. The DBA can, for example, change to a different plan that gives additional emphasis to the over-crowded class or that allocates processor time according to a different policy (e.g., round-robin, strict preemption). Alternatively, the DBA can re-configure the class to reduce its population or alter the percentages within the active plan.
When scheduler 200 implements DATABASE plan 300, the actual amount of processor time granted to the various classes is as follows, assuming that each class is adequately populated. On-line users receive 70% of all processor time (60% in Level 1 and 10% in Level 2), batch users receive 20% (Level 1), and DBMS maintenance tasks receive 10% (Level 2). However, if there was no maintenance being performed, on-line users would still receive 70% of the total processing time (from Levels 1 and 2), but batch requesters would then receive the remaining 30% (picking up the additional 10% in Level 3).
One skilled in the art of computer systems will recognize that multi-level plans can be constructed to emulate the priority allocation scheme often used by operating systems. FIG. 4 demonstrates an illustrative priority plan 400. Class 1, Class 2, and Class 3 represent three classes of resource requesters. In each of three levels, one class receives all available processor time. When priority plan 400 is implemented, Class 1 receives all processor time as long as it has at least one member. Only when Class 1 is empty does Class 2 receive processor time. Class 3 receives processor time only when both Classes 1 and 2 are empty.
FIGS. 5A and 5B depict a plan having two sub-plans, each of which are emphasis plans. In FIG. 5A, MASTER plan 500 consists of only one level, in which all processor time is divided among the two sub-plans: MAIL plan 510 and DATABASE plan 300.
MAIL plan 510, depicted in FIG. 5B, consists of 2 levels. In Level 1, the Postman class of resource requesters (represented by the numeral 512) will execute 40% of the time while the mail users and mail maintenance classes (represented by the numerals 514 and 516) share the remaining 60% by a ratio of 80 to 20 in Level 2. DATABASE plan 300 is depicted in FIG. 3.
FIG. 6 is a tree-structured diagram demonstrating the division of processor time according to MASTER plan 500. During the operation of the DBMS, scheduler 200 allocates processor time to the various classes 310, 312, 314, 512, 514, 516 according to their corresponding percentages.
In a present embodiment of the invention, scheduler 200 employs a probabilistic method to choose a requester to be granted processor time. Illustratively, when multiple resource requesters await use of processor 130, engine 202 (from FIG. 2) calls the active plan (e.g., MASTER plan 500 from FIG. 5A). Relying on probabilistic determination to ensure distribution of processor time according to the specified percentages, MASTER plan 500 selects either MAIL sub-plan 510 or DATABASE sub-plan 300. If, for example, MASTER plan 500 selects the MAIL sub-plan, engine 202 then calls MAIL sub-plan 510. MAIL plan 510 then determines (again, in probabilistic fashion) whether to allocate processor time to the Postman class, which is to receive 40% of all processor time distributed in the MAIL plan. If the Postman class is not selected, then there is an 80% chance that the Mail Users class will receive the processor time instead of the Mail Maintenance class.
In an alternative embodiment, instead of requiring the engine to query a plan each time an allocation decision must be made, the active plan may be collapsed so that only one choice must be made. For example, if the Postman class is empty, MASTER plan 500 can select either the Mail Users or Mail Maintenance class immediately upon choosing the MAIL sub-plan. For purposes of this embodiment, a bitmap is maintained to represent which of the established requester classes are populated and which are empty. As one skilled in the art will recognize, the fewer requester classes that are populated, the faster a decision can be made as to which requester class is to be allocated processor time.
In another alternative embodiment, a historical log is kept of the allocation choices made by the active plan (and sub-plans). In this alternative embodiment, scheduler 200 can ensure, over time, allocation of processor time according to the planned percentages. Illustratively, each time a choice is made between sub-plans (e.g., in MASTER plan 500), between levels of a plan, or between classes in a level, the choice is made in an attempt to track the planned percentages. In yet another alternative embodiment, a combination of probability and history is used to make allocation decisions.
Operation of a Multi-Level Scheduler
As stated above, scheduler 200 monitors the need for processor time by resource requesters. To ensure correct allocation of processor 130 among the requesters according to the chosen scheduling policy, scheduler 200 communicates with the requesters, tracks their status, and allocates processor time according to specified inter-class and intra-class scheduling policies.
When a new requester first requests processor time from scheduler 200, thus indicating it is ready to execute, a "virtual thread" is created and associated with the new requester's class. Virtual threads thus indicate those requesters that are runnable, or waiting to execute.
In a present embodiment, resource requesters that are ready to execute are either executing or waiting to execute. Only one requester at a time is executed by each processor in server 100. If waiting to execute (i.e., runnable), a requester is either awake or asleep. A limited number of runnable requesters are kept awake, the rest are put to sleep.
When one requester finishes executing, whether because it has completed its task or because it has used its allotted amount of processor time, the next requester to be executed is taken from the set of awake and runnable requesters. Sleeping requesters cannot be executed until after they are awakened. In one embodiment of the invention, besides any requesters that are executing, only one runnable requester at a time is kept awake. All others are put to sleep. Thus, in this embodiment, once the executing requester relinquishes control of the processor, only one requester is in line to execute and scheduler 200 is thus able to closely control the allocation of processor time among requester classes and individual requesters.
In an alternative embodiment, a range of requesters is kept awake and runnable. Thus, less processor time is wasted in waking and putting requesters to sleep. Requesters are only put to sleep if the number of runnable requesters that are awake is at or above a high threshold value (e.g., three times the number of processors in server 100). Sleeping requesters are only awakened when the number of awake and runnable requesters drops below a low threshold (e.g., the number of processors in server 100).
When an executing requester relinquishes control of processor 130, the operating system gives control of the processor, in accordance with its own allocation method, to a process that is awake and runnable. If there is only one requester in such condition, then regardless of which allocation scheme the operating system uses (e.g., round-robin or priority), that requester will be selected. With multiple processors, scheduler 200 illustratively maintains a separate list of runnable requesters for each processor, although use of a combined list is also within the scope of the invention.
During its execution by processor 130, each requester periodically communicates with engine 202 to inquire whether it may retain control of the processor. In response, engine 202 either tells it to continue executing or commands the requester to relinquish control of the processor and sleep. As long as the requester is allowed to continue execute, it will retain control of the processor and periodically query engine 202.
When the requester stops executing, operating system 122 gives control to a requester that is awake and runnable. Thus, in order to maximize the use of each processor, it is preferable to keep at least one requester awake and runnable for each processor. Therefore, in a present embodiment of the invention in which only one requester is awake and runnable (but not executing) for each processor, when engine 202 commands the executing requester to relinquish control of the processor, the engine passes the requester the identity of a runnable, sleeping, requester that is to be awakened. In other words, instead of the scheduler taking control of the processor just to awaken a sleeping requester, the requester that is giving up control of the processor awakens the new requester before putting itself to sleep. One skilled in the art will recognize that this method of transfer minimizes the loss of usable processor time due to context switching.
FIG. 7 is a flow chart depicting an illustrative method of operating resource scheduler 200 in accordance with an embodiment of the invention. State 700 is a start state. In state 702, scheduler 200 receives a query from resource requester 210, which is being executed by processor 130, wherein requester 210 asks whether it should continue executing.
In state 704 the scheduler determines whether requester 210 has utilized its allocated execution time (e.g., its assigned quanta). If not, requester 210 continues executing and the illustrated method finishes with end state 722. If, however, requester 210 has exhausted its allocated execution time, in state 706 the scheduler engine invokes the active plan (e.g., DATABASE plan 300 from FIG. 3) in order to determine which class of resource requesters should receive processor time.
In state 708 the scheduler determines whether there are any requesters ready or waiting to execute other than requester 210. In order to make this determination, scheduler 200 maintains a list of virtual threads representing runnable requesters, as described above.
If there are fewer runnable requesters, including requester 210, than there are processors, then no requesters are waiting for processor time and there is no need to stop executing requester 210. In such a case, requester 210 continues to execute and the system proceeds to state 722, an end state. The system also proceeds to state 722 from state 708 if there are no sleeping runnable requesters. This situation arises when there are relatively few requesters awaiting processor time (e.g., the number of awake and runnable requesters is within the allowable range described above).
If, however, a sleeping requester must be awakened (e.g., the number of awake and runnable requesters has fallen below the low threshold described above), then scheduler 200 must allocate processor time among the classes of requesters that are waiting for processor time. The system thus proceeds to state 710.
In state 710, a class is chosen in accordance with the inter-class policy in effect for DATABASE plan 300 (i.e., the emphasis policy described above). In addition, a specific requester (e.g., requester 212) is chosen according to the intra-class scheduling policy (e.g., round-robin) associated with the chosen class. In the presently described embodiment of the invention, a probabilistic function is applied to determine which class should receive processor time. In an alternative embodiment, a history is kept to track each requester (and its class) that is executed in order to verify application of the active plan's specified percentages. For purposes of the illustrated embodiment, the chosen class (i.e., the class that includes requester 212) is a different class from that which includes requester 210 (the executing requester). If the class including requester 210 is chosen, scheduler 200 illustratively incorporates a bias toward minimizing context switches and thus tends to allow requester 210 to continue executing and avoid the overhead involved in waking another requester (unless such bias becomes too unfair to other requesters within the class).
In state 712, an individual requester (e.g., requester 212) is selected from within the chosen class and is identified to requester 210 (the requester that is to relinquish control of a processor).
In state 714 it is determined whether the selected requester is the same requester as that which is finishing execution (i.e., requester 210). If so, requester 210 receives an additional quantum and continues executing and the method ends with end state 722. As long as the selected requester (e.g., requester 212) is not the same as the one that finished its quanta, the method continues with state 716.
In state 716, requester 210 awakens requester 212. Requester 210 then puts itself to sleep in state 718 to await its next opportunity to execute. In state 720 the operating system recognizes that processor 130 is idle and selects an executable process from those that are runnable. The system then proceeds to state 722, an end state.
The foregoing descriptions of embodiments of the invention have been presented for purposes of illustration and description only. They are not intended to be exhaustive or to limit the invention to the forms disclosed. Accordingly, many modifications and variations will be apparent to practitioners skilled in the art.
Patent Citations
Referenced by
Legal Events
Original Image


text:
Enter your Email Address here to receive a link to change password.
1059 Products
Sort By
Price - High to Low
Price - Low to High
Newest First
Jaanvi Fashion
Floral multy
Priyanka chopra
Sareez House
Madhuri dixit
Pink black
Rashmi desai
New bollywood
Bollywood kajol
Sonakshi sinha
Try n Get
Indian replica
Black worked
Manjula Feb
Shophie in
Apsara in black
Kareena in red
Pink with
Red net and
Malaika pine
Parizaad gold
Neetu chandra
Deepika padukon
Designer royal
Golden crap
Jacqueline pink
Beautiful kajol
Black n white
Pc indian
Rani mukherjee
Kareena in off
Preety zinta
Deepika white
Karishma royal
Scroll to top
The traditional attire of Indian women, "Saree" has been worn by celebrities all over the world but it has been associated with Bollywood or the Indian Film Industry for a long time. The Indian actresses started wearing sarees since the times of "Pyaasa" and "Kaagaz Ke Phool" or the birth of the industry itself and the modern actresses too frequently wear them in movies. Be it under a waterfall or on a snow clad mountain, the actress wearing the saree adorns the moment and the song.
The Indian fashion designers release their newest of the new collection with the actresses either wearing it in a movie or during the Indian Fashion Week due to which the Bollywood sarees have always been a trendsetter for Hindi movie lovers. So now you can buy online bollywood sarees here at Mirraw and feel like you're on the red carpet , pamper yourself and spread your aura like any other actress at the best prices without spending a fortune. Bollywood sarees online shopping has a new dimension now as we present to you the latest designs with a plethora of fabrics like chiffon, georgette, jacquard and sequins.
"Mirraw was superfast. I ordered on 26th Dec and today (28th Dec) I got the product. I also got a call yesterday by the Gharpay executive before coming for the pick up, as committed by Team Mirraw. I Ordered Victorian Double Tokri Kashmiri Earring. The design and specially the color of the stones which I was specific to be the same as mentioned in the website was perfectly the same. Moreover, It looks amazingly beautiful with my Royal Blue and Pink Benarasi Saree. Very happy with the service. Keep it up Mirraw ! All the Best ! " -- Suranjeeta Das, New Delhi
"I'd like to take this opportunity to let you know that I am very happy with your customer service. I had an issue with a damaged piece and it was dealt with efficiently. I received the temple set and others in my order and I am extremely happy with your professionalism. All items were very well made and worth the money. Keep up the good work." -- Anjana Das, Tennessee, United States
Copyright © 2015, Mirraw Online Services Pvt. Ltd. All Rights Reserved.
Copyright © 2014, Mirraw Online Services Pvt. Ltd. All Rights Reserved.

subset: commoncrawl


text:
'Game of Thrones' Star Maisie Williams Spots Look-alike on Twitter
You really never know who is going to pop up on Twitter. You may tweet one of your favorite actors …Read Now
You really never know who is going to pop up on Twitter. You may tweet one of your favorite actors …Read Now
Graham Norton is back this Saturday, June 4 at 10/9c, with an American/British lineup on his chat show The Graham Norton …Read Now
When it comes to showing your passion for Doctor Who, cosplay is all very well, but it's not always practical. Knitting a Dalek, however, is the kind of thing you can do to relax without having to get all "hey! How's my Dalek look?" about it.
So, in tribute to the wooly Whovians with nimble-fingers, here's a little gallery of some of the designs on the extraordinary knitting site Ravelry. We've put links to the designs and designers in with the pictures, partly to give credit where it is due, but mostly to encourage you to have a go yourselves.
Needles at the ready? Let's start with something fairly simple, and yet practical:
Mind you, are you really going to want to scrub dishes with this once you've finished? I suppose you can always claim to be deleting the dirt…
Let's face it, it would not be a proper Whovian knitfest without this.
A fiddlier knit, all told, but worth it.
Yep, that's the living gargoyle from the Third Doctor adventure The Daemons, made into a nice warming ski-mask. And he's not the only one (see below).
Astonishing. Even with Indiana Jones's hat, shades and a sock hand.
Two different Dalek designs in one. Amazing.
Another relatively simple one (compared to the Ood at any rate) and rather swanky to boot.
Imagine getting out of the shower and wiping your feet on that face. What? You already have?
And while we're on the topic of feet. This is the kind of cosplay you can do every day.
Now, go and get knitting!


text:
2004 BEST Sushi
Ginza Restaurant
Raise your hand if you're tired of the same standard sushi, meal in and meal out: tuna maki, salmon sushi, tuna sushi, salmon maki. We're tired of it, too, which is why we thank our lucky stars for the Chinatown flagship branch of Ginza. This restaurant proves there's life beyond the basics with artful orchestrations such as Boston maki—lobster, salmon, rice, lettuce, and a smattering of salty roe. Lest you assume that creativity eclipses flavor here, it doesn't. Everything from the cooked octopus to the seasonal raw seatrout is sweetly fresh, cut to order, and best washed down with any of the 12 varieties of sake.
Be respectful of our online community and contribute to an engaging conversation. We reserve the right to remove impersonators or personal attacks, threats, profanity, or flat-out offensive comments. By posting here, you are permitting Boston magazine and Metro Corp. to edit and republish your comment in all media.


text:
10 Tips for Donating to Charity
If You Have Extra Time…
Call the organization and ask about volunteering opportunities. Certain charities need more volunteers than normal during the holidays—for instance, to help cook and serve the holiday meal, or to gather goods collected from holiday food drives.
Try out a mini-volunteering opportunity like Sparked.com, a microvolunteering site that allows you to give your time online. On Sparked, non-profits post jobs that they need done on a computer, and if you have ten minutes or a full hour, you can log in and help them with their work. It helps non-profit organizations save the money they would spend on hiring someone to do the job, and helps you give even if you don't have cash to spare right now.


text:
All quotes tagged Designate
(2198 quotes found)
"Happiness is not something you postpone for the future; it is something you design for the present."
"If you don't design your own life plan, chances are you'll fall into someone else's plan. And guess what they have planned for you? Not much."
"Design is the method of putting form and content together. Design, just as art, has multiple definitions; there is no single definition. Design can be art. Design can be aesthetics. Design is so simple, that's why it is so complicated."
"You can design and create, and build the most wonderful place in the world. But it takes people to make the dream a reality."
"A common mistake that people make when trying to design something completely foolproof is to underestimate the ingenuity of complete fools."
"Design in art, is a recognition of the relation between various things, various elements in the creative flux. You can't invent a design. You recognize it, in the fourth dimension. That is, with your blood and your bones, as well as with your eyes."
"God is the name by which I designate all things which cross my path violently and recklessly, all things which alter my plans and intentions, and change the course of my life, for better or for worse."
"When you travel, remember that a foreign country is not designed to make you comfortable. It is designed to make its own people comfortable."


text:
- Home
- News
- Sports
- Classifieds
- Obituaries
- Special Sections
- Local Guide
- Games
Charles Levelle Quinn
Charles Levelle Quinn, age 49, passed away Saturday, March 5, 2011, at North Mississippi Medical Center of West Point.
Funeral services are Saturday, March 12, 2011, at 11 a.m. from Pilgrim Grove M.B. Church with the Rev. Robert Shamblin-Traylor officiating. Burial will follow in Greenwood Cemetery.
Visitation is today, from 3 – 6 p.m. at Carter's Mortuary Services Chapel.
Carter's Mortuary Services is in charge of arrangements.


text:
ORLANDO, Fla., Feb. 18, 2013 /PRNewswire/ -- Darden Restaurants, Inc. (NYSE: DRI) will be webcasting their Darden 2013 Analyst & Investor Day being held in Orlando, FL on Monday, February 25 th and Tuesday, February 26, 2013.
(Logo: http://photos.prnewswire.com/prnh/20050203/FLTH026LOGO )
On Monday, February 25 th, the webcast will begin at 2:00 p.m. ET and end at 6:00 p.m. ET. Please go to http://www.videonewswire.com/event.asp?id=91940 to access Monday's webcast.
On Tuesday, February 26 th, the webcast will begin at 8:00 a.m. ET and end at 12:00 p.m. ET. Please go to http://www.videonewswire.com/event.asp?id=91941 to access Tuesday's webcast.Live Webcast Agenda Monday, February 25, 2013 2:00 p.m. – 6:00 p.m. ET 2:00 p.m. Presentations:
- Drew Madsen, President & Chief Operating Officer
- Chris Chang, SVP, Technology Strategy
- Brad Richmond, SVP & Chief Financial Officer
- Clarence Otis, Chairman & Chief Executive Officer
- Drew Madsen, President & Chief Operating Officer
- Dave George, President, Olive Garden
- Val Insignares, President, LongHorn
- Dave Pickens, President, Red Lobster
- Gene Lee, President, Specialty Restaurants Group
- Harald Herrmann, President, Yard House
- Jim Lawrence, Chief Supply Chain Officer
- Clarence Otis & Drew Madsen


text:
Shop now and get Free Value Shipping on most orders over $49 to the contiguous 48 states, DC and to all U.S. Military APO/FPO/DPO addresses.
We want to ensure that making a return is as easy and hassle-free as possible! If for any reason you decide that your purchase just isn't for you, simply return the item within 30 days of receipt and we'll cover the cost of return shipping. Learn more about our Return Policy.
Unfortunately Timberland TB1225 Prescription Eyeglasses is no longer carried by OpticsPlanet.
You can also explore other items in the Eyeglasses w/ Single Vision Lenses category yourself to try and find the perfect replacement for you!
Created to be a versatile pair of prescription eye glasses, the Timberland TB1225 Prescription Eyeglasses will transcend all social situations. Produced using top quality materials and design, these Eyeglasses w/ Single Vision Lenses from Timberland will give you ages of reliability and proficiency. Timberland has been in the eyewear industry for an incredibly long time and the Timberland TB1225 Prescription Eyeglasses are the end result of their initiatives to bring you the best pair of rx spectacles for the value. At OpticsPlanet, we have got a full group of people that are determined in assisting you to obtain the pair of spectacles that you are searching for. For the perfect option to make sure that that you are donning the very best pair of glasses possible, choose the Timberland TB1225 Prescription Eyeglasses.
Combination style with an urban flair. It offers a sharp rectangular shape with wide acetate temples for a masculine look. The semi shiny finish of the metal front makes a contrasting effect against the glossy and voluminous acetate temples . Spring hinges are incorporated to provide a comfortable fit.
We, at OpticsPlanet, try to make it easy to order Prescription Eyeglasses on line by providing as much information as we can. See our detailed Rx information page that explains How to Read Your Eyeglasses Prescription.
Available Timberland TB1225 Prescription Lens Styles:
These Timberland Prescription Eyeglasses are also available as Timberland Eyeglass Frames without prescription lenses:
Timberland TB1225 Eyeglasses without lenses
Timberland Rx Lenses are available in the following materials:
Connect with OpticsPlanet
Become our fan, follow us, & subscribe for the latest updates and deals
Subscribe to our email list
Sign up and receive $5 Off and get exclusive access to promotions, sales
events, pre-order sales & more!
Contact Information
Toll-Free: 800-504-5897
Intl.: 847-513-6201
Fax: 847-919-3003
Email: email@example.com
Hours of Operation
8AM-7PM CST Mon-Fri
9AM-5PM CST Sat
9AM-5PM CST Sun (Email & Chat Only)
Our Guarantees


text:
A defiant Iraqi Prime Minister Nouri al-Maliki on Wednesday rejected calls for an interim "national salvation government" in his first public statement since President Barack Obama challenged him last week to create a more inclusive leadership or risk a sectarian civil war.
US officials, meanwhile, said there are indications that Syria launched airstrikes into western Iraq yesterday in an attempt to slow the al-Qaeda-inspired insurgency fighting both the Syrian and Iraqi governments.
Officials said the strikes appeared to be the work of Syrian President Bashar Assad's government, which is locked in a bloody civil war with opposition groups. The target of the attacks was the extremist group Islamic State of Iraq and the Levant, which has been fighting along with the rebels opposed to Assad and seeks to carve out a purist Islamic enclave across both sides of the Syria-Iraq border.
The White House said intervention by Syria was not the way to stem the insurgents, who have taken control of several cities in northern and western Iraq. "The solution to the threat confronting Iraq is not the intervention of the Assad regime, which allowed ISIL to thrive in the first place," said Bernadette Meehan, a National Security Council spokeswoman. "The solution to Iraq's security challenge does not involve militias or the murderous Assad regime, but the strengthening of the Iraqi security forces to combat threats." US officials believe the leadership in Baghdad should seek to draw Sunni support away from the militants led by the Islamic State.
The insurgency has drawn support from disaffected Iraqi Sunnis who are angry over perceived mistreatment and random detentions by the Shiite-led government.
Several politicians, including Ayad Allawi, a secular Shiite who has been named as a possible contender to replace al-Maliki, have called on him to step down and form an interim government that could provide leadership until a more permanent solution can be found.
Al-Maliki, however, insisted the political process must be allowed to proceed following recent national elections in which his bloc won the largest share of parliament seats. "The call to form a national salvation government represents a coup against the constitution and the political process," he said. He added that "rebels against the constitution", a thinly veiled reference to Sunni rivals, posed a more serious danger to Iraq than the militants. He called on "political forces" to close ranks in the face of the growing threat by insurgents, but took no concrete steps to meet US demands for greater inclusion of minority Sunnis. "We desperately need to take a comprehensive national stand to defeat terrorism, which is seeking to destroy our gains of democracy and freedom, set our differences aside and join efforts," said al-Maliki. "The danger facing Iraq requires all political groups to reconcile on the basis and principles of our constitutional democracy. We, despite the cruelty of the battle against terrorism, will remain loyal and faithful to the will and choices of the Iraqi people in bolstering their democratic experiment," he said.
Al-Maliki's coalition, the State of the Law, won the 92 seats of the 328-member parliament in the election. In office since 2006, al-Maliki needs the support of a simple majority to hold on to the job for another four-year term. The legislature is expected to meet before the end of the month, when it will elect a speaker. It has 30 days to elect a new president, who in turn will select the leader of the majority bloc in parliament to form the next government.
In fighting today, Sunni militants launched a dawn raid on a key Iraqi oil refinery they have been trying to take for days, but security forces fought them back, said Colonel Ali al-Quraishi, the commander of the Iraqi forces on the scene.
A mortar shell also smashed into a house in Jalula, northeast of Baghdad, killing a woman and her two children. That town in the turbulent Diyala province is under the control of Kurdish fighters known as peshmerga.
Also today, a report by Iran's semi-official Fars news agency said an attack near Iran's western border with Iraq has killed three Iranian border guards. They were killed last night while patrolling along the border in western Kermanshah province. A border outpost commander was among the three killed, Fars quoted a local security official, Shahriar Heidari, as saying. Heidari said an unspecified "terrorist group" was behind the attack but provided no details.
In an unusual twist for the long-time foes, the US and Iran find themselves with an overlapping interest in stabilizing Iraq's government, and a US official said today that Iran has been flying surveillance drones in Iraq.


text:
Next, you'll be asked to connect with Twitter. Rest assured, we will never send a tweet from your account
without your permission.
We will send you an email with an invite soon.
Share your story for possible inclusion in my book on untethering and unplugging our lives #untether #unplug
I'm working on a book about untethering your life. Share your story for possible inclusion here #untether #unplug
My first time: about getting my first "official" book deal: #bookgirl @bookgirltips
Zombie Loyalists. B.R.A.I.N.S. That is all. #customerservice #book
My First Time: on getting my 1st book deal for "Cybergrrl: A Woman's Guide to the World Wide Web"
RT @xeni: Please support this book: Beauty After #BreastCancer. I'll be in it. @kickstarter #BCSM
Wow. Get to Know 25-Year-Old Emma Cline, Whose Manson-Influenced Book Just Sold For Big Money: via @flavorwire
RT @davegray: One of favorite things about @Medium is the way it allows inline comments. Huge help when writing a book!
See what's Trending Now for @alizasherman
Follow @alizasherman on Twitter


text:
Last night, 2009 Rock and Roll Hall of Fame Inductees Metallica kicked off a week-long residency on The Late Late Show With Craig Ferguson with "Hit the Lights" – a fitting opening volley as it was also the opening track of the group's furious 1983 debut album Kill 'Em All.
For more than three decades, Metallica has been the standard by which metal's vitality and virtuosity are measured. Led by vocalist and guitarist James Hetfield, drummer Lars Ulrich, bassist Cliff Burton and lead guitarist Kirk Hammett, the group's debut established the thrash metal sound in America.
Ride the Lightning, Master of Puppets and …And Justice For All
The Metallica albums that immediately followed Kill 'Em All – Ride the Lightning (1984) and Master of Puppets (1986) – showed increasing levels of ambition, intensity and technicality. On the strength of those recordings, the band enjoyed a surge in popularity, but tragedy struck during a headlining tour of Europe. Traveling on an icy road in Sweden, Metallica's tour bus lost control, crashing and instantly killing bassist Burton in September 1986. Fans of Cliff Burton will recognize the 1978 Rickenbacker 4001 bass guitar that is part of the Rock Hall's heavy ...
Below is an excerpt from Glyn Johns' new book, SOUND MAN: A Life Recording Hits with the Rolling Stones, the Who, Led Zeppelin, the Eagles, the Faces... (On sale now, Blue Rider Press).
Who's Next
The previous year, 1970, the Stones had started recording at Mick Jagger's house out in the country, near Newbury. By this time, the Stones Truck was fully operational and we used the huge entrance hall of the Victorian pile that was Stargroves to record several tracks that were eventually used on Sticky Fingers. I had mentioned to Pete Townshend in conversation that these sessions had gone really well, so he suggested that we go there to start recording Who's Next.
We began on the first day with "Won't Get Fooled Again." Not a bad way to start. With Pete's permission, I edited the synthesizer track from his original demo, as it was a little too long, and played it in to the band in the studio. They performed live to it with remarkable skill, the synthesizer dictating a constant tempo for every bar of the song, with them staying locked relentlessly to it throughout. Roger Daltrey's powerful vocal equaled ...
Rock and Roll Hall of Fame Inductees Tom Dowd, Berry Gordy Jr., Les Paul, Sam Phillips and Phil Spector represent a 1950s and 1960s "recordist canon," pioneers of maverick recording methodologies responsible for shaping the sound of classic rock and roll. Their work not only forms the underpinning of rock music's sonic characteristics, but also represents an oft-imitated body of audible stylistic, genre and aesthetic recording principles. Some of their radical, experimental and at times rebellious production techniques – Paul's "Sound on Sound," Spector's "Wall of Sound"and Phillips' "Slap Echo" for example, have informed a continuum of established rock production standards.
However, the 1990s also marked a significant turning point in pop and rock sound recording. At a time when computer-based digital audio workstations (an electronic tool for recording, editing and producing audio files) were fast becoming the norm, many sound recordists of the era either rejected this new direction outright or blended technological and processual precursors into unconventional and individualized working practice. Such reinventions of technological and processual modes of production mirror those of the 1950s and 1960s '"recordist canon."
Here are 5 songs that helped define the sounds of the 1990s, and the producers who ...
The biggest hit of Simon and Garfunkel's career turned into their swan song. The much-loved and critically acclaimed duo personified poetic, collegiate folk rock. Throughout the 1960s, however, Paul Simon's songs increasingly discarded formal language for more colloquial lyrics. Similarly, his music expanded from the folkie roots implicit in his guitar finger picking. "Bridge Over Troubled Water" reflected these trends, besides being a typically well-manicured production. Similar qualities characterized Simon's subsequent solo career.
"'Bridge Over Troubled Water' is something of a mystery to me," notes Simon in the Rock Hall's latest exhibit, Paul Simon: Words & Music. "Because nothing prompted me to write it. I was listening to a lot of gospel quartets, particularly the Swan Silvertones and the Everly Brothers album Songs Our Daddy Taught Us. I was stunned and I thought, 'that's a lot better than I usually write.'"
With a dramatic piano introduction and majestic melody, "Bridge Over Troubled Water" is a moving, spiritual song that like the Beatles' "Let It Be" evokes gospel themes without the overt trappings of that genre. Some theorize that its massive success piqued Simon, who not only wrote the tune but also was intimately involved in its ...
Who was Mrs. Roosevelt and what's her relation to Mrs. Robinson? Where did Joe DiMaggio go? Where does Paul Simon come up with his lyrics?
"So goodbye to Mrs. Roosevelt, all along the road down to glory hallelujah," Simon recites from an old handwritten lyric manuscript (pictured) featured in the Rock and Roll Hall of Fame and Museum's new exhibit, Paul Simon: Words and Music. "I don't think of what I do as writing poetry, but the language may have imagery in it."
Watch Hall of Fame Inductee Paul Simon talk about how "Mrs. Roosevelt" became the famous "Mrs. Robinson," the real background to the "Where have you gone Joe DiMaggio" lyric and more:
Opening on October 30, 2014, the Rock and Roll Hall of Fame and Museum in Cleveland's new exhibit Paul Simon: Words & Music will feature exclusive candid commentary gathered from hours of filmed interview footage that walks the audience through the personal story of Simon's life and his creative process. This opening marks the Museum's first-ever exhibit anchored by first-person narration by the artist. In addition to the autobiographical films, there will be videos of select performance highlights from Simon's ...
No one song ever defined or redefined a group as generously as "Stairway To Heaven" did Led Zeppelin. For Jimmy Page, "Stairway" crystallized the essence of the band: "It had everything there and showed the band at its best...as a band, as a unit" he said.
"Stairway" evolved during winter 1970-71 sessions for the group's iconographically titled fourth album (a.k.a. ZOSO). It achieved an alchemical blend of the band's metal foundation with the rootsy feel of tones that decorated Led Zeppelin III. Page came up with the chord structure at the Zep retreat in Bron-Yr-Aur, Wales. After a reality check back in London at Island studios, the band regrouped at a country estate in Hampshire called Headley Grange. "Stairway To Heaven" came together as the band lounged before a roaring fire, took out the guitars and plugged into the Rolling Stones' mobile recording studio parked outside to capture the rapid flow of inspiration.
Plant in particular seemed to be channeling an active muse. According to Page: "He must have written three quarters of the lyrics on the spot. He didn't have to go away and think about them. Amazing, really." Plant himself cited British ...
British music magazine NME recently published a feature asking more than two dozen performers what are the songs they'd wish they had written. The responses gathered from artists young and old, across genres, included nods to the likes of Bob Dylan ("It's Alright Ma(I'm Only Bleeding)"), David Bowie ("Ziggy Stardust" and "Life on Mars?"), James Brown ("Hot Pants" and "Cold Sweat"), Abba ("The Winner Takes It All"), the Beach Boys ("God Only Knows"), Ike and Tina Turner ("Nutbush City Limits") and more. (pictured, clockwise from left: Jimi Hendrix's 1967 Gibson Flying V dubbed "Love Drops;" Slash performs live at the 2012 Rock and Roll Hall of Fame Induction Ceremony; dresses worn by the Supremes in 1969.)
"Cole Porter and Irving Berlin are just the best," Ray Davies of Hall of Fame Inductees the Kinks told NME. "Songs by Chuck Berry, Otis Redding and Hank Williams I love, too. Or anything Holland-Dozier-Holland did for the Supremes." All those artists – as well as the songwriting team of Holland-Dozier-Holland – are Hall of Fame Inductees and feature prominently in the Rock and Roll Hall of Fame and Museum's Cities and Sounds and Legends exhibits.
2012 Hall of Fame ...
What was it like being in the studio with Metallica as they recorded some of their earliest albums: Ride the Lightning, Master of Puppets and … And Justice For All? Producer Flemming Rasmussen knows. Tapped by James Hetfield, Lars Ulrich, Kirk Hammett and Cliff Burton in 1984, Rasmussen was hired to produce Metallica's second studio album, Ride the Lightning. The thrash classic followed the band's 1983 debut, Kill 'Em All, and brought the band to Sweet Silence Studios in Copenhagen, Denmark, where they connected with Rasmussen.
On the 30th anniversary of Ride the Lightning, Flemming Rasmussen visited the Rock and Roll Hall of Fame and Museum in Cleveland, Ohio, during a trip to the region to deliver a keynote speech and master classes at Capital University's Music Technology Workshop. While in Cleveland, Flemming donated studio photos to the Rock Hall's Library and Archives, and sat down to talk about recording three seminal heavy metal recordings with 2009 Rock and Roll Hall of Fame Inductees Metallica, including the recording of "For Whom the Bell Tolls" and "Master of Puppets," and what he believes is the best Metallica recording.
Rock Hall: How did you first start working with Metallica ...


text:
Report: John Cassaday Likely Next MLSE President & CEO
Shawn Reis
May 22 2015 09:55PM
Long before there was a search for a new GM or head coach, there was the search for a new President & CEO of Maple Leafs Sports & Entertainment, the group that owns the Toronto Maple Leafs.
Last August, it was announced that current President & CEO Tim Leiweke would be stepping aside to pursue other career interests, with lots of speculation that Leiweke was unhappy having to deal with a notoriously difficult group of owners.
Reports have begun to surface that suggest John Cassaday, who recently stepped down as the President & CEO of Canadian broadcaster Corus Entertainment, will be the person to replace Leiweke, who was slated to officially step down from his role with MLSE on June 30th.
Leafs Set To Hire Jim Hiller as Assistant Coach
Jeff Veillette (Jeffler)
May 22 2015 03:26PM
Mike Babcock may be the new man leading the bench in Toronto, but the head coach can't do it all on his own. As such, the focus has shifted to his assistants, and from the looks of it, the Leafs have added one one of Babcock's previous assistants in Jim Hiller.
The Steve Dangle Podcast - May 22, 2015 - Babby Cockmen
Steve Dangle
May 22 2015 01:08PM
Today on the show, MIKE BABCOCK OMG.... Or nah?
Babcock's Assistant Coach History
Jon Steitzer
May 22 2015 01:00PM
As I hinted to yesterday in my post on Babcock and as Shawn hinted to in his article on the prior day, one of the next big questions is who will Mike Babcock name as his assistant coaches? Will Babcock be making frantic calls to Ken Holland to free up his assistants? Will Paul MacLean see a Brinks truck of MLSE money and telecommunications share pull up in front of his house this morning? As luck would have it, Dan Rosen of NHL.com wrote an excellent article on Mike Babcock's assistants, his process, and their successes back in October, and it's filled with insight and even more optimism. I strongly recommend going to read the whole thing as it has a lot on Babcock's coaching philosophy as well, but of course, here are the highlights.
McPhee and McCrimmon could be in discussion for Leafs' front office
Ryan Fancey
May 22 2015 12:27PM
It's been a wild week in Toronto with the Babcock news, but along with it seems to be some major spin-off of talks about the Leafs' options to fill their front office. It feels like by the time this is all said and done, there may not be a CHL general manager left in the country.
TSN's Bob McKenzie joined the folks in Edmonton for a radio spot this morning and had some interesting things to say regarding the week's big hire, Toronto's ongoing general manager search, and even more junior hockey names popping up as potential targets to join this rebuild.


text:
Center Stand for XR650L and XT225
View Single Post
Joined: Nov 2007
Location: about to be lapped
Oddometer: 63
Originally Posted by
Cigar Mike
Youre welcome.
Adventure riders are a unique group of riders. They are involved in all types of riding from hard core single track to adventure rides that are mainly pavement. They very often use a bike for a purpose that was not intended by the manufacturer. If the bike does not fit, they make it fit. This is how the center stand for our DS bikes came about. I wanted a center stand on our bikes so that I could change to a different set of wheels (street tires) easily and fix flats when out on the bikes. When we are hundred miles from nowhere the center stand is welcome for getting the flat fixed and moving again.
When I posted about the stands that I had made for our bikes I was asked if I would make them available. Since I was retiring it seemed like a good idea so that I could keep busy doing something I enjoy. Other models were made available upon request. I dont market the stands trying to convince someone that they need what I make. I could care less if I ever sell another center stand, other then I will have to find something else to do to keep me busy. So if someone says to me no sale. Who asked you to buy anything? I build what I am asked to build. I dont ask anyone to buy what I build. If you want one, fine. If not, fine. I let it be known that they are available and for how much and I stand behind what I make.
Overall it has been a good experience making and selling the stands. The people that I am in contact with have been great. There have been some problems but it always seems to work out with the help of the riders. I would have probably quit a long time ago if this was not the case. But the riders that I have come in contact with have made it a worthwhile endeavor.
I have no idea how long I will continue to do this. If it becomes a job instead of a hobby, I will stop. If the time it takes interferes with the time I need to spend with my family, I will stop. And obviously if there is no longer any demand, I will stop. If there is too much demand, I will stop. This is a hobby that had to be a business for legal and tax concerns. I do not make a living from this and dont need the money to survive.
Cigar Mike
Fair enough.
The only reason I posted my concern is because I WANT to buy your product. Now that you mention it, a retaining device is a great idea, for those riders that hit the rough trail. Why am I out of line for suggesting such a thing? And who better to provide a retaining device, other than the guy that designs such awesome center stands? Am I asking too much? I'll pay extra for the stand if it comes with a retaining device!
View Public Profile
Find More Posts by moventurer


text:
For brides who want a charming hand-crafted look, Etsy has a treasure trove of options.
6 Stunning Places to Get Married in the Fall
Kids will have a blast (and a friendly competition) with this homemade ship-race game from Brittany of One Charming Party. The miniature Nina, Pinta, and Santa Maria are constructed from painted milk or orange juice cartons—and propelled by balloons!
Complete How-To: Ship Race
Turn these popular treats into an adorable gaggle of gobblers. Angie from Bakerella.com created these turkeys using snacks such as caramel-dipped candy corn (for feathers) and coated espresso beans (for faces).
Complete How-To: Turkey Cake Pops


text:
Marco Council will investigate complaints regarding building department; Freedom Fountain plans discussed
MARCO ISLAND - At 4 p.m. on Monday, Marco Island City Councilors met behind closed doors to discuss pending litigation surrounding the city's building services division.
By evening, council called for a thorough investigation into complaints against the department.
"We do have litigation pending, but it would be a positive for the city to evaluate this," City Attorney Burt Saunders told council. He offered his services for $5,000 and promised a report to council by Dec. 2.
Councilor Larry Sacher volunteered to work on behalf of council with investigators, but Council Chairman Joe Batte asked the investigation be independent of council.
Community Affairs Director Bryan Milk, who oversees the department, defended the work of building services. The department processed 10,450 permits and conducted more than 40,000 inspections in a two-year period, he told council.
Councilors also asked Saunders to lobby state legislators to repeal laws prohibiting Florida cities from regulating activities in short-term rental units. Pending legislation would remove prohibitions that cripple cities when neighbors complain about misconduct, particularly in private home rentals.
Saunders agreed to work on behalf of council from November through the legislative session. His lobbying services will be billed to the city at $1,000 per month.
Council moved to tighten code enforcement on rental properties by including property owners as responsible parties for renter violations. Council voted 5-0 on first reading to revise its definition of violator from renters only to include owners of property on which violations occur.
The revision will allow the city to place a lien on property where code enforcement has issued a violation to renters. The property's owner will be notified of the violation and can appear before the code enforcement board.
Councilor Chuck Kiester and Vice Chairman Ken Honecker were not present to vote at the meeting.
Council tabled discussion on assessing property owners for missing sidewalks on vacant lots and for necessary repairs to existing sidewalks. To date, the city has not enforced an ordinance passed in 1999 that required owners to construct or reconstruct, maintain and keep in good condition and repair, sidewalks in front of or abutting their property.
Saunders warned council that although property owners are required to maintain abutting sidewalks, the sidewalks are owned by the city. If a person were injured, he said, the city could be sued.
Council to Collier County
Council will take up two issues with the Collier County Board of Commissioners.
Councilors approved a letter strongly urging the county to keep the Tourist Development Council and the Coastal Advisory Committee as separate boards. Councilors received word county commissioners might consider combining them.
Council also discussed Marco Island's north beach where pooling water becomes stagnant and creates a muddy and murky walking surface.
North beach laser grading is not working, said Councilor Larry Honig.
"Pools of standing water are damaging the beach. We cannot add to the volume of sand on this beach but might be permitted to take our own beach sand and redistribute it," he said.
Honig asked council to allow Collier County's Coastal Zone Management Department to examine the feasibility of moving sand from the water side of north beach. By moving 50 to 100 feet of waterside sand to the affected area, a slope could be created that would eliminate pooling and allow sea turtles to nest, he said. Marco's north beach is over 1000-feet wide.
Estimated cost for the project is $3-4 million and could be completed within 2 years. The city would request money from county commissioners for the project.
Council presentations
Council heard three presentations Monday.
Honig shared information collected from Florida cities charting debt and taxation. Honig compared like cities that owned water/sewer utilities with populations ranging from 7,500 to 100,000.
"City debt is the highest in the state of Florida," Honig said. "Municipal taxes and water sewer are second highest in the state."
Council agreed to continue discussing city debt at a later meeting and to consider funding some future capital projects without increasing debt.
Sacher presented an overview of city pension plans. He described benefits and pension plans as generous, asking councilors to consider reviewing them as the city goes forward.
"Benefits are a death sentence for cities," said Councilor Amadeo Patricca after the presentation. "We need a survival plan for Marco Island."
Lee Rubenstein and Charles Hartman of the Veterans' Memorial Fundraising Committee presented plans for a new freedom fountain and flag plaza in Veterans' Community Park. The group was given permission by council to raise funds for the projects through the Community Foundation of Collier County.
Subscribe to the Naples Daily News
Need Help? Call us at 1-888-878-6842.
Monday-Friday: 6am-6pm / Saturday: 7am-3pm / Sunday: 7am-2pm


text:
21-07-2014 0:15 - last edited on 21-07-2014 14:11 by tiny_chef
Hi i have problem with my chat on my Nokia c3 00. anytime i open the chat it says click below and get the latest chat version. And anytime i click it .it says re trying request (1) and re trying request(2) then a message apears saying check ur phone connection and i have check and changes many times but it still doesnt work . So can u pls help me with this?thank u
Moderator's note: A new thread & title has been created for this post.
21-07-2014 7:23 - last edited on 21-07-2014 14:12 by tiny_chef
hi mate, a number of Nokia services have shut down over the years so i would say this one of these, and that it prompting an update to download is probably a broken link. there is nothing that can be done about this unfortunately.
Moderator's note: We have provided a subject-related title to help other forum users easily view and respond to this post.
21-07-2014 9:57 - edited 21-07-2014 19:48
Moved to Symbian Devices board.
23-07-2014 17:16
@chatproblem which network operator do you use, in which country?
30-07-2014 8:03


text:
Play A Song of Christmas
By Richard Willis John Francis Wade
Play A Song of Christmas (35 Favorite Christmas Songs and Carols in Easy Arrangements). Composed by Richard Willis John Francis Wade. Edited by Ruth L. Zimmerman. For Handbells. Classical. Easy. Part(s). Standard notation. 22 pages. Theodore Presser Company #416-41134. Published by Theodore Presser Company (PR.416411340).
With Standard notation. classical.


text:
FRCF Athletes
Please make sure to talk to your Personal Coach about the FRCF phone app which allows you to check the FRCF daily workout and leaderboard in real time. You can also track your workout results, attendance and membership data. Your Personal Coach can get you set up with it in just a couple of minutes.
Happy birthday, Cari!!
CrossFit Workout
General Warmup
550 meter run
IronScap Shoulder Warmup (start this at 5 past the hour)
5 Step Movement and Mobility (start this at 10 past the hour)
90 Rep Warmup (start this at 15 past the hour)
10 air squats
10 KB snatches, light
10 KB overhead situps
Workout Specific Workout (start this at 20 past the hour)
Do 10 reps of each exercise below.
Workout (start this at 30 ish past the hour)
For time:
39 box jumps, 24" box, (20" box)
39 jumping pull-ups
39 kettlebell swings, 16 kg (12 kg)
39 steps walking lunge
39 knees to elbows
39 push press, 45 pounds (35 lbs)
39 back extensions
39 wall ball shots, 20 lb ball (12 lb ball)
39 burpees
39 double unders
Competition Team Lift
Take 15 minutes and warm your squat clean double up to 65%.
Then 10 rounds on the 2 minute start interval of:
1 squat clean + 2 front squats, start at 70% and go up from there.
5 x 5 of behind the neck push press, on the 90 second start interval
start at 60% of your max snatch and go up from there.
Competition Team Skills
On the 6 minute start interval.......
3 x 10 muscle-ups
Start each set of muscle-ups on the 6 minute mark, but you only have 4 minutes to accomplish the set of 10. So if you aren't done with the set of 10 at the 4 minute mark, just jot down the number that you successfully performed in the 4 minutes.
Supplemental Workout
10 rounds of bike sprints
2 minutes hard
1 minute easy
"The body must be credited with an immense fund of know-how."
- Deepak Chopra


text:
Much like the ghost Titanic docking in New York Harbor in Ghostbusters 2, "Better late then never!"
No, this is not the Tim "MightyMutt" Hibbs interview episode, that's the one for next week. Shanghai has been juggling interview guests since the new year, but they've all since wigged out or gotten busy. But have no fear, we'll be interviewing ol' Tim next week.
As for this week, we're not completely wasting your time, as we have a special guest on the show: brand new addition to the Front Towards Gamer rebel camp, Travis "TurboBison" Foster, officially turning over the colors his site PTFGN to FTG. TurboBison goes over his origin story (hint: not a Street Fighter reference?) and confuses us with talk of Jamestown, Batman talks about the latest Gears of War 3 downloadable content Fenix Rising and Hero Academy, while Shanghai gives much love to the best GiJoe game never created, Sega's Renegade Ops!
Like what you hear? Subscribe here on iTunes!
Hate iTunes? No problem!: Subscribe to our RSS Feed!
Podcast: Play in new window | Download
Stephen "Shanghai Six" Machuga : (@ShanghaiSix)
Craig "Batman5273″ Kandiko: (@Batman5273)
Travis "TurboBison" Foster: (@_TravFoster)
Audio Editing:
XXXXX "dingledodie" XXXXX (@dingledodie77)
Intro Music: "Bulls of Parade" (chiptune) by Dakota Clark
Interview Segment: "Silly Job Interview" by Monty Python's Flying Circus
Community Segment Music: "Fansong" by Dethklok
Outro Music: "To Be Loved" by Papa Roach
Got a message or feedback? Send it to email@example.com


text:
Your email has been sent.
Beate Gordon (1923-2012)
At age 22, Gordon wrote women's rights into the Japanese constitution
If you'd like to be humbled as you move into the new year, I highly suggest checking out the Times obit of Beate Sirota Gordon, who passed away on Sunday at 89.
Born to Russian Jewish parents, Gordon was separated from her parents during World War II while they were in Japan and she was in college in the States. Fluent in many languages, Gordon arrived in Japan as part of General Douglas MacArthur's occupying forces. It was there she became involved in helping draft the new Japanese constitution, which she rarely spoke about until decades later.
Her work — drafting language that gave women a set of legal rights pertaining to marriage, divorce, property and inheritance that they had long been without in Japan's feudal society — had an effect on their status that endures to this day.
"It set a basis for a better, a more equal society," Carol Gluck, a professor of Japanese history at Columbia University, said Monday in a telephone interview. "By just writing those things into the Constitution — our Constitution doesn't have any of those things — Beate Gordon intervened at a critical moment. And what kind of 22-year-old gets to write a constitution?"
Check out the rest here. Great story.
Beate Gordon, Feminist Heroine in Japan, Dies at 89 [NYT]
The International Response to Settlements
Looking at the overblown rhetoric on settlements, shameful silence on Syria
Click here for access to comments
Daily rate: $2
Monthly rate: $18
Yearly rate: $180
Tablet is committed to bringing you the best, smartest, most enlightening and entertaining reporting and writing on Jewish life, all free of charge. We take pride in our community of readers, and are thrilled that you choose to engage with us in a way that is both thoughtful and thought-provoking. But the Internet, for all of its wonders, poses challenges to civilized and constructive discussion, allowing vocal—and, often, anonymous—minorities to drag it down with invective (and worse). Starting today, then, we are asking people who'd like to post comments on the site to pay a nominal fee—less a paywall than a gesture of your own commitment to the cause of great conversation. All proceeds go to helping us bring you the ambitious journalism that brought you here in the first place.
Readers can still interact with us free of charge via Facebook, Twitter, and our other social media channels, or write to us at firstname.lastname@example.com. Each week, we'll select the best letters and publish them in a new letters to the editor feature on the Scroll.
We hope this new largely symbolic measure will help us create a more pleasant and cultivated environment for all of our readers, and, as always, we thank you deeply for your support.