text:
In a list processing system, small reference counters are maintained in conjunction with memory cells for the purpose of identifying memory cells that become available for re-use. The counters are updated as references to the cells are created and destroyed, and when a counter of a cell is decremented to logical zero the cell is immediately returned to a list of free cells. In those cases where a counter must be incremented beyond the maximum value that can be represented in a small counter, the cell is restructured so that the additional reference count can be represented. The restructuring involves allocating an additional cell, distributing counter, tag, and pointer information among the two cells, and linking both cells appropriately into the existing list structure.
1. In a data processing system having a list processor and a memory formed of cells, each cell having two pointers, the first pointer being the CAR and the second pointer being the CDR, each cell also having a code (TAG) to indicate the type of cell, some of the cells being organized into linked lists by the pointers referencing other cells, which lists are continually being modified by some new cells being added from a free list and some cells being rendered inaccessible by destruction of references to such cells, a reference counter being attached to each cell, each time a new reference to the cell is created the counter being incremented and each time a reference to the cell is destroyed the counter being decremented, when the counter becomes zero the cell is returned to the free list, a real-time garbage collection system comprising:
means for obtaining an additional cell from the free list for each original cell whose reference counter reaches its maximum value;
means for storing the contents of the original cell, linking information relating the two cells to the original list structure, and additional reference count information in the two cells; and
means for incrementing and decrementing the additional reference count information provided by the two cells to reflect created or destroyed references.
2. The data processing system specified in claim 1 in which the two linked cells provide additional space for the provision of an expanded counter which can be further incremented.
3. The data processing system specified in claim 1 in which the additional cell provides a new counter whereby the new reference is directed to the additional cell, the new counter being available for additional incrementation.
4. The data processing system of claim 2 wherein the handling of the reference counters is under the control of a garbage manager means, the garbage manager means maintaining the reference counters and the free list and handling memory references and cell formats on behalf the list processor.
5. The data processing system of claim 4 in which the garbage manager means in response to a command from the list processor that a new reference has been created operates on the referenced memory cell incrementing the reference counter, in the event that the reference counter has reached its maximum value, the garbage manager means obtains an additional cell from the free list in which is stored the contents of the original cell, and the original cell is provided with an expanded counter and a link to the additional cell.
6. The data processing system of claim 4 in which the garbage manager means in response to a command from the list processor that a reference has been destroyed operates on the referenced memory cell, decrementing its reference counter, in the event the reference counter is decremented to zero the garbage manager returns the cell to the free list.
7. The data processing system of claim 6 in which the garbage manager means when decrementing a reference counter of an expanded cell obtains a maximum value equal to or less than the value of the small reference counter of an original cell restores the contents of the original cell to the original cell and returns the additional cell to the free list.
8. The data processing system of claim 4 in which the garbage manager means in response to a command from the list processor to retrieve a cell from memory retrieves the indicated cell, if the cell is in expanded format the garbage manager means also retrieves the additional cell and provides the cell content to the list processor.
9. The data processing system of claim 8 in which the cell content provided to the list processor is the TAG, CAR and CDR of the original cell and the reference counter in expanded format.
10. The data processing system of claim 4 in which the garbage manager means in response to a command from the list processor to store a cell into memory, in the event that the cell is in original format the garbage manager means stores the cell, in the event that the cell is in the expanded format, the garbage manager means retrieves the link to the additional cell which the garbage manager means uses to store the TAG, CAR and CDR.
11. The data processing system of claim 3 wherein the handling of the reference counters is under the control of a garbage manager means, the garbage manager means maintaining the reference counters and the free list and handling memory references and cell formats on behalf the list processor.
12. The data processing system of claim 11 in which the garbage manager means in response to a command from the list processor that a new reference has been created operates on the referenced memory cell incrementing the reference counter, in the event that the reference counter has reached the maximum value, the garbage manager means obtains an additional cell from the free list in which its store the TAG, CAR and CDR of the original cell and a reference counter indicating a count of one and changes the new reference to point to the additional cell.
13. The data processing system of claim 1 in which the handling of the reference counters is implemented by software.
14. The data processing systems of claim 1 in which the cell has no space allocated for the arbitrarily small size reference counter, in which case the reference counter is presumed to have the value one.
15. The data processing system of claim 1 wherein the handling of the reference counters is under the control of a garbage manager means which is an intergral part of the list processor.
16. The data processing system of claim 1 wherein the handling of the reference counters is under the control of a garbage manager means which is interposed between the list processor and the memory.
17. The data processing system of claim 1 in which there are multiple list processors and multiple memories interconnected together into a coordinated system with a garbage manager means for each processor.
18. The data processing system of claim 1 in which there are multiple list processors and multiple memories interconnected together into a coordinated system with a garbage manager means for each memory.
19. The data processing system of claim 1 in which a high speed buffer memory is used for cell manipulation to reduce the number of references to the main memory.
20. The data processing system of claim 19 in which the cells used in the high speed buffer have a counter designed to eliminate cell expansion for brief excursions above maximum small counter value.
21. A method for controlling reference counts in a computer system in which a count of how many pointers which reference blocks of memory are held in association with associated blocks of memory, and in which the count is incremented and decremented as pointers to the blocks are created and destroyed, and in which there is a means of obtaining unused blocks of memory and their associated counters, comprising, when a new reference pointer is created which would require a counter associated with a first block to be incremented beyond its maximum value:
obtaining an unused second block of memory;
copying the contents of the first block, including pointers, to the second block, the copying of any pointers from the first to second block being treated normally as the creation of new pointers;
setting the counter of the second block to indicate a single reference and leaving the counter of the first block unchanged; and adjusting the new reference pointer to point to the second block.
22. A method for controlling reference counts in a computer system in which a count of how many pointers which reference blocks of memory are held in association with associated blocks of memory, and in which the count is incremented and decremented as pointers to the blocks are created and destroyed, and in which there is a means for obtaining unused blocks from an unused memory pool and for adding blocks to the unused memory pool, comprising:
initially designating all blocks of memory as normal;
when a pointer is created which would require incrementing the counter of a normal first block beyond its maximum value, obtaining a second block from the unused pool, redistributing the information from the first block into the two blocks, placing a linking pointer to the second block in the first block, allocating a larger reference counter in either block, designating the two blocks as being in expanded format, and incrementing the resulting larger counter.
The invention described herein was made by an employee of the United States Government and may be manufactured and used by or for the Government of the United States of America for governmental purposes without the payment of any royalties thereon or therefor.
This invention relates to data processing systems and their arrangements for allocation and deallocation of memory space, particularly to an improved mechanism for keeping track of the number of active references to a memory cell in a list processing system.
Many present data processing systems are concerned with the manipulation of linked list structures. Each memory cell in a list contains pointers, which refer either to other list fragments, or to fundamental data items which are called atoms. Atoms, which can be symbols or numbers, may also refer to another atom or to a list. New lists are constructed by allocating vacant cells from a free list, and placing into them pointers to existing lists, pointers to fragments of lists, or pointers to atoms. Pointers within existing lists are not normally modified, and thus several lists or atoms may reliably refer to the same underlying list fragment as part of their value, without having to make their own copy. The above described manipulation of linked list structures is termed list processing. It is implemented in specialized data processors designed particularly for list processing, and also in general purpose data processors.
All accessible memory cells may be reached either by tracing down a list referenced by an atom, by tracing down a list referenced by a stack entry, or by tracing down the free list. As the values of atoms and the stack change, some cells become inaccessible. Identifying these cells and adding them back to the free list is called garbage collection.
In a survey by Cohen, "Garbage Collection of Linked Data Structures," ACM Computing Surveys, September 1981, pp. 341-367, garbage collection strategies are classified as two main types: (1) mark and sweep, and (2) reference counter based. The basic mark and sweep strategy is to trace down all lists from the base atoms and stack entries, marking each accessible memory cell by setting a bit provided for that purpose. Then memory is scanned, and all unmarked cells are reclaimed. The mark bits are usually also reset during this scan. Processing must be halted while the marking operation is in progress, which can result in large delays. These unanticipated delays cause inconvenience, not to mention outright failure, in systems which must exhibit real time or conversational response, such as process control or spoken natural language communication. In addition to the delay of waiting on the collector to find new free cells, data structures typically become scattered through a large area of memory. In a paging virtual memory system this results in page thrashing, which degrades response time and generally limits the amount of work that can be done by the machine. One improvement to mark and sweep strategies is to use two bits, and a more complicated marking process which is able to proceed without halting the list processor. One such strategy is disclosed in U.S. Pat. No. 4,121,286 Venton, et. al. However, according to Hickey, "Performance Analysis of On-the-Fly Garbage Collection," Communications of the ACM, Nov. 1984, pp. 1143-1154, up to three times as much processing power may need to be devoted to garbage collection as to list processing in order to guarantee that list processing need never halt to wait for the collector to find a needed free cell.
A relative of mark and sweep, Baker's Algorithm, is the method used in many commercial list processing systems. This method involves partitioning memory into at least two spaces, evacuating structures from one space to the other, and leaving behind forwarding pointers in the evacuated space. The "to-space" is then purged of all references to the evacuated space via a linear scan in which all pointers to the evacuated "from-space" are replaced with the forwarding pointer. Copying a cell to the "to-space" is equivalent to marking. Another advantage of Baker's algorithm is that cells are allocated sequentially from to-space. A variant of Baker's algorithm is described by Lieberman, "A Real-Time Garbage Collector Based on the Lifetimes of Objects," Communications of the ACM, June 1983, pp. 419-429.
The second method described by Cohen requires keeping a reference counter for each cell, which is incremented when a new pointer to the cell is created, and which is decremented when a pointer is destroyed. When the counter is decremented to zero, the cell may be immediately reclaimed and added back to the free list, thus guaranteeing no delays in finding free cells. Where large cells or blocks of storage are being infrequently manipulated, such as in certain operating system data structures, reference counters have long been used. Their use has not been as common in list processing systems because of the overhead in storing and updating the counters, and because of their inability to reclaim cyclic lists.
Experts disagree over the importance of reclaiming cyclic lists. For example Winston, in his widely used text LISP, 2nd Ed., Addison-Wesley, 1984, p. 141, points out the inadvisability of any structure requiring modification of existing list cells (construction of cyclic lists requires the sort of list modification which renders multiple references to common underlying list fragments unreliable; cyclic structures also render certain processing operations interminable). Lieberman, in the above mentioned article, considers use of cyclic lists to be an important technique.
Overhead is a problem because counters must be theoretically as large as a pointer, and must be kept current. Cohen mentions methods that have been suggested to alleviate one or both the overhead problems for reference counters. The earliest is based on the observation that most reference counters will be small; in fact, many will never exceed one or two. In this method, when a counter reaches its maximum value it is no longer updated. When and if memory is finally exhausted, a conventional mark and sweep method is used to reclaim cells with maximum value counters, and to reclaim cyclic lists. U.S. Pat. Nos. 4,447,875 and 4,502,118 disclose a very specialized type of list processing system, called a Reduction Processor, having a garbage collection system which uses reference counters in conjunction with mark and sweep.
A more sophisticated method of employing small reference counters, described in Cohen's article, is to assume all cells have a reference count equal to "one," unless the cell is entered in one of several hash tables. The hash table for cells with counts greater than one stores explicitly a counter of necessary maximum size. The tables are not updated immediately, however, due to overhead. Rather, a log of transactions is kept, and the tables are periodically updated; which gets back to the situation of occasional delays. One commercial vendor of list processing machines states that reference counters and tables are used, and these machines exhibit visible pauses for garbage collection.
U.S. Pat. No. 4,435,766, although not related to list processing or to garbage collection, discloses something which is primitively like a reference counter. This is called a lock counter, and is used to count the number nested resource locks created by a process on a resource, such as a computer peripheral.
Other United States Patents containing teachings of garbage collection in list processing systems, reference counting, replication, cache partitioning, and memory expansion are No. 4,432,057, Daniell, et. al.; No. 4,193,115, James Albus; No. 4,215,397, Gim Hom; No. 4,558,413, Schmidt and Lampson; and No. 4,463,424, Mattson and Rodriguez-Rosell.
It is an object of the present invention to provide an improved reference counter garbage collection mechanism for list processing, which has the advantages of small reference counters, while retaining the absolute determinacy and most of the simplicity of full sized counters.
Additional objects of the invention include: reduction of the overhead of updating reference counters; elimination of memory fragmentation typically caused by mark and sweep methods; and reduction of the complexity and overhead of other reference counter systems attempting to employ small counters.
Another object is to provide these advantages in such a way that they can be incorporated into data processing systems of the type currently in use, with a minimum of impact to the design and operation of these systems.
It is also an object of the invention to provide a method of garbage collection which is simple and robust enough to be used in next generation systems, especially those with large memories or employing highly parallel processing.
It is a further object of the invention to provide practical real-time list processing garbage collection.
Further objects and advantages of the present invention will become apparent from a consideration of the drawings and ensuing description thereof.
According to the invention, a reference counter of arbitrarily small size is kept for each cell. Each time a new pointer to the cell is created the counter is incremented, and each time a pointer to the cell is destroyed the counter is decremented. When the counter becomes zero the cell is returned to the free list. When any pointers within said cell are in turn destroyed, the counters of the cells to which they point are similarly decremented and checked for zero.
On the occasion that a counter can no longer be meaningfully incremented because it has reached its maximum value, an additional cell is obtained. Then the contents of the original cell, some additional count information, and linking information to relate the two cells to the former list structure, are stored in the two cells. The additional count information is incremented to reflect the new reference. The new reference pointer value will be adjusted to point appropriately within the new cell structure.
By the above method, all inaccessible cells are immediately identified and reclaimed; thus there is never an unanticipated delay when needing a free cell. The fixed and deterministic overhead of updating counters is accepted in lieu of the unpredictable delays of all systems which do not immediately identify and reclaim inaccessible cells. With small reference counters the overhead can be made quite small; less, in fact, than that of mark and sweep systems which either must use a lot of processing power to continuously locate inaccessible cells, or suffer degradation due to memory fragmentation.
FIG. 1 is a diagrammatic view of a list processing system showing the invention incorporated therein.
FIGS. 2 and 3 show the structures of a standard cell and an expanded cell, respectively.
FIG. 4 is a diagrammatic view of the registers and data paths used by the garbage management system.
FIG. 5 is a flow diagram of the garbage collection algorithm for adding references.
FIG. 6 is a flow diagram of the garbage collection algorithm for deleting references.
FIG. 7 is a flow diagram of the garbage collection algorithm for accessing cells of various types in a uniform manner.
FIG. 8 is a flow diagram of the garbage collection algorithm for obtaining cells from the free list and returning free cells to the free list.
FIG. 9 shows the data structures used to implement an alternate embodiment of the invention in which reference counter information and references to a list structure may be distributed among several memory cells.
Referring first to FIG. 1 brief consideration will be given to a typical list processing system organized on a modular basis suited to the invention. The system comprises (i) a central processing unit or list processor LP, (ii) a memory system MEM, (iii) peripheral units PU1, PU2, AM, (iv) a garbage manager GM, and (v) an intercommunication medium ICM for memory to processor or peripheral unit communication. Modules include the provision of needed control information about when references to memory cells are being created and destroyed, and the provision of space within the cell format for storing a reference counter. The arrangement and quantity of the various modules shown in FIG. 1 are typical only and not intended to be limiting.
The list processor LP is provided with a cell access interface CAI1 for retrieving or updating the contents of memory cells. Such accesses from the list processor LP to the memory system MEM are intercepted by the garbage manager GM, which is interposed between the list processor LP and the memory system MEM. The memory system MEM as shown in FIG. 1 is comprised of a memory manager MM, a cache memory CM, a main memory MA, and an auxiliary memory AM which is typically a peripheral unit such as a disk used as a backing store. Some data processing systems may omit or add elements of the memory system MEM.
A second interface to the list processor LP is the control function interface CFI1 which the processor uses to indicate what type of access to memory is being made, and to perform certain control functions. In addition to a retrieve RTV and a store STR function normally associated with memory interfaces, there are special control functions which are normally used only by list processors employing reference counter garbage collection. If these special control functions are not already present, the list processor can be appropriately modified to include them in the control function interface CFI1. The functions which the control function interface CFI1 communicates to the garbage manager GM are:
RTV--Access to retrieve cell contents
STR--Access to store cell contents
NEW--Get a cell from the free list
ADD--Add a new reference to a cell
DEL--Destroy a reference to a cell
EGM--Set the free list pointer and enable garbage manager
DGM--Retrieve free list pointer and disable garbage manager
SDL--Set dynamic space delimiter
With each function presented on the control function interface CFI1, the list processor LP also provides a cell address on the cell access interface CAI1. With access functions, the list processor LP will also provide cell content data (STR), or expect cell content data to be provided to it (RTV). The control function interface CFI1 is also used to return status and exception information to the list processor LP, as for example whether the function was successfully completed, and if not why.
There is also a cell access interface CAI2 and control function interface CFI2 from the garbage manager GM to the memory MEM, which are similar to the cell access interface CAI1 and control function interface CFI1, except that the control function interface CFI2 provides only access (retrieve and store) functions. The cell access interfaces CAI1 and CAI2 and the control function interface CFI2 may be part of the intercommunication medium ICM; however, the control function interface CFI1, because of the various unique functions described above, will be specialized.
In a typical list processing system there are several tasks, each with its own logical area of memory. There may also be more than one method of garbage collection available. It is desirable, therefore, that the initiation and termination of the operation of the garbage manager GM for specified areas of memory be controlled by the list processor LP.
When the list processor LP wishes the garbage manager GM to manage free space in an area of memory, it links the free cells in that area into a free list. If there are pre-existing list structures in the area which were not maintained under garbage manager GM control, the list processor LP computes and stores correct values for their reference counters. The list processor LP then transmits the address of the head of the free list to the garbage manager GM, along with the enable function EGM, which initiates garbage manager GM control of the free list. After that point, the garbage manager GM assumes all control of the free list, and the list processor LP retains control of all list elements traceable from atoms and stack entries. The list processor LP may regain full control and retrieve the free list pointer by issuing the disabling command DGM on the control function interface CFI1. The garbage manager GM may also notify the list processor LP of exceptional conditions, such as free list exhaustion, using the control function interface CFI1.
FIG. 2 shows the format of a list element LE, comprised of a cell A, to which there are small numbers of references R. A description of each field of bits within cell A is as follows:
CTR--reference counter having a range of possible values from 2 to the Nth power of 2, where N is the number of bits allocated for the counter.
TAG--a code used by the list processor to indicate the type of cell or other memory data item, in this case an appropriate code to indicate a standard small counter cell.
CAR--the first of the two pointers contained in the cell.
CDR--the second pointer contained in the cell.
FIG. 3 shows the same list element as FIG. 2, with an additional reference RA, exceeding the capacity of reference counter CTR. As will be explained subsequently, two physical memory cells are now used to represent list element LE. The original cell A has been modified to contain an expanded reference counter CTRX in place of its first pointer CAR, a link pointer LINK to a second cell in place of its second pointer CDR, and an appropriate tag TAG2 to indicate the format of the cell. A second cell AA contains the TAG, CAR, and CDR of the original cell.
The garbage manager GM is a sequential state machine implementing the process states of FIGS. 5 through 8 as described below. The garbage manager GM has the purposes of maintaining the reference counters and the free list, and of handling memory references on behalf of the list processor LP so that the list processor LP need not normally concern itself with those aspects of cell format which have to do with various reference counter configurations.
The garbage manager GM has internal storage registers, data paths, and functional units as shown in FIG. 4. When the list processor LP requests a function of the garbage manager GM, it sends the appropriate function code on the control function interface CFI1, sends cell address information on the address portion ADDR1 of the cell access interface CAI1 to a cell address register CA, and sends and accepts cell content and other information on the content portion CONTENT1 of the cell access interface CAI1 to a group of cell content registers CELL, which include: a reference counter CTRC, an extended reference counter portion XC, a tag TAGC, a first pointer CARC, and a second pointer CDRC. Similarly, the garbage manager GM uses the cell address register CA and cell content registers CELL to communicate with the memory manager MM over the control access interface CAI2, along with appropriate function codes on the control function interface CFI2. A memory address can also be supplied from a free pointer register FREPTR, which is used to store the address of the head of the free list, and an old cell address register OCA, which is used in deleting references. A multiplexer MPX is used to select which of these three sources of address information will be sent on the address portion ADDR2 of the cell access interface CAI2. An arithmetic and logic unit ALU is provided for computation and testing. A temporary register SAVE is used for computations and exchanges. Simple transfers are accomplished directly via an internal bus IB. The entire group of cell content registers CELL is transferred on the cell access interfaces as a unit, but one of its component registers is transferred on the internal bus IB. A select register S has the special function of selecting the first pointer CARC or second pointer CDRC for transfer. The delimiter register DLIM is used to partition logical memory space into a dynamic region in which cell allocation is handled by the garbage manager GM, and a static region managed by the list processor LP as will be explained in the discussion of Partial Tag Encoding in Pointers.
FIGS. 5 through 8 define important processes of the garbage manager GM using the functional units of FIG. 4 and the following special terms and conventions:
EXP--A tag value indicating use of the expanded counter format of FIG. 3.
NIL--A special pointer value designating an empty list.
MAX--The maximum reference counter value that can be represented in the small counter format of FIG. 2.
MIN--The minimum counter value representing that only one reference is present.
MEM(X)←Y--The operation of storing the contents of a register Y into a cell of memory MEM whose address is in a register X.
Y2←MEM(X2)--The operation of retrieving a cell of memory MEM whose address is in a register X2, and placing the contents of that cell into a register Y2.
CELL--Indicates the entire group of registers CTRC, TAGC, CARC, CDRC is referenced or updated, except that when transfer is to or from memory MEM, the extended portion XC of the reference counter CTRC is not included in the transfer.
CELL(S)--References the register CARC when the contents of the register S are zero, and references the register CDRC when the contents of S are one.
CELL(CDRC)--Indicates transfers which take place as if the entire group of registers CELL were participating, but in which only the register CDRC is allowed to be updated.
NEW(CA) and REL(CA)--Indicate invocation of the obtain cell process NEW and the release cell process REL, which will be described subsequently.
FIG. 5 defines the process the garbage manager GM uses in response to a request from the list processor LP to add a reference to a cell. The list processor LP must supply a cell address, and may supply the cell contents. Step A1 checks whether cell contents have been supplied, and if not, the garbage manager GM will retrieve them from the memory system MEM. The reference counter is then identified and incremented in step A2. Step A3 checks for small counter overflow. If a previously small format cell's counter becomes larger than can be accommodated within the format, then cell expansion will take place as follows. The garbage manager GM obtains an additional cell from the free list via step A5, which step A6 uses to contain the CAR, CDR, and TAG of the original cell. Step A7 places into the original cell in memory the expanded count, a link to the new cell, and an appropriate tag. Step A8 saves the updated reference counter in memory in the case where cell expansion did not take place.
FIG. 6 defines the process of deleting a reference to a cell. In step B1 the old cell address register OCA is initialized to the value NIL. If in step B3 the cell is found to be not in the dynamic portion of memory, then no further processing of the cell is required, and the terminating step B4 is invoked. At step B4 the old cell address OCA is checked to see whether this deletion was the result of an original request, in which case the process terminates. If in step B3 the reference is to a cell in the dynamic portion of memory (i.e. not an atom), then the cell is retrieved and its counter decremented in step B5. In step B6 the counter portion of an expanded format cell is returned to memory, and expanded counters decrementing below the threshold of expansion cause the cell to be reformatted as a small counter cell, with one of the two cells of the expanded format being returned to the free list. If in step B7 the last remaining reference to the cell has not been deleted then the small format cell is stored in memory via step B8, otherwise the cell must be returned to the free list. Returning the cell to the free list requires deleting any references which the cell makes to other cells, a process handled entirely within the garbage manager GM. This recursive function is accomplished without a stack by using the cells being freed to store information which is local to each level of recursion. The CA register contains the address of the cell of current interest. If there was a previous cell, its address is in OCA. A still prior cell address is stored in the cell addressed by OCA. The S register is used to indicate which pointer within the current cell is being processed, the CAR or CDR. When a cell is to be freed, then S is set to zero in step B9, which selects the CAR. In step B10 an exchange is then performed in which the old cell address OCA is moved into CELL(S), the current cell address CA is moved to OCA, the former contents of CELL(S) are moved to CA, which will become the new cell address of interest, and the value of S itself is saved in the counter field of the current cell. The current cell is then stored back to memory so that the S and OCA values in it, as well as the CDR pointer, may be recalled when needed. The process of considering the current cell address in register CA as a deleted reference then begins again with step B3. When such process is finished, the value in register OCA is used to determine whether it was an initial deletion requested by the list processor LP which has finished, or whether it is a deletion that was invoked by the garbage manager GM. In the latter case, the OCA register is used in step B11 to retrieve the former cell of interest, whose contents are used to restore other necessary information that was saved earlier. Then S is incremented, and it selects the CDR of the current cell for deletion. When control is again returned to step B11, incrementing S reveals neither CAR or CDR to be selected, so the current cell is ready to be returned to the free list via step B12, and its handling is complete.
FIG. 7 defines how the garbage manager GM responds to requests from the list processor LP for cell storage and retrieval. On a retrieval function RET the cell contents are obtained from memory in step C1. If in step C2 the cell turns out to be in expanded format, then the second cell of the pair is also be retrieved, and the information it contains is passed back to the list processor LP. On a store function STO step D1 determines whether or not the cell is in expanded format by looking at the count value of the cell, which is always maintained to full precision in communications between the garbage manager GM and the list processor LP. If the cell is in expanded format, then the first member of the cell pair is retrieved in step D2 in order to obtain the address of the second cell of the pair, which is then used by step D3 to store the CAR, CDR, and TAG from the list processor.
FIG. 8 defines the processes of obtaining a cell from the free list, NEW, and of releasing a cell to the free list, REL. These processes may be invoked by the list processor LP by using the function codes for retrieval RTV and storage STR on the control function interface CFI1, or by other garbage manager GM processes. In the obtain cell process NEW, step E1 checks for possible free list exhaustion, and step E2 obtains the address of the first cell from the free list, putting that address in the cell address register CA for communication back to the invoking process. In the release process REL, the cell to be released is threaded on to the head of the free list by updating its pointers and updating the free list pointers as shown in step F1.
While correct logical function of the garbage manager GM is not dependent on any particular implementation of the memory subsystem, its efficiency is. As seen from the preceding process descriptions, the garbage manager generates additional memory references, many of which are store operations. References to the same cell are frequently close together in time. Therefore, if the memory subsystem uses a high speed cache buffer having the characteristic that every update operation is not written to main memory (i.e. main memory is updated only when the contents of that particular cache cell must be evacuated to hold another memory cell), then overall performance will be greatly improved.
The list processor LP exercises a great deal of control over the efficiency of the garbage manager GM by the frequency with which it requests addition and deletion of references. Whenever the list processor performs a modular operation over a list structure which is static for the duration of the operation, however complex that operation may be, the reference control requests may be deferred until the end of the operation. This results in the elimination of many intermediate reference control operations. For example, consider a list processing primitive which scans a list looking for a particular item. Each operation in updating a list scanning pointer to the next element in the list could be viewed as requiring one reference deletion and one reference addition. Alternately, knowing the structure of the operation being performed, it becomes necessary to perform only one reference addition (for the result at the end of the operation), and one deletion (for the initial argument structure, again performed at the end of the operation). To go even further, reference addition and deletion in the above example can be made the responsibility of whatever routine invoked this function, allowing that routine to also optimize its reference control operations.
A further efficiency consideration concerns the ability to determine whether a referenced memory item is a dynamically allocated cell, or a static entity such as an atom, by examining the pointer to the item. This may be done, for example, by partitioning the address space into static and dynamic portions as described above, which is particularly convenient in virtual memory or segmented memory systems. If such is the case, then addition and deletion of references to static items will not require additional memory references. If such is not the case, then the items will have to be retrieved and their tag fields examined even if they are static. Stack entries are considered static for this purpose.
The embodiment described above has the advantage that it easily interfaces with certain types of existing list processing systems. Those skilled in the art will recognize various alternate embodiments, some of which are more suitable for their purposes. Selected ones are briefly described below.
Dynamic expansion of reference counters could be emulated by list processing software running on a conventional data processor. This has been accomplished to verify the concepts and principles of the method of garbage collection set forth above. Software implementation also has a use in studying the behavior of the garbage manager for alternate configurations of reference counter size and expansion format.
The small counter format cell may be so structured that it has no space allocated for a reference counter in which case it is presumed to have the value one. When a reference to such a cell is deleted, then the cell is returned to the free list. When a reference is added, the cell must be expanded. The effectiveness of such small counters depends upon the observation that a majority of counters have the value one in many list processing applications, and upon the ability of a cache memory to handle temporary excursions above the value one without actually expanding and contracting the cell in memory. The cache might, for example, employ a third counter size chosen to handle most such excursions.
Using such a counter size, the reference counter method could be more easily adapted to a list processing system which does not have any bits reserved for garbage collection purposes. This includes some systems which use Baker's algorithm. A second principle advantage of a zero count system is that it allows all non-data bits, such as tags, to be moved out of the cell and into the reference (pointer) to the cell. In mark and sweep garbage collection this cannot be done because the cells are accessed during the sweep phase by a scan of memory independent of the pointers to the cell. In a normal reference counter system it cannot be done because the counter itself must be present. To remove all such non-data bits, fully encoding the tag in the pointers to the cell, has the advantage that the type of cell is known from the pointer without having to retrieve the cell, and the advantage that cell data content may use the full memory cell size. Standard 32 bit data formats could, for example, be used in a processor employing a common 32 bit memory width.
When a counter must be expanded, there are many ways of allocating the cell information among the two cells. In addition to just placing the information differently than in FIG. 3, the counter information may be distributed between the two cells. FIG. 9 shows an expansion in which an original cell OLDCELL is left completely unmodified by the expansion, and a new cell NEWCELL contains a new counter CTR2 of a the same size as the old counter CTR1. The added reference NEWREF is adjusted to point to the new cell NEWCELL. The pointers CAR1 and CDR1 of the new cell NEWCELL are copied from the original cell OLDCELL. In this way the link is from the new cell NEWCELL to the list structure BB and CC being referenced by the original cell OLDCELL, rather than between NEWCELL and OLDCELL. This distribution has the result that no reference is added to the original cell OLDCELL, and its reference counter CTR1 may remain at the same value. The new reference NEWREF is to the new cell NEWCELL. The new cell NEWCELL then adds new references to two other already existing cells BB and CC, whose reference counters must be incremented, and which may of course have to be expanded if their reference counters are already at maximum value. In the worst case the entire structure being referenced has all its reference counters at maximum value, and thus the entire structure is copied through individual expansions of each of its cells.
This distribution of counter information among several small counters has the advantage of maintaining a uniform cell format, and of eliminating the extra retrieve operations to get the second member of an expanded cell pair. Its disadvantage is that list processing software which employs list splicing techniques would need to be carefully examined to assure that it would produce the anticipated result.
Strategies may be mixed. For example, zero size counters may be maintained for dynamically allocated numeric quantities resulting from computation, while small counters of some other size are used for list cells containing pointer pairs. Any of the distribution schemes, or a mix in which some cells are expanded one way and some another, may be used with the various cell types.
The function of the garbage manager GM may be placed on the memory bus of a conventional data processor, in a manner similar to a memory module or peripheral controller. It may include its own memory, or re-direct references again on the bus to the system's memory. Since there are no dedicated signal paths for the reference control information, it would be communicated by some other means, as for example by storing a special code in a fixed address, or by accessing one of several fixed addresses. The "store immediate" instructions of some processors would be suitable for this purpose. Such an embodiment would allow efficient use of the invention in conjunction with a conventional processor.
The list processor and garbage manager may share data paths, functional units, and sequencers. This would require a close coupling of the two, but could produce an economic embodiment for purposes such as implementation of a list processor on a VLSI (Very Large Scale Integration) chip.
Where there are multiple processors and each has its own memory, each would also have its own garbage manager. The simplicity and determinacy of garbage management using the present invention would permit simpler processors and would make coordination among the processors easier. The immediate identification and reuse of garbage cells minimizes the amount of memory required for each processor.
Where there are memory modules separate from the processors, with some means of interconnecting the processors and the memories, a garbage manager could be included either with each processor, or with each memory module. In the case of including a garbage manager with each processor, some means would need to be provided to assure consistent results when two or more processors were updating elements of the same memory module. In the case of including a garbage manager with each memory module, interconnection traffic would be reduced (because expansions and second cell accesses are handled locally), and the problem of synchronizing multiple access would be somewhat reduced.
The above configurations avoid the problem typically encountered of having to scan the pointers of all other memory modules when looking for garbage within a particular module. This becomes more important as memories become larger and are partitioned into more modules to support parallel processing.
Garbage management in the manner prescribed by the invention is also compatible with methods of controlling the sharing of transient list structures, such as copying lists, or use of a forwarding table. The garbage manager may even be used to implement the operation of a forwarding table by merely marking the table entries as being in expanded format, and by providing some means to inhibit the de-expansion of table entries (which could be as simple as initializing each entry with a count exceeding the maximum small format counter value).
Those skilled in the art will recognize that many other embodiments may be found which use the basic principles of the invention.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
Description: Piyar Kiya tou Nibhana
KEHTA HAI PAL PAL TUM SE HO K DIL YE DEEWANA - Download MP3 music or MP4 video:
Watch Video OnlineDownload MP3 Download Video
Are you the owner of this convertable material and do you want to disable the conversion of your media on clip.dj? Then you can request a conversion block for this video.
verY gud sonG... just awesum.
for angel! Kehta hai pal pal tumse.
Subscribe our channel http://www.youtube.com/User/WaqasNasirMusic.
Song from major Sahab movie. Played on PSR - 550.
Song : Pyar Kiya To Nibhana Movie : Major Saab Singer : Udit Narayan, Anuradha Paudwal Star Cast : Ajay Devgn, Sonali Bendre Music Director : Anand Raj Anand...
Kehta Hai Pal Pal Tumse Ho Ke Dil Ye Deewana |Pyaar Kiya To Nibhana [ Major Saab 1998. Kehta hai pal pal tumse, hoke dil yeh divana - (2) Ek pal bhee jane ja...
Bollywood funny song.. Kehta hai pal pal tumse ho k dil yeh dewana...... Complete Lyric: Kehta Hai Pal Pal Tumse Ho Ke Dil Ye Deewana Kehta Hai Pal Pal Tumse...
Subscribe our channel http://www.youtube.com/User/WaqasNasirMusic.
Love is best jodi koro test, Love is better jodi dao Latter, Love is beautiful jodi hoy succesful,
tum mjh ko samajh jao, mai bhaag jaaun.
keheta hai pal pal remix song.......
Hey guys! clip.dj is an easy online tool to convert videos from YouTube, Dailymotion and Vimeo to high quality MP3 music or MP4 video files. Important: You must agree to our terms of service before using this web application! Have fun! ;)
How it works: Go to YouTube and find a video you want to download, copy its URL (like http://www.youtube.com/watch?v=MkviQTo67FM) into the text field at the top of this page and press "Go".
Check out the charts if you wanna know what's hot.
Drag the bookmarklet above to your browser toolbar, so you can download your MP3s and MP4s fast and comfortly by pressing on this bookmarklet whenever you're browsing YouTube.
Another awesome shortcut: whenever you're on YouTube just enter the two letters "xd" before the video URL and press enter: http://www.youtube.com/watch?v=MkviQTo67FM => http://www.xdyoutube.com/watch?v=MkviQTo67FM ;)

subset: commoncrawl


text:
Drag site icon to your taskbar to pin site.
Learn More
Motorcycle USA
Sport Bike
Street Bike
Dirt Bike
My Moto
Fantasy Racing
World Superbike
AMA Pro Racing
Flat Track
Off-Road Racing
Road Racing
Racing TV Listings
Share This Article:
Digg it!
Yahoo Buzz
MCSS Holeshot Recap Thunder Valley 2013
Tuesday, May 28, 2013
Email a Friend
Email Addresses (up to 5):
Personal Message:
Your Name:
Your Email Address:
Send me a copy of this email
* Indicates a required field
Email addresses will only be used to send this message. They will not be used for promotional purposes. See our
Privacy Policy
The points battle is officially underway in the
Holeshot Championship after the 2013 Lucas Oil Pro Motocross round at Thunder Valley. In the 450 class, Team Honda Muscle Milk's Justin Barcia got to the white line fastest in both motos while in the 250 class it was GEICO Honda's Zach Osborne in Moto 1 and MyPlash's Jeremy Martin in Moto 2.
Rules of the championship give one point to the rider that holeshots Moto 1 and two points in Moto 2. Should a rider take the holeshot in both motos, they're awarded a bonus point. The rider with the most points at the end of the season gets a sizable bonus. In the 450 class, the payout will be $25,000 and in the 250's the award is $15,000.
Barcia walked away with the full four points available for the round and is now tied for the lead with Yoshimura Suzuki's James Stewart.
"It's great to get both holeshots today," said Barcia. "My starts are something I've been working on a lot and the money that Motorcycle Superstore has put up gives me a lot of extra motivation to keep after it.
"I wish I could have converted those holeshots into wins today but I ended up third and fourth in the two motos for an overall finish of third place, so that's pretty decent. I'm definitely going to continue working on my starts because I want to win the holeshot title, and there are some other areas I need to work on also. I want some wins."
Osborne slipped outside the top-five soon after 250 Moto 1 started, but was able to hold on and finish sixth. He's tied for third overall in the Motorcycle Superstore Holeshot Championship with Monster Pro Circuit Kawasaki's Blake Baggett, who was fastest off the line in Moto 1 at Hangtown.
"You always want to get the holeshot because it sets up the rest of the race," Osborne said after Moto 1. "And now, with that money on the line, everyone is thinking about it that much more. Thanks to Motorcycle Superstore for putting that bonus in place.
"I felt really good in both motos today and the start in the first one was just perfect. I wanted to double-up and get the bonus point but it was really crowded up front. I'm still really happy with the way I rode overall so we'll take this momentum and go to Tennessee and try to keep it up."
Martin nabbed two points for his start in Moto 2 at Thunder Valley and is tied for the lead in the 250 class holeshot championship with Osborne's teammate, Zach Bell.
2012 Thunder Valley Motocross Gallery
AMA Motocross Racing News
Tomac Undefeated Heading to Thunder Valley
Glen Helen 450 Motocross Results 2015
Glen Helen 250 Motocross Results 2015
Canard's '15 Return Postponed, Noren to Fill In
Justin Bogle to Miss Glen Helen MX 2015
AMA Motocross News
AMA Motocross / Supercross Riders
Chad Reed
Learn everything you need to know about MX / SX champ Chad Reed. Check out Motorcycle USA's Chad Reed bio page for career highlights, pictures, and news.
James Stewart
A front runner from day one, James "Bubba" Stewart is one of the fastest supercross racers around. Check out Motorcycle USA's James Stewart bio for career highlights, full biography, interviews, and news.
Ryan Villopoto
Get to know supercross and motocross champion Ryan Villopoto in his full bio at Motorcycle-USA.com. Get full career highlights, a complete Villopoto bio, pictures, and the latest news.
Ryan Dungey
While still wet behind the ears Ryan Dungey, has managed to accomplish what many riders spend years chasing. Get to know Dungey in his full bio at Motorcycle-USA.com with career highlights, racer biography, pictures, and the latest news.
Trey Canard
Get to know Trey Canard in his full biography at Motorcycle-USA.com. Full career highlights, a complete Trey Canard racer bio, pictures, and the latest news.
View All Motocross Supercross Riders
Related AMA Motocross Articles
Thunder Valley 250 Motocross Results 2013
Thunder Valley 450 Motocross Results 2013
View all articles by
Byron Wilson
View all articles in
AMA Motocross 2013 News
Follow Byron Wilson on Google+
sign up
to comment.
Please Login to Post a Comment
User Name:
Remember Me
Forgot Your Password?
Create an Account
Close Window
You posted a comment, now share it on Facebook!
Motorcycle USA
Copyright 1996-2015 Motorcycle USA, LLC. All rights reserved.


text:
The past few weeks have been particularly difficult for outdoor training in Colorado – and much of the US. In Colorado Springs there was a stretch of about 7-10 days when the high temperatures never even reached 20 degrees, and the nights hovered around zero. While there were some folks who ventured out in such…Read the full article
Topic: Chris Carmichael
Holiday Survival Guide – Party Tips to Keep the Weight Off
What if I told you that you can wake up on January 1st without the spare tire you normally strap on during the Holidays? It's much harder to lose weight than it is to gain it, because you can burn off a few hundred more calories in an hour, but you can eat the…Read the full article
Weekend Reading: Can You Complete the 2013 CTS Thanksgiving Challenge?
With Thanksgiving coming up for those of us in the US next week, it's time once again for the CTS Thanksgiving Challenge! I did this last year as kind of an off-the-cuff challenge to keep myself motivated, and it was very exciting to see how many of you joined me. For the past few weeks…Read the full article
Weekend Reading: The Top 5 Articles You Should Read Now
One of my struggles at this time of year is finding blog topics that address the challenges and questions that athletes have right now. In the summer athletes are pursuing goals and improving their fitness and performance. In a few weeks we'll all be thinking about indoor training and the Holiday Season. And in January…Read the full article
Weekend Reading: Feeling Pura Vida After La Ruta!
"Pura Vida!" That's the phrase you hear over and over from kids and grownups as you either zip by or creep past them during La Ruta de los Conquistadores. It's a Costa Rican saying that literally means "pure life" but is used more as an expression of enjoying life and being happy. It's a perfect…Read the full article
Weekend Reading: Should Endurance Athletes Incorporate Strength Training?
This is the time of year when a lot of athletes start asking their CTS Coaches about strength training. Should they? Shouldn't they? Should they lift heavy or light? Free weights or machines? And what about Crossfit? The answers to the questions vary from athlete to athlete, but let me give you some guidelines I…Read the full article
Weekend Reading: 3 Reasons to Schedule a Challenging Event Every 3 Months
This week I was talking with one of the CTS Athletes who will be joining me for the La Ruta de los Conquistadores race in Costa Rica later this month. We were talking about his preparation and I mentioned that his performances in training and competitions have been remarkably consistent over the past 18 months….Read the full article
Weekend Reading: Why You Should Do Physiological Testing at the End of the Season
Everybody seems to understand the rationale for lab testing or field testing at the beginning of a training program, but I also think that testing at the end of a season can be extremely valuable. At the beginning of the season, the purpose of field testing was to get a snapshot of your fitness and…Read the full article
Weekend Reading: 3 Training Tips for Frequent Travelers
This week I had to shuffle my schedule in a way that many career professionals will find familiar. I was in Colorado Springs Monday and Tuesday, and then I traveled to Las Vegas, Nevada, for the Interbike show Wednesday through Friday. And while Interbike is all about bikes, I knew I wasn't going to get…Read the full article
4 Hurtful Habits that Are Killing Your Training
At a recent Gran Fondo I had a chance to talk with a lot of athletes. I love working one-on-one with the athletes I personally coach, but I also love getting out of Colorado Springs to ride and interact with athletes of all ability levels at events around the country. I talk to a…Read the full article


text:
Mon-Fri: 7am-1am EST / Sat-Sun: 7am-11pm EST
ApplianceMaytag Dishwasher
Level of DifficultyReally easy
Time to do repair15 - 30 mins
Age of Appliance1 - 4 years
Screw drivers
1 out of 1 people found this instruction helpful
Partially removed stainless inner part of door by removing 10 screws enabling simple removal of latch assembly. Put new assembly in its place and remounted inner stainless door in reverse order.
Help other customers find the most helpful instructions.
Were these instructions helpful?
Part Number: PS2180046
All brand logos are trademarks of their respective owners.
The PartSelect logo is a Registered Trademark of Atlantic Laundry Centres, Ltd.
Copyright © 1999-2015 , Eldis Group Partnership. All rights reserved.


text:
Pentax K20D Review
Not sure which camera lens to buy?
Visit SLRgear.com for
camera lens reviews, tests, specs and prices,
including pentax lenses!
Pentax K20D Design
Roll-over the various controls and features with your mouse for a brief description. Note: Rollovers are best viewed with the latest versions Firefox, Safari, or Opera browsers, or Internet Explorer 6 or earlier.
Front View. Most of the Pentax K20D controls are the same as the Pentax K10D.
The only difference here is the K20D badge and color of the shutter button (the K10D's was silver).
Left View. The left of the K20D reveals the new PC-Sync connector, for triggering studio strobes, etc.
Right View. The SD card door and is located on the right side.
Top View. All of the functions and controls are the same on the top deck.
Back View. The layout of the back is almost identical to the K10D, except for the larger LCD (2.7", up from 2.5"), and the labeling of the Shake Reduction switch.
Bottom View. No changes here, just a battery door, battery grip terminal cover and tripod mounting socket.
Pentax K20D
Your purchases support this site
Buy the Pentax K20D
|Print this Page
Note: For details, test results, and analysis of the many tests done with this camera, please click on the tabs at the beginning of the review or below.
1 $300 Adorama Gift Certificate
2 $200 Adorama Gift Certificate
3 $100 Adorama Gift Certificate


text:
Juventus are without Arturo Vidal, Giorgio Chiellini and Mirko Vucinic for their potentially historic game with Cagliari.
It kicks off on Sunday at 14.00 UK time (13.00 GMT), click here for a match preview.
The Bianconeri have already won the Scudetto and set a new Serie A record for points, but could become the first team ever in the Italian League to surpass 100 points.
Vidal is out following keyhole knee surgery and Vucinic is also sidelined, but Sebastian Giovinco is included despite a muscular problem.
Chiellini begins his three-match ban after he was caught on camera elbowing Roma's Miralem Pjanic.
Juventus squad for Cagliari: Buffon, Caceres, Ogbonna, Pogba, Pepe, Marchisio, Vucinic, Tevez, Giovinco, Peluso, Llorente, Barzagli, Osvaldo, Bonucci, Padoin, Pirlo, Asamoah, Lichtsteiner, Quagliarella, Storari, Isla, Rubinho
Think you know your Italian football? Share your knowledge, tips and comments to win cash prizes in OLBG's tipster competition - £11,000 to be won monthly!


text:
by DearSugar
Like us on Facebook
Though some women are unable to achieve an orgasm, others are blessed with the ability to have multiple. And while vaginal sex can sometimes provide enough stimulation, often direct clitoral contact is necessary. In other words, women are created differently, and of course, it follows suit that the definition of sexual satisfaction varies from woman to woman. We all have different preferences, too! So where do you stand when it comes to reaching sexual satisfaction without an orgasm? Is an orgasm the real culmination of a sexual experience? Or do you think it has more to do with arousal and intimacy?
Girl101 5 years
I usually reach the O but not always. He always does. Sometimes I am just tired and I want to get him satisfied so I can go to sleep. If that happens, he usually has some morning wood for me if I want it.
Mousuke 6 years
I'm not easy to orgasm, but my man knows how I operate and never fails to make me get off every time! So I've never experienced sex without orgasm. However, I only get off through vaginal intercourse (my clit does nothing for me), so going down on me is kinda pointless...
Rebecca14916991 6 years
mmm... I can get off either way. It depends on what we're doing as to which one I have and in what order. Dry hump? Clit. Quickie/fingering? Vaginal. Sex with me on top? Both! :P
Frank-y-Ava 6 years
My partner and I are still working on it. We kiss which really is good enough for me, I enjoy the stimulation and he enjoys the sex. Not crazy about the sex yet but practice makes perfect.
alexask 6 years
ok..i will. gosh you have to tell guys everything
darkangel2305 6 years
alexask if he's not doing it... ask for it ;)
alexask 6 years
awh man i have no idea what it's like to have those crazy panting orgasms. well i guess i just kind of started. i think foreplay is an important (missing) event in my sex life, despite him being older enough to know that
JaimeLeah526 6 years
I can definitely have a good time without orgasming. Sometimes I finish myself off after if I feel like I need to. Sometimes I just collapse in bliss cause it was so much fun.
smistasan 6 years
I think it's more about the intimacy and pleasing one another. I've had some great sex without having an orgasm, and sometimes it's just as satisfying to make sure he's thoroughly pleasured.
thelorax 6 years
Hate you all!!!!!! Haha j/k. I'm still working on it :-\
ahgerly 6 years
have to admit that me and my current boy are sexaholics but the thing is i dont cum that frequent and sometimes i will have to lie or even put up a "cum" show in order to please him :( well, i find his satisfaction is way more important than mine...so who cares~
caryatid 6 years
i'm reading BONK by Mary Roach, which is all about the study of sex, and apparently the distance between the vagina and the clit is indicative of whether or not you can orgasm from vaginal intercourse... look it up, it's interesting!
xoxoxx 6 years
I haven't orgasmed from vaginal intercourse, but the intimacy shared with Beau is more than enough for me. He's horrendously selfless though, and makes sure that I'm satisfied!
Emiily 6 years
I can cum vaginally and by rubbing my clit. I don't need clitoral stimulation to cum thank God. Sex is amazing all ways. I love it, I'm satisfied.
zombielove 6 years
foreplay gets me off more than the actual deed. im usually bored through sex. haha
DarlingDA 6 years
I can come quick when my bf goes down and me, and pretty quick during sex, but I have to use my hand. My boyfriend actually starts rubbing me if I'm not, because he likes to watch. Since it gets him going, it gets me going, and it ends well for both of us! Although sometimes we both get winded and have to stop for a water break.
CHUBSTAAA 6 years
LOL darkangel2305, I am the same way. I never experienced an orgasm prior to my current boyfriend. He rocks my socks! :P He makes sure I orgasm before himself almost everytime - teehee!
lauraxtc 6 years
When I was younger I had a hard time reaching an orgasm but now I can. Especially with my bf that I have been with for 6 years. He knows exactly what to do, and how to push me deeper against him. I need deep penetration and clitoris stimulation to reach an orgasm. It feels so good once I go. I feel so weak, its my only addiction. Reaching Climax. hehe.
darkangel2305 6 years
I am finally very sexually satisfied. I love sex with my current boyfriend. He literally rocks my world. He called me a hornball the other day because I always want it ;)
Sporky 6 years
I consider myself very lucky, it's never been a problem for me to orgasm during pretty much any kind of sex. I have to admit I have to try a bit harder since my hysterectomy, my libido has definitely dropped a bit, but that's a small price to pay for no more pain.
designerel 6 years
i'm one of those that needs clitoral stimulation to come. i wish so hard that i can come the other way but i just can't! but honestly, sex in general feels so good that orgasm is not that important to me.
simplyfab87 6 years
I more for arousal and intimacy. I've never had an orgasm, it kills my bf but I don't really care that much to have one. If i happens it happens but the sex is amazing either way.
Lovely_1 6 years
I dunno... Sometimes, when my bf and I are making out and have really passioniate sex I can come so easily! It just feels so good and so right. But when we have quickies...the rush, the feeling, the experiance...it makes me come quick with him too!


text:
Special Correspondent
RAMANATHAPURAM: C. Manickavasagam, Controller of Examinations, Alagappa University has stressed the need for a movement to popularise research culture among the students and others.
Delivering a convocation address at the Government College for Women here on Wednesday, he said the number of scholars who received doctorate in research in the country last year was low when compared to those received in the United States of America, China, Brazil and others. As many as 23,000 and 16,000 scholars received doctorate degrees in the USA and China respectively. However, just 4,000 scholars got doctorate degrees in research in India last year. It showed that the research had not got the due attention among students.
More In: TAMIL NADU | NATIONAL


text:
Your email has been sent.
Daybreak: Syria Continues Ramadan Attacks
Plus, Iron Dome redeployed, Obama backers shift Israel focus, and more in the news
• Syrian military forces brought tanks and snipers to Hama, killing 200 people this week. Secretary of State Hillary Clinton said the Syrian regime has been responsible for more than 2,000 deaths in the past five months. [JPost]
• The IDF has redeployed the Iron Dome missile defense system near Ashkelon in response to rocket fire into Israel that an IDF spokesperson attributed to Hamas. [Haaretz]
• Obama supporters are no longer highlighting diplomacy efforts in Israel, instead emphasizing the president's improvements to the military relationship between the U.S. and Israel. [Washington Jewish Week]
• Meanwhile, Obama's decision to set up an Atrocities Prevention Board and implement training programs to identify and prevent genocide won the president support from Jewish groups. [Jewish Journal]
• A NATO strike outside of Tripoli may or may not have killed Muammar Qaddafi's youngest son, Khamis Qaddafi, a Libyan military commander. [JPost]
• An Israeli-American photojournalist filed a complaint that the IDF fired tear gas canisters and gas grenades at him and another journalist while they covered a protest in the West Bank last week. [JPost]
• And, on a lighter note: in what is quite possibly the best thing on the internet, here is a series of pictures of rapper Drake hugging people. Team Drake! [Tumblr]
Sundown: Dem. Weprin Won't Endorse Obama
Plus, Palestinian injured in IDF airstrike, Kletzky suspect pleads not guilty, and more
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.


text:
1-Tap Clean Cache Pro
1,000 - 5,000 downloadsAdd this app to your lists
+ By NickyCho
1-click to clear all cache files and the best thing is you don't have to ROOT your phone.
★ Schedule auto clean cache.
★ Widget - One touch. Clears all your caches.
★ Your phone doesn't need root.
★ 1-click to clear all cache files.
★ List apps that have cache files.
★ Show the total cache size.
★ Show total and free storage size
Recent Change:
v1.0.5 Change app's icon
v1.0.6 Add auto clean cache function
v1.0.7 Change app's icon
v1.0.8 Support android1.6
v1.1.0 Change app's name
v1.1.1 App's widget name with a black background
v1.1.2 Fix some device can't clean all cache problem
v1.1.4 Show total and free storage size
v1.1.5 Fix auto clean cache function of some devices is not working.
Tags: 1 tap cleaner, 1tap clean cache, 1tap clean cache pro 1.1.5 apk, 1tap clean cache pro apk, 1tap clean cache pro, 1 tap clean cache pro, 1 tap clean cache, fast clean cache, 1tap clear pro per free ita, 1 tap cache cleaner pro.
Fix auto clean cache function of some devices is not working.
(27 stars)
Hangs on Htc one
(27 stars)
Neither the pro or free one will work on my galaxy s4, they shut down every time. Have reported the problem many times but they've had their money and obviously don't care that it doesn't work.
(27 stars)
Note 3
(27 stars)
Crashing on the HTC Desire 601 and on Samsung Galaxy S3 during the cache scan. This app hasn't been updated since 2011. The developer no longer cares about it. Uninstalling.
(27 stars)
Does not work!
(27 stars)
Ever since the software update, it forces close. I am using the free version which works now. I wish you fix the paid version soon. Thanks.
(27 stars)
I bought this app a few months ago. I set it for auto clean. Turns out it never cleaned anything. Uninstalling!


text: ""; ?> Rico Blanco guitar chords, guitar tabs and lyrics - chordie guitar tabs, guitar chords and lyrics Artists Songs Public booksPublic My songbookSongbook ResourcesDiv Forum Browse artists: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z # -first letter-A B C D E F G H I J K L M N O P Q R S T U V W X Y Z # All songs - change Chordie needs editors! Improve this page Rico Blanco MusicRico Blanco Songs There was no article about Rico Blanco in Wikipedia. If you know anything about Rico Blanco, please contribute to the free encyclopedia by writing an article. Rico Blanco Antukin (1) Ayuz (1) Bye Bye Na (1) Helpless (1) Magkayakap (1) Outta This (1) Para Hindi Ka Mawala (1) Say Forever (1) Sorry Kuya (1) Start Again (1) Unang Gabi (1) Your Universe (1) play their songs - buy their music - support the artists copyright © 2011 chordie guitar chords 5 popular songs Down On The Corner Creedence Clearwater Revival Yesterday Beatles Every Rose Has Its Thorn Poison Get Back! Beatles Bad Moon Rising Creedence Clearwater Revival


text:
Referendum 52 will appear on the November ballot. It raises 500 million dollars in bonds to retrofit schools and make them more energy efficient. The money would be paid out of the state's core budget -- the same budget that elected officials are strugging to balance. To help to pay for Referendum 52, the measure would also make the bottled water tax permanent. Proponents argue that making schools more energy efficient will save districts money and allow them to put more money into education instead of operating costs. Opponents say this is no time for the state to take on more debt. Tell us what you think. Will you vote to pass Referendum 52?
Join the Conversation
To find out more about Facebook commenting please read the Conversation Guidelines and FAQs
Referendum 52: $500 Million for School Energy Efficiency
Read or Share this story: http://www.king5.com/story/entertainment/television/programs/2014/07/30/12891914/


text:
When you visit to Zenkoji,...
Favorite thing: When you visit to Zenkoji, Nagano city, you should touch the Buddha 'Obinzuru-sama', then if you have some trouble on your body, it can get well soon! This guy takes it away from all of people.
'Obinzuru-mawasi' in January.
Visiting Obuse town,there is...
Favorite thing: Visiting Obuse town,
there is the place gathering about 10 museums, old Japanese style structures, and souvenir shops of the chestnut's sweets (home products). Thereby there are always many visitors. The reason why there are a lot of museums is that this town produced some artist Chinami Nakajima(Japanese painting?fs artist) etc. Hokusai (this pic's man) was effected for one person who live in Nagano, so he visited the person in his old term. Anyway, it's tasteful town.
Visiting the Temple on a foggy...
Favorite thing: Visiting the Temple on a foggy evening, after the tourists have left is worth more than words can say.
Fondest memory: The best memories I have involve the people of Nagano. They were polite and helpful and enthusiastic in a time that could have become extremely stressful. A good example of this was when I misjudged the time and walked into a hardware store well before opening hours. That the doors were not locked is an indication of how obedient the Japanese people are to rules and regulations - nobody would ever dream of entering beforehand. Not reading Japanese, I didn't notice the sign stating store hours. It did not help that I had just finished the night shift - I think it was 8pm-8am, and I was a little bit dazed and confused in addition to being very excited.
When I walked in, the Staff were all going through their daily loyalty ceremony, with the store manager orchestrating their oaths and their bows. When they realized that I was desperate for film so that I could take pictures at the opening ceremonies of the Olympics, they quickly dispatched one of their members to get the film and to specially open one of the cash registers so that I could pay. On my way out the entire staff of the store bowed me out with big smiles and surreptitious waves of the hand.
For me, this is a great example of the dichotomy that is Japan.
On the 6th January 2002:...
Favorite thing: On the 6th January 2002: Shizuka, j-san and kiwigal_1 met in Nagano!!
Fondest memory: Rhianon has a huge house, is an amazing cook and just the NICEST girl ever!! Thank you!! And I miss you!!! Love, Jitka.
Yes, Rhianon and Jitka look tired! They had just hiked back for several hours!! :p
Mongolzaluu's General Tip
Fondest memory: YAMANOUCHI TOWN
This place had interesting ofuro, public baths, that were really tiny and very hot!!
- 1
Show Prices
Show Prices
Show Prices
Show Prices
Instant Answers: Nagano
Get an instant answer from local experts and frequent travelers
- Save up to 50% off Hotels Everyday
- Expedia.com Photos, Reviews and the Guaranteed Lowest Prices
- Save money, Book now!
- Booking.com Excellent choice, Low rates
Sponsored Links


text:
Tallinn restaurant Marbella Club Grill
Gourmet dining from a wordclass Chef
Tallinn restaurant M.C Grill is situated in the Old Town of Tallinn, the Schlössle Hotel is delighted to be bringing a sophisticated twist to a traditional dining experience. Restaurant will appeal to the international hotel clientele and the cosmopolitan & business residents of Tallinn.
M.C Grill welcomes you with a roaring log fire, inviting guests to indulge in the warm, relaxed atmosphere any day of the week,whether celebrating with friends and family or impressing clients on a business dinner, or looking for the ideal venue for your festive activities.
It has all the components to match any luxurious European restaurant. The menu consists of enticing classic & contemporary dishes using quality seasonal ingredients.
M.C Grill opening hours:
Daily 12.00 – 23.00
M.C Grill address:
Pühavaimu 13/15, Tallinn Old Town
Phone: +372 699 77 80
Email: firstname.lastname@example.com
Events & Menus
Christmas Dinner Menu
Choose one of three special 5-course Christmas menu. Prices start from 60€ / per person.Learn more »
New Years Eve celebration in Schlössle restaurant
Delicious Temptation - We welcome you to enjoy New Year's Eve in classy and stylish atmosphere!Learn more »


text:
Ten-city tour starts tomorrow
Starting tomorrow, I'm in the 10 cities, below, doing the free green smoothie show! (As always, I'll magically post blog content from the road. I have lots of fun stuff coming up. A five-part series on nutrition for pregnancy, babies, and toddlers. A series on what your fingernails say about your health. And lots more.) […]5 Comments • Continue Reading →
What happens in Vegas . . .
So I'm here in Las Vegas, where I spent the weekend with my girlfriends. We did the grueling Angel's Landing hike at Zion's and had all kinds of fun in the sunshine including a lot of running outside, and trawling the outlet malls. So I've pretty much HAD IT with shopping, because my patience for […]1 Comment • Continue Reading →


text:
Victims of animal cruelty are often the hardest animals to place into a home. Shyness, fear and anxiety regularly plague these pets—and not all adopters feel up to the task. But those who do often discover that underneath the pain, there's an animal that is eager to love and be loved. Such was the case with Escher, a 55-lb. Shepherd/Collie mix with a mysterious past who proved that sometimes, the greatest hardship leads to the greatest reward. Here is his Happy Tail.
As a photographer for the ASPCA, Stacey Axelrod spends most days meeting with and photographing dogs and cats at the ASPCA Adoption Center. Though she has worked with hundreds of animals, she knew from her very first encounter with Escher that he was special. In February, Escher and five other dogs were rescued from an abandoned van in Brooklyn, New York. Hungry and freezing, all six dogs were suffering from some form of vision impairment, ranging from Entropion (an eyelid disease) to total blindness. They were all incredibly shy and fearful, and though we were unsure of how long they had been in the van, it was clear that it would take a lot of work to restore their faith in humans.
After meeting Escher, Stacey began visiting him at the Adoption Center every day. "I knew I wanted a dog who might have some trouble finding a home," she says, so she invited her fiancé Jon to come meet him, too. "At first, Escher would shy away when we tried to pet him," says Stacey. "He was scared of everything and I could tell he just needed someone to give him confidence." After spending some time with the timid pooch, she and Jon were sold. "I have no idea what he went through earlier in his life, but I just felt like he deserved the life I could give him."
At home, Stacey and Jon discovered the full extent of Escher's issues. "He was terrified of stairs and there are lots of stairs to get into my apartment building," she says. "I spent hours with him just sitting there and trying to coax him one step further." In addition to the stairs, Escher also exhibited an extreme fear of strangers, other dogs, and being left alone. Stacey did research on dog behavior and Positive Reinforcement Training, and slowly but surely, helped Escher become more comfortable.
"I remember the first time he laid down and rolled over next to me," Stacey recalls. "It was the first of many milestones and the first time I saw him truly relax. I never really wanted to nap on my kitchen floor, but I couldn't resist it that day. He allowed me to snuggle up next to him and everything changed after that. It was love at first belly rub."
As time went on, Escher continued to show signs of improvement. He tackled his fear of stairs, and he even mastered some tricks like sit, down, paw, and high five. "He's still learning typical dog behaviors," says Stacey, "but at some point, he realized that he could trust us and that he was here to stay. It was like something clicked. We celebrated the tiniest of changes, and now I can't believe how far he has come."
Though working with Escher has been a roller coaster of emotions, Stacey never once doubted her decision. "When I get discouraged, I just play some games with him and remember how amazing and goofy he is despite his fears," she says. "He's the perfect dog." And though she has spent a lot of time working with Escher, he has given her so much in return. "He has taught me so much about commitment, living in the present, and celebrating the small things. I never knew I could have such a strong mutual relationship with a dog until I got Escher."
Admittedly, the timid Escher is still gaining confidence, but his progress is undeniable. And from the cold February morning in an abandoned van to the warmth and love of Stacey and Jon's home, he has already come so far.
Three of the dogs rescued with Escher, Caitlyn, Dermott, and Brona, are still waiting for their forever homes. For more information about adopting these sweet dogs, please contact the ASPCA Adoption Center at (212) 876-7700 ext. 4120
She's not stereotyping. She's commenting that's he looks like a pit bull mix, which he does. So happy he ended up in a loving home!
Respectfully, the word "but" is what makes this a stereotype.
The first part of the statement is a positive one, but when you add on "but or "however" that is an indicator that what follows is a negative statement. She's not just describing the dog, she's saying that its apparent breed background is negative and negates the fact that the dog is beautiful.
If she meant to just describe the dog, the correct statement would be something like "He's beautiful. He looks like some kind of a pit-bull mix"
I'm also happy he's ended up in a good home
The word "but" means except and a perfectly good word to use to add a contrary opinion. Nothing wrong with being a pittie, but we don't have to be politically correct when using the word "but".
pitt bulls are the ultimate, don't comment until you have had one!!!!!!!!!!!!!!!!!
Thank you Corrie! You took the words right out of my head! I wish that "All stereotyping" would vanish from our lives!
To Escher's new Parents, I say Thank You! May the three of you be blessed for the rest of your lives! God sent two of His Angels to earth just to care, love, teach Escher how to be a Loving "Child"! So once again I say Thank You!
Yes, he is a pit-bull mix--SO WHAT? There are no bad dogs, only bad owners. Try to educate yourself.
Perhaps Donna was commenting on the fact that the article refers to this beautiful dog as a "shepherd/Collie mix". He does look more like a Pit Bull mix than a shepherd/collie mix.
After that story thats all you had to say. You should know as a pet lover how some people are breed specific haters
No hate here at all. Just a wish for a little more accuracy. Pit bull mixes are too often called something else. It can get a little silly. Collie or shepherd he's not. By calling a good dog a pit bull mix, you are actually helping the pit bull reputation. Be brave. Be accurate. On another note, this is going to be a super dog. I had a similar experience with a rescue. Nicest dog I ever had.


text:
|Popular | Random | Origins
DyerRate Dyer: Do you like this name?
Get creative with Dyer | Add to list (0)
Meaning and name origin
Dyer \d-yer\ as a boy's name is of Old English origin, and the meaning of Dyer is "one who dyes". Occupational name. Dexter refers to a female dyer. Author Wayne Dyer.
Dyer is not a popular first name for males but a very popular surname or last name for all people (#560 out of 88799) (2000 U.S. Census).
Displayed below is a comparison of the popularity of the boy name Dyer and related names. The only variation form ranked in the Top 1000/100 is Dexter. (2015 statistics).
Similar Names
Dyer is also pronounced similarly to Dar, Dor and Dwyer. Other suggested similar baby names are Deri, Dre, Drew and Myer. These names tend to be more commonly used than Dyer.
© 2015 Think Baby Names
Home - About - Terms - Privacy - Contact


text:
With an 88 ci fuel-injected engine and 6-speed transmission, this bike is in excellent condition. It features a quick-detach windshield, passenger backrest, and luggage... More
An 88 ci carbureted engine powers this very nice 5-speed bike. It features Flanders 6-Bend handlebars, Raptor Claw foot pegs and kickstand, forward controls,... More
A flathead straight-8 engine is paired with a manual 3-speed transmission to power this 4-door sedan. It features beige cloth bench seating, beautiful walnut... More
A 2.0L 4-cylinder engine is paired with a 5-speed manual transmission to power this well-maintained 2-door coupe. It features air conditioning and manual sunroof,... More
A ZZ454 V8 engine and TH400 3-speed automatic transmission power this beautiful 2-door pickup. It features power brakes and steering, an AM/FM radio with... More
This is a true Judge--the real deal, not a clone or a tribute! A 400 ci Ram Air III V8 engine and 3-speed automatic... More
Powered by a ZZ4 350 ci V8 engine with 400 hp and a Phoenix-built 700R4 4-speed automatic transmission, this freshly restored Nevada truck is... More
This fully restored 2-door coupe features a rebuilt 454 ci V8 engine, bored .30 over to a 468 high compression, as well as a... More
This all-original car runs and drives very well! It features a straight-6 engine, 3-speed manual transmission, "new" updraft carburetor, and manual brakes, as well... More
A 4-bbl 425 ci V8 engine and Turbo Hydra-matic transmission power this classy 2-door hardtop. Believed to be numbers-matching, it also features dual exhaust,... More
A 103 ci fuel-injected engine powers this 6-speed Road King, which also features ABS and HD nostalgic grips. This bike is well maintained and... More
A 5.7L V8 engine, paired with a 6-speed manual transmission, powers this convertible. It features leather bucket seating, air conditioning, and cruise control, as... More
With a 429 ci V8 engine with aluminum intake, 4bbl carb, and C6 3-speed automatic transmission, this resto-mod step-side pickup is in excellent condition! ... More
An 80 ci carbureted engine and 5-speed transmission powers this Anniversary bike. Number 142 of the 1,340 produced, it features chrome luggage rack and... More
A 1462 cc V-Twin engine with fuel-injection powers this 5-speed motorcycle. The bike is in very good condition, and features a chrome engine guard... More


text:
Average rating from 8 reviews.
Similar Products:
Average rating from 15 reviews.
Average rating from 6 reviews.
Average rating from 5 reviews.
Products We Are Testing:
Readers' Reviews add review
4 reviews
- Sort by:
- Most Helpful |
- Date
A much needed vitamin in dogs
posted 7 years ago
I ust this brand of Vitamin C for my 4 dogs as it is an essential vitamin for dogs and this is a low cost option. The 1,000 MG dose is a large pill that is easy for the dogs to pick out - I now crush them before putting them in.
Pros: High Milligrams
Cons: I have to crush them
4 of 4 people found this review helpful.
Did you?
Reliable Brand
posted 6 years ago
Anything from Costco (Kirkland Brand) gets my seal of approval. This is based on years of reading Consumer Reports. Each and every edition of the Consumer Reports Magazine consistently rates Kirkland Brand as just as good as the leading brand, or in the number 2 spot. To top it off, you can't beat the price. Also, anything from Costco is easy to return if you are not 100% satisfied. You just take it back and there are no questions asked.
I am sold on Costco and Kirkland Brand. I just wish that Kirkland made more products than they currently do.
Pros: Great Brand and Price
Cons: None that I can think of
0 of 0 people found this review helpful.
Did you?
Name and Quality I can trust when Purchasing Kirkland Products
posted 6 years ago
Anything I can get to help the immune system and promote animal health is important to me.
I trust in Kirkland Products, they are always a good value and work as represented.
Pros: Great Price, quality, Kirkland Products are a winner in my book
Cons: Pill is a little big, I mash it and add it to food
0 of 0 people found this review helpful.
Did you?
Want to review a product, but not finding it? Just add it and review it!
Recent Product Reviews
November 15, 2014 | By Robyn
July 14, 2013 | By Xiaoxiao111
Pink is my favorite color these are wonderful.I will recommend a good website fou you: www.9footballshirt.org
Freshpet Select Roasted Meals for Cat
June 28, 2013 | By Kittymom314
I introduced this food to my two cats, one is a senior at 13 years and the other is about 7 years. Both females. The 7 year old is a new addition, recently adopted :) Because of their age differenc… more ›


text:
Setting Data Migration Permissions
Use the Data Migration permissions page ( (PERMLIST_ADS) to set the security for migrating data.
PeopleTools> Security> Permissions and Roles> Permission Lists
Select the permission list to update.
Select the Data Migration tab.
Image: Data Migration Permissions page
This example illustrates the fields and controls on the Data Migration Permissions page. You can find definitions for the fields and controls later on this page.
The Data Migration page has links to the Access Group Permissions page, where you can define the records to which the user can have access in the Data Migration Workbench, and the Copy Compare Permissions page, where you can define the copy and compare operations that the user can perform.
Defining Access Group Permissions
Use the Permission List Access Groups page (SCRTY_ADS_ACC_GRPS) to define the query tree and access groups, as well as the read and write privileges.
Note: If the permission list grants full access to Upgrade, it is not necessary to include all of the access groups for a Copy from File. The access group security is always used when creating a data migration project.
Image: Permission List Access Groups Page
This example illustrates the fields and controls on the Permission List Access Groups Page. You can find definitions for the fields and controls later on this page.
Access groups are nodes in a query tree, which you build with Query Access Manager. After you build a query tree, you give users access to one or more of its access groups. Then, they can generate queries on any tables in the access groups accessible to them.
Data Migration Workbench uses the query trees defined in Query Access Manager (PeopleTools, Security, Query Access Manager).
Users who have access to Data Set Designer can create data set definitions for any records in the database, however in order to copy or compare the data set, the user must have permission to an access group that contains the records to be copied or compared.
To add an access group to a permission list:
Open the permission list and select the
Select a tree name.
Select the highest access group that the user can access.
The system displays access groups in the selected query tree only.
The access group that you select should be the highest-level tree group to which this permission list needs access.
Select the Read check box to grant the user access to the compare reports for this access group.
Note: Read access is enough for Copy to file and Compare operations.
Select the Write check box to grant the user access copy data for this access group from a file.
Note: Write access is required for Copy from file.
Save your changes.
Read Write Privileges
Permission Required
Copy to file
Copy from file
Compare from file
Defining Copy Compare Permissions
Use the Copy Compare Permissions page (SCRTY_ADS_PROFILES) to define the access permission for copying and comparing data migration projects.
Image: Copy Compare Permissions page
Copy Compare Permissions Page
Use this page to specify the copy and compare options available.
- Access
Select the appropriate access level. Options are:
Full Access: Enables user to copy and compare the data set.
No Access: User can not copy or compare the data set.
Read-Only: User can compare the data set.
- Allow setting Copy Compare attributes on data set definitions
The user can set the copy and compare options on the data set definition.
This privilege should only be given to architects with a thorough knowledge of the data set definition and its associated data content who would certify data set definitions to be copyable and comparable. A flawed data set definition could corrupt a data base. A partial list of considerations for the architect includes the following items to assess:
The validation rules expressed in the application class must be accurate and complete.
Records in the data set should represent a tightly coupled set of data.
Copying the data set must preserve dependency relationships.
No orphan rows should be created in copy or delete.
Consideration should be made of validation dependencies: if a dependent object is being copied from the source, it must be copied before the objects that depends on it.
Copy Compare Access
Copy to File
Copy from File
Compare from File
No Access
Read-Only Access
Full Access
Setting Upgrade Permissions
In order to copy from file, the user must have all of the appropriate permissions to the records in the file. To simplify this process, you can create a permission list that includes Full Access to Upgrade.
Full access to upgrade allows the user to copy any record without checking the specific authority to that record. Once you create a permission list with this access and assign it to a role, you should limit the number of users who are granted the role.
To assign Full Access to Upgrade:
Select the PeopleTools tab.
Select the Application Designer check box.
Select the Tools Permission link.
Select Full Access for Upgrade.
Click OK and the save the page.
Image: Tools Permissions page
This example illustrates the Tools Permissions page with Upgrade set to full access.