text:
|Publication number
|Publication type
|Application number
|Publication date
|Oct 17, 1995
|Filing date
|Jun 26, 1992
|Priority date
|Jun 26, 1992
|Fee status
|Publication number
|Ralph M. Begun, Paul W. Browne, Marc R. Faucher, Gerald L. Frank, Christopher M. Herring
|Original Assignee
|International Business Machines Corporation
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (10), Non-Patent Citations (4), Referenced by (127), Classifications (12), Legal Events (8)
|External Links: USPTO, USPTO Assignment, Espacenet
U.S. patent application Ser. No. 07/861,219, filed Mar. 31, 1992 by R. Bealkowski et al, for "SELECTABLE PROGRAMMABLE FIRMWARE STORE FOR A PERSONAL COMPUTER SYSTEM", and assigned to the assignee of this application, discloses a system which can be modified to incorporate the invention of this application.
In high speed personal computers, system performance may be limited in part by the execution time of CPU write cycles. This is especially apparent in systems employing error correcting code (ECC) memories. Overall system performance is affected to a large degree by the performance of its memory subsystem. A memory subsystem comprises two major elements, a memory controller and a main memory. A microprocessor or CPU, initiates bus cycles to the memory controller. These bus cycles can include both data read and data write requests. For CPU read cycles, the CPU must wait for data to return from the main memory before continuing execution. For write cycles, the CPU must wait for the memory system to complete writing data into memory.
Performance is limited in part by the time delay inherent in reading data from and writing data to the memory. This limitation becomes readily apparent with modern processors running at 50 Mhz and above. Some modern processors use integrated store-through caches in order to optimize performance. These caches can provide read data to the processing core of the microprocessor in an expeditious manner for read cycles. When this is done, write cycle performance tends to dominate and limit the overall system performance.
One prior art performance enhancement employed by some systems is a write buffer. A write buffer is a block of logic positioned between the processor and the memory system. The write buffer is capable of storing one or more complete processor write cycles. Processor write cycles include address, data, and control information. Write buffers operate by first capturing the cycle information in buffers and then signalling the microprocessor that the write cycle is complete. The write buffer then acts to complete the cycle to the remainder of the system. Write buffers enhance performance by signalling the microprocessor that the write cycle is complete sooner than would normally be possible. The write buffer then appears to the remainder of the system like the processor itself, and waits for the buffered cycle to complete. In the meantime, the microprocessor is free to complete further internal operations, which are possibly assisted by the internal cache as previously discussed.
Write buffers can include the capability to buffer more than one write cycle at any given time and thereby improve system performance in cases in which the microprocessor requires that several write cycles be completed before continuing to the next read operation. Write buffers, however, can only provide limited improvement to processor performance. Read cycles to main memory must be delayed until any write buffer contents are completely stored into main memory. Sequential write cycles, beyond the depth of any given write buffer, must also wait to complete until space becomes available in the write buffer. Consequently, systems employing write buffers may still be limited by the performance of write cycles.
Currently, error correcting code (ECC) memory subsystems are being introduced into personal computer systems. These memory subsystems use an error correcting code word that is stored along with required processor data. ECC memory subsystems improve system reliability by detecting and correcting single bit memory errors. The ECC code word is calculated on the basis of a selected atomic unit of data. In PS/2 personal computer systems, this code word is calculated on the basis of a 32-bit wide data word, and requires 7-bits for code storage. However, most personal computer software is written to operate on 8-bit or 16-bit processors. Consequently, even though many new systems employ 32-bit processors, a large number of read and write cycles occur as 8 or 16 bit operations. These cycles are referred to here as "partial write cycles", in that the size of the write data is less than the size (32 bits) of the minimum ECC memory atomic data unit. When the microprocessor executes a write of less than an atomic memory unit, the memory subsystem must execute a special read-modify-write (RMW) or partial write cycle.
During a RMW cycle, the CPU transmits bus definition signals along with the data to be written and the address where the data is to be written. Such bus definition signals indicate a write cycle for data having less than 32 bits. Thirty two bits of data along with ECC correction code are then read from the main memory at such address. The data (8, 16, or 24 bits) to be written is merged with old data read from the addressed location to form a new 32-bit word. A new 32 bit word correction code is calculated and the resultant new 32 bit word with code is written into main memory.
Such complex cycle is required in order to maintain relevant correction code storage information at each atomic memory address. In an ECC memory system, the wait time for write cycles becomes more pronounced when a partial write cycle occurs and the memory controller must execute both a main memory read and a main memory write for a single processor operation.
In summary, system performance in high speed personal computers is limited in large part by the speed at which write cycles occur into main memory. This limitation is more pronounced in systems employing ECC memory, whenever a large percentage of partial writes occur, since these partial write cycles are relatively lengthy cycles.
The invention takes advantage of the tendency of personal computer microprocessors, as viewed on the CPU local bus, to issue a large number of sequential write cycles to memory addresses that are closely associated. During the routine operation of personal computer systems, there are many situations in which multiple consecutive partial write cycles are made to sequential addresses. For example, in the situation of program subroutine entries, many program environment parameters must be stored (written into memory) so that they may later be recalled. These writes are typically stored in a specific area of memory reserved for this purpose. Another exemplary situation in which consecutive sequential write cycles occur is when data fields are saved, such as when a document or spreadsheet data is stored.
Programs that produce write cycles intended to run on 8-bit or 16-bit personal computer systems, can be executed on microprocessors of 32-bit or greater data width. The execution of such programs results in a large number of write cycles of 8-bit or 16-bit width occurring on the wider CPU local bus. When these cycles occur in an ECC memory subsystem, then they result in the previously described read-modify-write (partial write) memory operations.
In accordance with the invention, the execution of partial write cycles can be speeded up by compressing two consecutive write cycles to two different sub-units of any given atomic memory unit, into a single write access to that single atomic memory address. Any two such microprocessor accesses, as seen on the CPU local bus, that result in a single read-modify-write or single write access as seen at the DRAM memory, are said to be compressed. "Compression" refers to combining multiple bus operations on one bus into fewer bus operations on another bus, as opposed to the modification of specific data fields. For example, if a 16-bit write from the microprocessor is followed by another 16-bit write to the same address, the two write cycles can be compressed to form one 32-bit memory write. This turns two partial write cycles, which are two read-modify-write cycles (previously seen at the memory as two read and two write operations), into one read-modify-write cycle at the memory. Similarly, four 8-bit partial writes could be converted to as few as one 32-bit write.
In the preferred embodiment, the unit of atomic memory storage is 32-bits. The term `same address` is used here to mean any address that refers to a particular 32-bit storage location in memory. Each 32-bit location comprises four different bytes of data. These four different bytes of data could be accessed, for example, as four separate byte operations, or as a single double byte and two single byte operations, or as two separate double byte operations, or as a single 32-bit double word. Memory accesses as initiated by a microprocessor in the preferred embodiment are comprised of a 32-bit address field, a 32-bit data field, and a control field. This address field includes in part four byte enable lines. A byte refers to an 8-bit data field. When active, these byte enables indicate which of the four bytes on any given bus access are designated as active by the system microprocessor. One or more of these byte enables are active on any given cycle.
In a system employing ECC memory, assuming the memory controller is idle, a partial write cycle issued by the microprocessor results in a RMW cycle at the memory. The memory controller begins by initiating a read access to the required address. While this read cycle occurs, subsequent partial writes to the same address can be compressed, until such a time as the read portion of the RMW cycle is finished. This can change two 16-bit RMW cycles into one RMW cycle or four 8-bit RMW cycles into one RMW cycle.
One of the objects of the invention is to provide an improved write buffer for increasing the performance of a personal computer system.
Another object of the invention is to provide an improved write buffer which compresses plural write cycles as seen on CPU bus into a single memory cycle as seen on a memory bus.
A further object of the invention is to provide a high speed write cycle compression particularly suitable for an ECC memory system.
Briefly, in accordance with the invention, a write buffer is connected to a CPU bus and to a memory controller to provide write cycle compression in which plural partial write requests cause data, address and control information to be buffered. A signal is returned to the CPU for each request indicating the write is complete. The write buffer compresses plural requests to the same address into a single memory write operation containing merged data from the plural requests.
Other objects and advantages of the invention will be apparent from the following description taken in connection with the accompanying drawings wherein:
FIG. 1 is a schematic diagram of a data processing system embodying the invention;
FIG. 2 is a schematic view of a planar board included in the system shown in FIG. 1;
FIG. 3 is a schematic view of a processor card connectable to the planar board shown in FIG. 2;
FIG. 4 is a schematic block diagram of a write buffer with compression shown in FIG. 3;
FIG. 5 is a schematic block diagram similar to FIG. 4 illustrating an alternate form of write buffer;
FIG. 6 is a timing diagram showing an example of a double word write cycle buffer operation;
FIG. 7 is a timing diagram showing an example of a compression write buffer cycle; and
FIG. 8 is a timing diagram showing another example of a compression write buffer cycle.
Referring now to the drawings, and first to FIG. 1, a personal computer system 100 is substantially similar to the system disclosed in the above related application. System 100 comprises a system unit 102 having a suitable enclosure or casing 103, a monitor 104 (such as a conventional video display), a keyboard 110, an optional mouse 112, and an optional printer 114. Finally, system unit 102 may include one or more mass storage devices such as a diskette drive 108 and a hard disk drive (hardfile) 106.
Casing 103 houses a planar board 300 and a processor card 400 the details of which are shown in FIGS. 2 and 3. Planar board 300 comprises a printed circuit board (PCB) 301 upon which are mounted various components that are interconnected by wiring or circuits in the PCB. Such components include an electrical connector 302 into which an edge 416 of processor card 400 is plugged for removably mounting and electrically connecting processor card 400 to planar board 300. A plurality of single in-line memory module (SIMM) connectors 306 is also mounted on PCB 301 for connecting to memory banks 308A, 308B forming the system main memory or RAM. One or more I/O bus or expansion connectors 232 are also mounted on PCB 301 for connection to different expansion adapters and options that may be added or incorporated into personal computer system 100. For example, fixed disk drive 106 may be connected to an adapter card (not shown) having a disk controller which is connected to a connector 232.
Also mounted on planar board 300 are an interrupt controller 254 and a keyboard/mouse controller 244 which are connected to keyboard and mouse connectors 278 and 280, a diskette controller or adapter 246 connected to a diskette connector 282, and serial and parallel adapters 240, 238 connected to serial and parallel connectors 276, 274 which allow various I/O devices to be connected into the system. A system power connector 205 is mounted on PCB 301 for connection to a power unit (not shown) that supplies the necessary power for the system. A nonvolatile memory (NVRAM) 248 and a time-of-day clock/CMOS RAM 250 are also mounted on PCB 301. PCB 301 also has mounted thereon various oscillators (not shown) to provide timing signals, and buffers 342 (not all shown) to isolate sections of the circuitry in a manner well known.
The wiring of PCB 301 interconnects the various components as shown in the drawing and is grouped into three groupings, a memory bus 310 (including lines 324-338), a channel bus 312 (including an address bus 322, a data bus 320 and a control bus 318), and miscellaneous signal lines including interrupt lines 314, 316, all of which are connected to counterpart wiring on PCB 401 through the connectors 302, 416. Tapped off bus 312 is a planar function bus 319.
Referring to FIG. 3, processor card 400 comprises a printed circuit board (PCB) 401 having mounted thereon a plurality of components including a processor 202, a direct memory access (DMA) control unit 220, a Micro Channel control and buffer 414, a compression write buffer 410, a dual port memory control unit or controller 256, a firmware subsystem 242, and parity/ECC checking units 402, 404. Processor 202 preferably is a high performance type, such as an Intel 80486 microprocessor, having thirty-two bit data paths and providing thirty-two bit addressing capability. Of course, Intel 80386 and like processors can be used. The remaining components are selected in conventional fashion for their compatibility with such processor. All of the above components are electrically connected to each other as appropriate by printed wiring circuits in PCB 401 which terminate at edge connector 416. Edge connector 416 is normally plugged into edge connector 302 on planar board 300 shown in FIG. 2 so that planar board 300 and processor card 400 are electrically and mechanically interconnected and lie in planes oriented substantially perpendicularly to one another.
The wiring circuits of PCB 401 include a local or CPU bus 418 including data, address and control lines or busses 420, 422, 424, respectively, which interconnect processor 202 with firmware subsystem 242, local I/O ports 248, and write buffer 410. The remaining circuit lines generally include interrupt lines 316, system bus lines 434, memory controller bus lines 432 connected between buffer 410 and controller 256 and logic 402, 404, channel bus lines 312 and memory bus lines 310. Channel bus lines 312 include control, data and address bus lines 318, 320, 322, respectively. Memory bus lines 310 include multiplexed memory address lines 324, 332, row address strobe (RAS) lines 328, 336 for memory banks 308A, 308B, column address strobe (CAS) line 338, and data bus A and B lines 326 and 334. An oscillator 207 is connected as shown for providing suitable clock signals to computer system 100. For simplicity, certain miscellaneous lines, such as reset, grounds, power-on, etc. have been omitted from FIGS. 2 and 3. Also, the remaining elements shown in these figures operate in the manner described in the related application to which reference may be had for details thereof. It is to be noted that system 100 as described thus far is the same as that disclosed in the above related application except for compression write buffer 410.
The logic shown in FIGS. 2 and 3 supports either ECC or parity DRAM memory devices in SIMM sockets 308A, 308B. In ECC mode, memory cycles originate at processor 202 as data read or write requests. In the case of a read request, CPU 202 signals memory control unit 256 (via a fastpath in 410 described below) that a data read memory cycle is desired. Unit 256 then generates the appropriate DRAM control signals on 324, 332, 328, 336, and 338 to create the read of an atomic memory unit to appear on memory data bus 326 or 334 dependent on the address. The memory data on bus 334, for instance, contains 32-data bits and 7-ECC check bits. Unit 404 processes these 39-bits in a manner well known, such that it can present on the data portion of bus 432, thirty two valid data bits that have been checked against the original bus 334 data and had single bit errors (any one of bus 334) corrected. The data as corrected is then presented back to CPU 202 via bus 420.
In the case of a partial write cycle, CPU 202 originates a data write cycle of less that 32-bits. In such cycle, the valid data bytes are presented to circuits 402, 404 via bus 420 and buffer 410. The memory control unit 256 at this time recognizes that a partial write has been requested and initiates a RMW cycle. A full atomic unit is read into 402, 404. After checking and correcting as necessary the memory data from 326, 334, logic 402 or 404 merges the valid CPU bytes from bus 432 with the remaining valid memory data. Then logic 404 generates a new 7-bit check code and presents it on bus 334 along with the merged data. Unit 256 then generates the required DRAM control signals to write the full 39-bits into the DRAM.
Compression write buffer 410 has one side connected to local bus 418, while a second side is connected to memory control bus 432 whereby buffer 410 is connected between processor 202 and controller 256 by busses 418 and 432. Compression write buffer 410 contains a plurality of single write buffers 630, 631 (FIG. 5) which are identical so that only one need be described in detail. Referring to FIG. 4, a single write buffer BUFF0 comprises three primary latching buffers: an address buffer 501, a data buffer 503, and a control buffer 507. These three buffers are each of sufficient width to latch the local bus address, local bus data, and local bus control signals, respectively from local address bus 422, local data bus 420, and local control bus 424. The output or latched sides of these latching buffers are connected to first inputs of multiplexers (MUXes) 502, 505, and 509. A plurality of fastpath busses 422F, 42OF, 424F bypass buffers 501, 503, and 507 and are connected to second inputs of the multiplexers. The multiplexers have outputs connected to a buffer bus 523. The multiplexers select signals on either of the two input busses to be presented on their outputs, which selection is made in accordance with the status of a control signal on line 525. The selection of the bypass path is used to transmit the bus information rapidly over bus 523 to memory controller bus 432 on read cycles during which the write buffer latches are not used. During write cycles, the signal on line 525 is used to enable compression by connecting the buffers to the controller bus. The latching of buffers 501, 503, 507 is controlled by a latch control signal LATCH BUFF0 on line 520. A bus 529 is also connected to the outputs of address buffer 501 and supplies the address BUFF0 ADDR latched in buffer 510. Additionally a control line 524 is connected to data buffer 503 for transmitting thereto a control signal COMP BUFF0 which causes data in partial writes to be merged into data already in buffer 503 in accordance with byte enable signals CPUBE$ identifying the bytes to be merged.
FIG. 5 shows a block diagram of the full embodiment of compression write buffer 410. Two single write buffers 630 and 631, are connected in parallel to local bus 418 and to a MUX 634. Buffers 630 and 631 are also designated BUFF0 and BUFF1, each buffer being the same as BUFF0 of FIG. 4. Of course, any number N of individual buffers may be used. MUX 634 also has a control input connected to logic 629 by a line 625 for receiving a control signal defining which buffer is connected to bus 432. The output of MUX 634 is connected to memory control bus 432. The control signal on line 625 is operative to selectively connect either buffer 630 or buffer 631 to bus 432. Connecting buffers 630 and 631 in parallel allows each buffer to monitor the CPU bus. During compression, instructions do not have to be sequential. Any buffer can be compared to any other buffer in a parallel structure. Therefore, compression can take place on non-sequential writes.
A driver 645 has inputs connected to bus 432 and outputs connected to bus 418 to provide a path for outputs of the memory controller to be driven onto local bus 418. Remember that busses 418 and 432 are both bi-directional. Driver 645 has no specific write compression function. Driver 645 is operated under the control of logic 629 by a control signal transmitted on line 644.
A comparator (CMP) 633 is respectively connected to the latched address portions of buffers 630 and 631. In addition the comparator is connected to local address bus 422. The function of comparator 633 is to compare the current local address on 422 with the latched addresses in BUFF0 and BUFF1. The comparator then provides two outputs; MATCH 0 indicating a match between the local address and the latched BUFF0 address, and MATCH 1 indicating a match between the local address and the latched BUFF1 address. Such signals are supplied on lines 627 and 628 to control logic 629. Control logic 629 then determines if the current cycle can be merged with an existing buffered cycle, and if so, generates a COMP BUFF0 or COMP BUFF1 for merging data in the matching buffer. In the event of a non-match, control logic 629 also determines the overall sequence of cycle operation to the memory controller. Control logic 629 controls multiplexer 634 by a control signal on a tristate line 625 in order to present the correct cycle information on bus 432.
Logic 629 has a number of additional inputs and outputs connected to various lines upon which different signals are transmitted. Such lines and signals are as follows. Address lines 422 supply CPU address signals CPUADDR and CPU byte enable signals (CPUBE$). Control lines 424 carry control signals bidirectionally. Lines 520 and 623 respectively transmit a latch BUFF0 and a latch BUFF1 respectively to BUFF0 and BUFF1 respectively for controlling the latching thereof. Lines 525 and 620 respectively transmit COMPRESS BUFF0 and COMPRESS BUFF1 to buffers 630 and 631. Line 626 transmits control information between logic 629 and the memory controller by bus 432, including signals BADS$ and SRDY$.
A processor bus cycle is the basic way to transfer information either from the processor to the memory (a write cycle) or from the memory to the processor (read cycle). Since read cycles are not compressed, the remaining description is limited to write operations which are described with reference to the various timing diagrams and to FIG. 5. Many of the various signals are identified by signal names some of which have a suffix symbol $ that indicates such signal is active or asserted when the signal is at a low voltage. When no $ is present, the signal is asserted at a high voltage level.
FIGS. 6-8 illustrate three examples of different types of consecutive bus cycles and how the invention operates in conjunction therewith. Bus cycles are timed in accordance with processor clock periods defined by a clock signal CLK. Bus cycles are initiated in standard fashion by the assertion of an address status signal and end with the assertion of an acknowledgement signal. The type of cycle is determined by the bus definition signals and the byte enable signals. FIG. 6 shows the principal signals that occur when the processor initiates two successive, doubleword write operations during which buffering occurs but no compression takes place because doubleword write cycles are not partial write cycles. This example also assumes at the start that memory controller 256 is not busy and that both buffers 630 and 631 are idle or empty.
To start a local bus write cycle, processor 202 asserts address status signal CPUADS$ concurrently with asserting the address signals CPUADDR and CPUBE$ and standard bus definition signals (not shown) M/IO$, W/RS, and D/CS, on bus 418. Logic 629 is connected to local bus 418 as previously indicated and monitors the signals on the bus. In response to receiving and detecting the CPUADS$ signal in period 1, logic 629 determines from the bus definition signals that a memory write cycle has begun. The byte enable signals CPUMBE$ indicate which data bytes of the data bus are being transferred and thus define whether a cycle is a partial write cycle or a full write cycle. Since the example is a double word transfer, the CPUMBE$ are all "0"s. In period 2, the data CPUDATA to be written into memory is placed on bus 418 for two periods. The first double word data example is expressed in hexadecimal notation as "ABCD" and the second double word data example is "2345". Logic 629 further determines from the byte enable signals that a doubleword write operation is occurring and therefore no compression need be done. Logic 629 in response to detecting a write cycle asserts the LATCH BUFF0 control signal at the beginning of the second period causing the data signals from bus 418 to be latched in BUFF0. At the end of period 2, logic 629 then transmits an acknowledgement signal BUFFRDY$ over bus 424 to processor 202 to signal the processor that the first write cycle has been completed so far as the processor is concerned. As a result of having received such acknowledgement signal, the processor is then free to initiate another bus cycle which it immediately does by sending a second address status signal CPUADS$ at the start of period 4 to initiate a consecutive second local bus write cycle. During this second double word write operation, a double word "2345" is placed on the data bus along with the appropriate CPUBE$ signals. Since BUFF0 is busy at such time and BUFF1 is idle, logic 629 asserts a LBUFF1 signal to latch the second data item in BUFF1 and BUFFRDY$ is again asserted in period 6 to signify completion of the second local bus write cycle to the processor.
The preceding paragraph describes the sequence of signals between the processor and compression write buffer 410, and some of the signals used internally in the buffer. It should be noted that relative to the processor, a full word write cycle requires three clock periods. The following description describes the sequence of events and signals occurring between buffer 410 and memory controller 256. A memory controller bus cycle is initiated by a SADS$ signal and ends with a SRDY$ acknowledgement signal and is slower than a processor bus cycle and requires five clock periods for a non-partial (full) write cycle. In response to receiving the CPUADS$ signal in period 1, logic 629 asserts an address status signal BADS$ on one of control lines 626 along with related bus definition signals to initiate a double word write bus cycle to the controller. Line 625 is a tristate line and logic 629 asserts a first signal on line 625 to effectively connect BUFF0 to bus 432 through MUX 634 whereby the data signals in BUFF0 are placed on the data lines of bus 432 as the SDATA signals representing "ABCD" for three periods and the address signals in BUFF0 are placed on the address lines of bus 432 as SADDR and SBE$. In response to receiving the write request signals, controller 256 causes the data SDATA to be written into the memory at the address specified by SADDR. Controller 256 then asserts an acknowledgement signal SRDY$ in period 5 informing logic 629 of the completion of the memory writing operation. In period 6, logic 629 is then free to assert a second address status signal BADS$ and related signals causing controller to start the second double word write cycle. During the course of the second cycle, MUX 634 is switched by a control signal on line 625 to connect BUFF1 to bus 432 causing the SDATA, SADDR and SBE$ signals latched in BUFF1 to be placed on bus 432. Upon completion of the second write cycle, the controller then asserts the second SRDY$ signal in period 11.
The FASTPATH signal is driven active by logic 629 during periods 1 and 2 when comparator 633 is idle, and is driven inactive during period 3 after the LBUFF0 signal is activated. During the active FASTPATH periods, the SADDR/SBE$ signals are propagated with minimal delay from bus 418 through BUFF0 (BUFF1) onto bus 523 and then onto bus 432. This allows memory control unit 256 to get the earliest possible indication of the current bus cycle as issued by CPU 202. FASTPATH is driven inactive in period 3. During the inactive periods, the signals sent to the controller eminate from the data, address, and control buffers in BUFF0 and from logic 629. FASTPATH is switched back to the active state at period 12, the clock period after memory controller 256 has indicated the completion of the last buffered cycle via SRDY$.
FIG. 7 illustrates an example of two successive partial write cycles to the same memory address ADDR1, with cycle compression. Assume at the start the buffers are empty and the controller is not busy. A first partial write cycle is initiated by the processor asserting the CPUADS$, CPUADDR and CPUBE$ signals in period 1 followed by CPUDATA in period 2. The data to be written into memory by the first cycle is a single word "CD" at the low end of a double word data bus where the high word is represented as "XX". That is, relative to the data bus, the single word is transferred as "XXCD". The byte enable signals "1100" identify which bytes are active and to be written wherein a "0" identifies an active byte and a "1" identifies an inactive byte. In response to detecting the bus cycle being initiated is a write cycle, a latch signal LBUFF0 is asserted in period 2 causing the signals on bus 418 to be latched in BUFF0, and the BUFFRDY$ signal is asserted in period 3 freeing the processor to initiate another cycle which it does by asserting CPUADS$ CPUADDR and CPUBE$ in period 4 and CPUDATA in period 5. A BADS$ signal is sent in period 1 causing the controller to start a partial write bus cycle.
In response to determining from the byte enable signals that the write cycle being commenced is a partial write cycle, logic 629 asserts a valid compression window signal COMP WINDOW to enable compression to take place on subsequent cycles. As indicated previously, a partial write operation causes the memory controller to perform a read-modify-write (RMW) cycle and the read portion is initiated during the first period (period 2) of the valid compression window. A RMW requires three events, the first to read, the second to modify and the third to write. The latched data and byte enable signals are asserted on bus 432 during periods 2-4. At the start of period 4, the second partial write cycle to the same address ADDR1 is initiated by the processor and in response to recognizing that compression can occur, a control signal COMP BUFF0 is asserted in period 5 concurrently with assertion of the second set of CPUDATA and CPUBE$ signals whereby the second word "ABXX" is merged in BUFF0 with the previous word to form a double word "ABCD". The byte enable signals are also merged or changed to "0000" to reflect the byte status of the latched data. A SRDY$ signal is asserted in period 10 upon completion of the compression write cycle. The first cycle ends relative to the processor in the same fashion as the buffered write in FIG. 6, i.e., using BUFFRDY$ in period 3. Controller 629 uses the second CPUADS$ signal during period 4 to start the second cycle which gets compressed into the first. Since the second CPUADS$ signal is seen active by the controller 629 at the same time that COMP WINDOW is active, control logic 629 is able to compress the two cycles providing the addresses match. Note that the COMP WINDOW signal occurs normally during the read portion of a partial write cycle. While such read portion is in progress, controller 256 allows write data and byte enable signals to change, into the new compressed values. The COMP BUFF0 signal is generated in response to comparator 633 detecting that the address signals in the second cycle are to the same address as is latched in the address buffer of BUFF0 and generating a MATCH 0 signal as previously described.
FIG. 8 provides an example of successive cycles where the first is a full write cycle followed by three consecutive partial writes to the same address, the three partial writes being compressed into one memory write operation. The partial writes are for a single word "AB" and then for different bytes "C" and "D". The double word write operation occurs as described previously relative to the example of FIG. 6. The control signal on line 625 connects BUFF0 to bus 432 and the word is written in memory whereupon the controller returns the acknowledge signal SRDY$ in period 6. The processor initiates the first partial write cycle in period 4 and because BUFF0 is busy, a LBUFF1 signal is asserted in period 5 causing "ABXX" to be latched in BUFF1. The remaining partial write cycles are initiated in periods 7 and 10 by the CPUADS$ signals. In period 8, a COMP BUFF1 signal is asserted causing byte "C" to be merged in BUFF1 with "ABXX" therein to form "ABCX".
In period 6, an acknowledgement signal SRDY$ is received allowing logic 629 to send a BADS$ signal to the controller in period 7 to initiate a second partial write cycle that corresponds to the CPUADS$ in period 4, during which 625 is switched to connect BUFF1 to bus 432 and place "ABCX" on the bus. However, before that cycle can be completed, the third partial write is initiated to the same address for byte "D" and the write portion of the RMW cycle is further modified as a result of the COMP BUFF1 signal. In period 10, a second COMP BUFF1 signal is asserted causing byte "D" to be merged in BUFF1 to form double word "ABCD" therein. This double word is placed on bus 432 in cycle 11 and the controller then writes it into memory and sends a SRDY$ at the end. Thus, the three partial write cycles are compressed into a single, double word memory write cycle.
The invention may be embodied in a VLSI device that includes 410, 256, 402, 404, 220 and 414. Such integration allows greater flexibility in the type of signals passed between 410 and 256 particularly as such signals relates to the COMP WINDOW signal. In the invention, the COMP WINDOW signal goes active a) during the read portion of a RMW cycle (ECC only), b) during periods when one of the buffers (BUFF0 or BUFF1) is busy with a write cycle to controller 256 while the non-busy buffer is available for compression (ECC or parity memory mode), and c) during periods when a dual port memory controller 256 is busy servicing the non-CPU port (bus 434) (ECC or parity memory mode).
It should be apparent to those skilled in the art that many changes can be made in the details and arrangements of steps and parts without departing from the scope of the Invention as defined in the appended claims.
|Cited Patent
|Filing date
|Publication date
|Sep 27, 1979
|Sep 1, 1981
|Communications Satellite Corporation
|Interleaved TDMA terrestrial interface buffer
|Apr 5, 1985
|May 3, 1988
|Tektronix, Inc.
|Variable access frame buffer memory
|May 5, 1986
|Feb 14, 1989
|Mips Computer Systems, Inc.
|Write buffer
|Feb 22, 1988
|Feb 27, 1990
|International Business Machines Corporation
|Functional cache memory chip architecture for improved cache access
|Mar 29, 1991
|Aug 10, 1993
|Micron Technology, Inc.
|Memory array write addressing circuit for simultaneously addressing selected adjacent memory cells
|Sep 14, 1990
|Aug 10, 1993
|Digital Equipment Corporation
|Method and apparatus for reducing buffer storage in a read-modify-write operation
|Sep 27, 1990
|Oct 18, 1994
|Dell U.S.A., L.P.
|Apparatus for queing and storing data writes into valid word patterns
|Title not available
|Title not available
|Title not available
|L. Johnson et al, "Improved Video RAM Read Transfer Cycle", IBM TDB Jun. 1991, pp. 479-480.
|L. Johnson et al, Improved Video RAM Read Transfer Cycle , IBM TDB Jun. 1991, pp. 479 480.
|R. J. Bowater et al, "Techniques for Dynamic RAM Bandwidth Utilization", IBM TDB Dec. 1984, pp. 4544-4545.
|R. J. Bowater et al, Techniques for Dynamic RAM Bandwidth Utilization , IBM TDB Dec. 1984, pp. 4544 4545.
|Citing Patent
|Filing date
|Publication date
|May 11, 1994
|Nov 12, 1996
|International Business Machines Corporation
|Data storage system and method for operating a disk controller including allocating disk space for compressed data
|Jul 22, 1994
|Jan 7, 1997
|Dell Usa, L.P.
|Store queue including a byte order tracking mechanism for maintaining data coherency
|May 3, 1995
|Apr 29, 1997
|Apple Computer, Inc.
|Method and apparatus for presenting an access request from a computer system bus to a system resource with reduced latency
|Jun 7, 1995
|Jun 17, 1997
|Fujitsu Limited
|Transferring digital data in units of 2 bytes to increase utilization of a 2-byte-wide bus
|Aug 17, 1995
|Sep 2, 1997
|Institute For The Development Of Emerging Architectures L.L.C.
|Cache arrangement including coalescing buffer queue for non-cacheable data
|Mar 3, 1995
|Nov 11, 1997
|Hal Computer Systems, Inc.
|Merging data using a merge code from a look-up table and performing ECC generation on the merged data
|Feb 7, 1997
|Apr 21, 1998
|Kabushiki Kaisha Toshiba
|High-performance computer system of a parallel write-buffering type
|Jan 23, 1996
|Aug 18, 1998
|Digital Equipment Corporation
|Temporary storage having entries smaller than memory bus
|Dec 27, 1995
|Sep 15, 1998
|Intel Corporaiton
|Method and apparatus for combining multiple writes to a memory resource utilizing a write buffer
|Jun 13, 1996
|Sep 15, 1998
|Compaq Computer Corporation
|Performing a write cycle to memory in a multi-processor system
|May 28, 1996
|Nov 10, 1998
|Advanced Micro Devices, Inc.
|Method and apparatus for optimization of data writes
|Jun 28, 1996
|Jan 12, 1999
|Symbios, Inc.
|Method and apparatus for efficient management of non-aligned I/O write request in high bandwidth raid applications
|Apr 14, 1997
|Apr 13, 1999
|International Business Machines Corporation
|Method and system for back-end gathering of store instructions within a data-processing system
|Dec 16, 1997
|Nov 9, 1999
|Ricoh Company Ltd.
|Image processing device
|Mar 31, 1997
|Jun 6, 2000
|Ark Research Corporation
|Data storage controller providing multiple hosts with access to multiple storage subsystems
|Jun 13, 1996
|Mar 20, 2001
|Compaq Computer Corporation
|Memory coherency in a processor-to-bus cycle in a multi-processor system
|Oct 30, 1998
|Apr 24, 2001
|Telefonaktiebolaget Lm Ericsson (Publ)
|Reducing read cycle of memory read request for data to be partially modified by a pending write request
|Mar 5, 1998
|May 15, 2001
|Micron Technology, Inc.
|Multi-port memory device with multiple modes of operation and improved expansion characteristics
|Jun 3, 1998
|Aug 21, 2001
|Compaq Computer Corporation
|Computer system with improved memory access
|Nov 13, 1998
|Aug 13, 2002
|Intel Corporation
|System for combining requests associated with one or more memory locations that are collectively associated with a single cache line to furnish a single memory operation
|Dec 9, 1997
|Aug 20, 2002
|Intel Corporation
|Method and apparatus for collapsing writebacks to a memory for resource efficiency
|Dec 29, 1999
|Apr 15, 2003
|Intel Corporation
|System and method for increasing the efficiency and reliability of the storage of sequential data
|Jan 9, 2001
|Sep 23, 2003
|Micron Technology, Inc.
|Multi-port memory device with multiple modes of operation and improved expansion characteristics
|Dec 28, 1999
|Oct 7, 2003
|Intel Corporation
|Optimizations to receive packet status from fifo bus
|Nov 30, 1998
|Jun 8, 2004
|International Business Machines Corporation
|Method and apparatus for managing memory operations in a data processing system using a store buffer
|Aug 5, 2002
|Mar 15, 2005
|Intel Corporation
|Software controlled content addressable memory in a general purpose execution datapath
|Dec 3, 2003
|Apr 5, 2005
|Intel Corporation
|Scratchpad memory
|Sep 16, 2003
|May 17, 2005
|Intel Corporation
|Bus interface with a first-in-first-out memory
|Jan 17, 2002
|Aug 23, 2005
|Intel Corporation
|Parallel processor with functional pipeline providing programming engines by supporting multiple contexts and critical section
|Sep 22, 2004
|Aug 30, 2005
|Via Technologies, Inc.
|Memory control device and method
|Jan 10, 2003
|Sep 6, 2005
|Intel Corporation
|Memory interleaving
|Aug 26, 2003
|Sep 27, 2005
|Micron Technology, Inc.
|Multi-port memory device with multiple modes of operation and improved expansion characteristics
|Dec 30, 1999
|Dec 13, 2005
|Intel Corporation
|Port blocking technique for maintaining receive packet ordering for a multiple ethernet port switch
|Aug 31, 1999
|Jan 3, 2006
|Intel Corporation
|SDRAM controller for parallel processor architecture
|Dec 29, 1999
|Mar 14, 2006
|Intel Corporation
|Intelligent display interface
|Dec 21, 2000
|Mar 28, 2006
|Intel Corporation
|Breakpoint method for parallel hardware threads in multithreaded processor
|Dec 17, 2001
|Sep 12, 2006
|Intel Corporation
|Write queue descriptor count instruction for high speed queuing
|Jul 8, 2003
|Sep 19, 2006
|Intel Corporation
|Thread signaling in multi-threaded processor
|Sep 28, 2001
|Oct 24, 2006
|Intel Corporation
|Multiprotocol decapsulation/encapsulation control structure and packet protocol conversion method
|Feb 1, 2002
|Dec 12, 2006
|Intel Corporation
|Processing data packets
|Dec 12, 2001
|Jan 2, 2007
|Intel Corporation
|Queue management
|Jan 7, 2002
|Feb 20, 2007
|Intel Corporation
|Queue array caching in network devices
|Jan 25, 2002
|Feb 20, 2007
|Intel Corporation
|Context pipelines
|Aug 31, 2000
|Mar 13, 2007
|Intel Corporation
|Double shift instruction for micro engine used in multithreaded parallel processor architecture
|Aug 19, 2003
|Mar 13, 2007
|Intel Corporation
|Microengine for parallel processor architecture
|Mar 21, 2002
|Apr 3, 2007
|Network Appliance, Inc.
|Method for writing contiguous arrays of stripes in a RAID storage system using mapped block writes
|Sep 26, 2002
|Apr 17, 2007
|Lsi Logic Corporation
|Multi-port memory controller having independent ECC encoders
|Dec 30, 2003
|May 1, 2007
|Intel Corporation
|Method and apparatus utilizing non-uniformly distributed DRAM configurations and to detect in-range memory address matches
|Aug 5, 2002
|May 8, 2007
|Intel Corporation
|Mechanism for providing early coherency detection to enable high performance memory updates in a latency sensitive multithreaded environment
|Aug 5, 2002
|May 29, 2007
|Intel Corporation
|Multiprocessor infrastructure for providing flexible bandwidth allocation via multiple instantiations of separate data buses, control buses and support mechanisms
|Jan 25, 2005
|Jul 17, 2007
|Intel Corporation
|Software controlled content addressable memory in a general purpose execution datapath
|Dec 18, 2001
|Sep 11, 2007
|Intel Corporation
|Control mechanisms for enqueue and dequeue operations in a pipelined network processor
|Mar 29, 2005
|Nov 27, 2007
|Intel Corporation
|Processing packet sequence using same function set pipelined multiple threads spanning over multiple processing engines and having exclusive data access
|Feb 10, 2004
|Dec 4, 2007
|Intel Corporation
|Sram controller for parallel processor architecture including a read queue and an order queue for handling requests
|Sep 1, 2004
|Feb 5, 2008
|Intel Corporation
|Communication between processors
|Aug 13, 2002
|Feb 26, 2008
|Intel Corporation
|Free list and ring data structure management
|Sep 12, 2002
|Apr 1, 2008
|Intel Corporation
|Multiple calendar schedule reservation structure and method
|Apr 22, 2005
|Aug 26, 2008
|Intel Corporation
|Memory interleaving
|Aug 31, 2000
|Sep 2, 2008
|Intel Corporation
|Branch instruction for processor with branching dependent on a specified bit in a register
|Sep 21, 2005
|Sep 9, 2008
|Intel Corporation
|Memory controller for processor having multiple multithreaded programmable units
|Nov 5, 2002
|Oct 7, 2008
|Intel Corporation
|Flow control in a network environment
|Sep 28, 2005
|Oct 7, 2008
|Intel Corporation
|Multi-threaded sequenced receive for fast network port stream of packets
|Apr 3, 2002
|Oct 14, 2008
|Intel Corporation
|Registers for data transfers
|Jun 16, 2003
|Oct 28, 2008
|Intel Corporation
|Processing a data packet
|Jun 18, 2002
|Dec 30, 2008
|Intel Corporation
|Scheduling system for transmission of cells to ATM virtual circuits and DSL ports
|Nov 10, 2000
|Jan 20, 2009
|Intel Corporation
|Multi-threaded round-robin receive for fast network port
|Aug 5, 2002
|Feb 3, 2009
|Intel Corporation
|Multithreaded microprocessor with register allocation based on number of active threads
|Sep 28, 2006
|Apr 7, 2009
|Nec Electronics Corporation
|Memory controller
|Aug 31, 2000
|Jun 9, 2009
|Intel Corporation
|Register set used in multithreaded parallel processor architecture
|Jun 30, 2005
|Jul 7, 2009
|Intel Corporation
|Automatic detection of micro-tile enabled memory
|Jun 23, 2005
|Sep 8, 2009
|Intel Corporation
|Mechanism for assembling memory access requests while speculatively returning data
|Jan 25, 2002
|Oct 27, 2009
|Intel Corporation
|Data transfer mechanism using unidirectional pull bus and push bus
|Dec 28, 1999
|Nov 17, 2009
|Intel Corporation
|Providing real-time control data for a network processor
|Jan 12, 2001
|Mar 16, 2010
|Intel Corporation
|Method and apparatus for providing large register address space while maximizing cycletime performance for a multi-threaded register file set
|Jun 6, 2007
|Jun 22, 2010
|Intel Corporation
|Processor having a dedicated hash unit integrated within
|Oct 10, 2003
|Jul 6, 2010
|Intel Corporation
|Method and apparatus for gigabit packet assignment for multithreaded packet processing
|Jun 23, 2005
|Jul 27, 2010
|Intel Corporation
|Memory micro-tiling
|Jan 4, 2002
|Feb 22, 2011
|Intel Corporation
|Queue arrays in network devices
|Feb 22, 2007
|Apr 19, 2011
|Netapp, Inc.
|Method for writing contiguous arrays of stripes in a RAID storage system using mapped block writes
|Oct 7, 2008
|May 17, 2011
|Yamaha Corporation
|Data transmission apparatus efficiently using network resources
|Apr 2, 2004
|Jul 12, 2011
|Netapp, Inc.
|Method for writing contiguous arrays of stripes in a RAID storage system
|Jun 3, 2009
|Aug 2, 2011
|Intel Corporation
|Register set used in multithreaded parallel processor architecture
|Jan 20, 2010
|Aug 30, 2011
|Intel Corporation
|Memory micro-tiling
|Apr 26, 2007
|Apr 10, 2012
|Agere Systems Inc.
|Memory device with error correction capability and efficient partial word write operation
|Jun 30, 2005
|Aug 28, 2012
|Intel Corporation
|Memory controller interface for micro-tiled memory access
|Sep 9, 2008
|Nov 20, 2012
|Intel Corporation
|Memory controllers for processor having multiple programmable units
|Jun 23, 2005
|Dec 11, 2012
|Intel Corporation
|Memory micro-tiling request reordering
|Nov 8, 2010
|Feb 19, 2013
|Intel Corporation
|Queue arrays in network devices
|Oct 5, 2010
|Dec 10, 2013
|Arm Limited
|Barrier transactions in interconnects
|Feb 17, 2004
|May 27, 2014
|Intel Corporation
|Memory mapping in a processor having multiple programmable units
|Oct 5, 2010
|Oct 7, 2014
|Arm Limited
|Reduced latency barrier transaction requests in interconnects
|Aug 17, 2012
|Oct 21, 2014
|Intel Corporation
|Memory controller interface for micro-tiled memory access
|Dec 28, 2006
|Nov 4, 2014
|Intel Corporation
|Accessing memory using multi-tiling
|Aug 12, 2011
|May 12, 2015
|Altera Corporation
|Systems and methods for providing memory controllers with memory access request merging capabilities
|May 23, 2014
|Sep 8, 2015
|Intel Corporation
|Memory mapping in a processor having multiple programmable units
|Jul 24, 2013
|Sep 29, 2015
|Arm Limited
|Performance of accesses from multiple processors to a same memory location
|Mar 19, 2001
|May 2, 2002
|Adiletta Matthew J.
|Register instructions for a multithreaded processor
|Jan 12, 2001
|May 9, 2002
|Gilbert Wolrich
|Method and apparatus for providing large register address space while maximizing cycletime performance for a multi-threaded register file set
|Aug 5, 2002
|Feb 27, 2003
|Rosenbluth Mark B.
|Mechanism for providing early coherency detection to enable high performance memory updates in a latency sensitive multithreaded environment
|Dec 18, 2001
|Jun 19, 2003
|Gilbert Wolrich
|Control mechanisms for enqueue and dequeue operations in a pipelined network processor
|Dec 17, 2001
|Jun 19, 2003
|Rosenbluth Mark B.
|Congestion management for high speed queuing
|Jan 7, 2002
|Jul 10, 2003
|Gilbert Wolrich
|Queue array caching in network devices
|Feb 1, 2002
|Aug 7, 2003
|Gilbert Wolrich
|Processing data packets
|Sep 26, 2002
|Apr 1, 2004
|Emerson Steven M.
|Multi-port memory controller having independent ECC encoders
|Jan 10, 2003
|Jul 15, 2004
|Gilbert Wolrich
|Memory interleaving
|Apr 2, 2004
|Oct 14, 2004
|Kleiman Steven R.
|Method for writing contiguous arrays of stripes in a RAID storage system
|Dec 21, 2000
|Oct 14, 2004
|Debra Bernstein
|Breakpoint for parallel hardware threads in multithreaded processor
|Sep 22, 2004
|Feb 17, 2005
|Chang Eric Yean-Liu
|Memory control device and method
|Jun 23, 2005
|Dec 28, 2006
|James Akiyama
|Memory micro-tiling
|Jun 23, 2005
|Dec 28, 2006
|James Akiyama
|Memory micro-tiling request reordering
|Jun 30, 2005
|Jan 4, 2007
|Douglas Gabel
|Automatic detection of micro-tile enabled memory
|Jun 30, 2005
|Jan 18, 2007
|Macwilliams Peter
|Memory controller interface for micro-tiled memory access
|Sep 28, 2006
|Mar 29, 2007
|Nec Electronics Corporation
|Memory controller
|Apr 14, 2011
|Arm Limited
|Barrier transactions in interconnects
|Jun 22, 2005
|Oct 19, 2010
|Intel Corporation
|Parallel multi-threaded processing
|Mar 6, 2002
|May 13, 2009
|Disk writing operation in a distributed shared disk system
|Jun 23, 2006
|May 19, 2010
|Memory micro-tiling speculative returns
|Jun 23, 2006
|Jun 16, 2010
|Memory micro-tiling request reordering
|Jun 23, 2006
|Mar 13, 2013
|Jun 30, 2006
|Dec 24, 2008
|Intel Corporation
|Micro-tile memory interface
|Jun 30, 2006
|Dec 24, 2008
|Intel Corporation
|Micro-tile memory interface
|Oct 9, 2013
|Apr 30, 2014
|Analog Devices, Inc.
|Memory arbitration circuit and method
|Mar 11, 1998
|Oct 8, 1998
|Ark Research Corp
|Data storage controller providing multiple hosts with access to multiple storage subsystems
|Jun 23, 2006
|Jan 4, 2007
|Intel Corp
|Memory micro-tiling speculative returns
|Jun 23, 2006
|Jan 4, 2007
|Intel Corp
|Memory micro-tiling
|Jun 23, 2006
|Jan 4, 2007
|Intel Corp
|Memory micro-tiling request reordering
|Apr 26, 2007
|Nov 6, 2008
|Agere Systems Inc
|Memory device with error correction capability and efficient partial word write operation
|U.S. Classification
|711/155, 711/167, 711/154, 710/68
|International Classification
|Cooperative Classification
|European Classification
|Jun 26, 1992
Owner name: INTERNATIONAL BUSINESS CORPORATION, NEW YORK
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNORS:BEGUN, RALPH M.;BROWNE, PAUL W.;FAUCHER, MARC R.;AND OTHERS;REEL/FRAME:006203/0566;SIGNING DATES FROM 19920619 TO 19920623
|Jan 4, 1999
|Fee payment
Year of fee payment: 4
|Dec 19, 2002
|Fee payment
Year of fee payment: 8
|Apr 20, 2005
|Aug 4, 2005
Owner name: LENOVO (SINGAPORE) PTE LTD.,SINGAPORE
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTERNATIONAL BUSINESS MACHINES CORPORATION;REEL/FRAME:016891/0507
Effective date: 20050520
|May 2, 2007
|Maintenance fee reminder mailed
|Oct 17, 2007
|Lapse for failure to pay maintenance fees
|Dec 4, 2007
|Expired due to failure to pay maintenance fee
Effective date: 20071017


text:
Find a copy in the library
Finding libraries that hold this item...
|Named Person:
|Edward Schillebeeckx; Edward Schillebeeckx; Edward Schillebeeckx
|Material Type:
|Internet resource
|Document Type:
|Book, Internet Resource
|All Authors / Contributors:
Antonio D Sison
|1403975167 9781403975164
|OCLC Number:
|xii, 231 pages : illustrations ; 22 cm
|pt. I. Cinematic principle: 1. The concept of the Third Cinema --
2. Exploring national dimensions of third cinema --
3. Films from a virtual geography of third cinema --
pt. II. Theological principle : 4. Political holiness : the eschatological perspective of Schillebeeckx --
pt. III. The crystallization of political holiness in third cinema --
Conclusion : the new stained glass winsdow.
|Antonio D. Sison ; foreword by Robert J. Schreiter.
|More information:
"An exploration of the creative crossings between the liberative stream of Edward Schillebeeckx's eschatological perspective and Third Cinema, Antonio D. Sison's work is interdisciplinary and innovative. Examining a variety of films - from independents such as Perfumed Nightmare and Xala to the Oscar-nominated Hotel Rwanda and Motorcycle Diaries - Sision builds an intertextual and intercultural dialogue between one of the greatest western theologians of our time and a cinema that has become all the more relevant in the light of global, sociopolitical struggles. Sison argues for the primacy of cinematic style as the locus for a theological interpretation of film over the prevailing practice of extracting the religious dimension from film's more thematic, literary basis."--Jacket.
User-contributed reviews

subset: commoncrawl


text:
Respected Dermatologist says 'I am revolted by it;' Petitions for Meeting at Upcoming San Antonio Conference
WASHINGTON, Feb. 4 /PRNewswire-USNewswire/ -- A group of dermatologists, including Dr. A. Bernard Ackerman, director emeritus of the Ackerman Academy of Dermatopathology in New York City, has called the American Academy of Dermatology's (AAD) "Seal of Recognition" program a "shocking conflict of interest." The AAD agreed to hold a special session on Monday during their annual meeting (being held this year in San Antonio) to talk about the issue -- but only after a petition was circulated by their members calling for a discussion on the topic.
The AAD's "Seal of Recognition" program, charges companies thousands of dollars for the simple "privilege" of displaying the academy's logo on sun-protection products. Similar to a scandal involving the American Medical Association in the late 1990's, companies must pay a $10,000 fee per product to apply for the logo and an additional $10,000 annual fee per product to use it.
Dr. Ackerman, as quoted in the Dermatology Times, is firmly against the program.
"I am revolted by it," he says. "The patient should never be used as a vehicle for self-aggrandizement by either an individual physician or an association of physicians."
Another dermatologist, Peter C. Lombardo, M.D., made similar comments to the Times.
"I am very much against it. I think it has no value whatsoever," he says. "The (academy) does not have an independent testing organization that tests one product against the other and finds out which deserves the Seal of Recognition. And they accept the data from whatever company is willing to pay the fee."
"This scandal is further evidence of the incestuous and unethical
relationships between the dermatological community and the skin care
industry," says Sarah Longwell communications director for the Indoor
Tanning Association. "I'm surprised the AAD
|SOURCE Indoor Tanning Association
Copyright©2008 PR Newswire.
All rights reserved


text: Personalised Wooden Chopping Or Cheese Board by The Rustic Dish £25$54.17€36.99$41.13 187 customer reviews(187) In stock £18.50$40.08€27.37$30.43 delivery to United States Receive this item 5-10 working days from dispatch International delivery available personalised - top line (max 25 characters) (required) personalised - middle line (max 20 characters) (required) personalised bottom line (max 25 characters) (required) sizes - (check dimensions carefully. gift boxes not available for 40 and 50cm boards). sizes - (check dimensions carefully. gift boxes not available for 40 and 50cm boards). (required)21 x 15 x 2cm 30 x 15 x 2cm (+ £15)40 x 16 x 2cm (+ £35)50 x 18 x 2cm (+ £45)60 x 20 x 2cm (+ £60)sizes - (check dimensions carefully. gift boxes not available for 40 and 50cm boards). (required)21 x 15 x 2cm 30 x 15 x 2cm (+ $32.50)40 x 16 x 2cm (+ $75.84)50 x 18 x 2cm (+ $97.51)60 x 20 x 2cm (+ $130.02)sizes - (check dimensions carefully. gift boxes not available for 40 and 50cm boards). (required)21 x 15 x 2cm 30 x 15 x 2cm (+ €22.19)40 x 16 x 2cm (+ €51.79)50 x 18 x 2cm (+ €66.59)60 x 20 x 2cm (+ €88.79)sizes - (check dimensions carefully. gift boxes not available for 40 and 50cm boards). (required)21 x 15 x 2cm 30 x 15 x 2cm (+ $24.67)40 x 16 x 2cm (+ $57.58)50 x 18 x 2cm (+ $74.03)60 x 20 x 2cm (+ $98.71) presentation boxes - not available for 40cm, 50cm & 60cm boardspresentation boxes - not available for 40cm, 50cm & 60cm boards (required)Without BoxWith Box (+ £4.95)presentation boxes - not available for 40cm, 50cm & 60cm boards (required)Without BoxWith Box (+ $10.72)presentation boxes - not available for 40cm, 50cm & 60cm boards (required)Without BoxWith Box (+ €7.32)presentation boxes - not available for 40cm, 50cm & 60cm boards (required)Without BoxWith Box (+ $8.14) quantity by The Rustic Dish Location: Essex, GB read seller's profile see seller's complete range more items from this seller Natural Wooden Serving Or Chopping Board £30$65.01€44.39$49.35 Personalised Carved Heart Cheese Board £25$54.17€36.99$41.13 Olive Wood Party / Canapé Board £19.99$43.31€29.58$32.88 'Mr And Mrs' Olive Wood Chopping Board £25$54.17€36.99$41.13 Personalised Olive Wood Chopping Board £25$54.17€36.99$41.13 Personalised Wooden Chopping Board £25$54.17€36.99$41.13 view all you may also like PRODUCT DETAILS CUSTOMER REVIEWS DELIVERY RETURNS can be personalised eco-friendly ask seller a question save for later A beautifully designed and unique artisan board ideal for use as a chopping, cheese or antipasti board, made from beautiful olive wood. These make great keepsake gifts and mementos for absolutely any occasion, including - Birthdays, Wedding Anniversaries (especially 5th), New Home, thank you and leaving presents, Father's and Mother's Day, Christmas, Valentines. Simply choose someone's favourite quote, names and the date of a special occasion, favourite cheese or cooking quotes, etc, etc, etc. If you can think of it, we can make it! Ethically produced: we only use wood from very old olive trees that have come to the end of their natural fruiting life and have already been replaced with younger, more productive trees. These have been handcrafted by artisans to a very high standard, will last for years, and will only get better with age. Personalised engraving: simply enter your text in the boxes provided. You can follow our example or choose 3 completely different messages of your choice. If you do not wish to use all three lines then simply enter "Leave Blank" in the relevant box. Please keep within the maximum number of characters allowed for each line. Unfortunately we cannot add extra characters. Black presentation boxes available for 20cm and 30cm boards only. Packed with luxury, black tissue paper. made from: each board has been carved by hand from one piece of olive wood, which is a very beautiful and a very hard wood. Every piece is completely unique with stunning grain patterns and colour and at least one rustic, organic edge. care instructions: hand wash with hot, light soapy water. Treat often with olive, coconut or any other food grade oil. A care guide is included in with your board. dimensions: five sizes available. Please check the dimensions carefully before ordering. 21cm x 15cm x 2cm - perfectly handy for chopping herbs, chillies, garlic, ginger, cheese, etc. 30cm x 15cm x 2cm (as pictured) - great for serving cheese, chopping veg, and as above. 40cm x 16cm x 2cm - as above again....but looks great as a serving and presentation board on the dining table. 50cm x 18cm x 2cm - as above, but large enough to handle even the largest sunday roast! 60cm x 20cm x 2cm - as above with the 50cm version, but extra room for the spuds and vegetables! Sizes can vary slightly due to the product being crafted by hand. product code: 340813 187 customer reviews Mon 12 Oct 2015 Perfect wedding gift, loved by the couple and I thought it was spot on. Thu 08 Oct 2015 This was a wedding gift & the couple absolutely love it. Currently pride of place in their kitchen! Thu 08 Oct 2015 The bride & groom loved it! Thu 08 Oct 2015 Beautiful product and presentation Wed 07 Oct 2015 very quick delivery, great product Wed 07 Oct 2015 Great products and the personalisation with this was beautiful creating a very special gift for my brother's wedding. Sat 03 Oct 2015 Lovely board Fri 02 Oct 2015 Beautiful. Shipped super fast also. Thanks! Fri 02 Oct 2015 Fast shipping, beautiful, to my surprise exactly as described. Fri 02 Oct 2015 Chopping board was beautiful. Really well done and the wood had a lovely smell! Fri 02 Oct 2015 I have not seen item but recipients are delighted. It was a wedding gift. Thu 01 Oct 2015 Really happy with it Wed 30 Sep 2015 Such a beautiful present! So personal and life long. Wed 30 Sep 2015 Fantastic quality really really pleased thank you Sun 27 Sep 2015 Quality product, very impressed Fri 25 Sep 2015 Very happy with the chopping board. Fri 25 Sep 2015 Great quality and better than expected! Thu 24 Sep 2015 beautifully made, ideal wedding present Thu 24 Sep 2015 Great quality & lovely writing Tue 22 Sep 2015 No comment supplied. Sun 20 Sep 2015 Excellent quality. Perfect wedding gift Sun 20 Sep 2015 Bought as a wedding gift and I'm really pleased. It's great quality and the engraving is done well. Sat 19 Sep 2015 Excellent quality, beautifully carved. Everything as described and shown. Fri 18 Sep 2015 Beautiful product - would buy again! Wed 16 Sep 2015 Beautiful piece of wood, excellent wedding gift. Wed 16 Sep 2015 Very impressed Tue 15 Sep 2015 very nice Sat 12 Sep 2015 Very well boxed- lovely piece of wood Sat 12 Sep 2015 Got exactly what I ordered! Thu 10 Sep 2015 .... Thu 10 Sep 2015 Perfect wedding gift. Want one for myself now!! Wed 09 Sep 2015 No comment supplied. Wed 09 Sep 2015 Perfect Wedding Anniversary present! Wed 09 Sep 2015 Lovely quality wood & the engraving is perfect! I would definitely buy from this company again! Xxx Wed 09 Sep 2015 Great product Wed 09 Sep 2015 The engraving looked great and the board was good quality. My only qualm was that it was a lot smaller than expected when it arrived, the measurements are on there so I only have myself to blame but I envisaged it being a little larger. (I ordered the smaller size so my advice would be to go for the one up from that). Wed 09 Sep 2015 Beautiful engraving, absolutely perfect! Wed 09 Sep 2015 No comment supplied. Wed 09 Sep 2015 stunning - only word for it. was brought as a leaving gift and was perfect Fri 04 Sep 2015 The board was great, but unfortnately the delivery was not great. The board was left at a different address to what was written on the delivery note and this ment that it was not straight forward at all to find out where it was. Sat 22 Aug 2015 Great wedding gift Fri 21 Aug 2015 Beautifully made. My husband loves his first anniversary gift. Fri 21 Aug 2015 The board was incredible and to such a high standard. I will definitely be buying form this seller again. Fri 21 Aug 2015 Good quality Fri 21 Aug 2015 Excellent service and highly recommend Thu 20 Aug 2015 good quality looks great Fri 14 Aug 2015 Lettering is poor The Rustic Dish's response: Thanks for your feedback and we're sorry to hear that you're not totally happy with your purchase. We are not sure what your complaint refers to. As you can see from all the previous customer feedback on this item, the quality of our engraving is of an extremely high standard. Please let us know if there is anything further we can help you with. Tue 11 Aug 2015 Beautiful quality and design. I bought this as a wedding present for my best friends and they are over the moon with it. I was informed that they'd love to use it as a plaque instead of a cheeseboard, however. Thank you! Sat 08 Aug 2015 Bought for a wedding present. Excellent quality and quick delivery. Fri 07 Aug 2015 The delivery was quick and painless. I had brought this for a wedding present, the board looked really nice! Fri 07 Aug 2015 The chopping board is wonderful - we went for the biggest size 50cm and it it really impressive. More like a serving platter than a chopping board. It was a birthday present and the recipient really loved it - the wood is beautiful and the personalised carving really good quality. Thu 06 Aug 2015 Beautiful board Wed 05 Aug 2015 Exactly what was ordered. Beautifully presented and delivered swiftly. Perfect. Wed 05 Aug 2015 Great quality, unique product as promised. Wed 05 Aug 2015 Top quality. Love it, it just looks so elegant,going to order anothe one . Wed 05 Aug 2015 Lovely Tue 04 Aug 2015 Beautiful gift, can't wait to give it to the happy couple! Tue 04 Aug 2015 Perfect Fri 31 Jul 2015 It made a great wedding present. Quick delivery and good quality. Will definitely use again. Fri 31 Jul 2015 The recipients said its the best gift they have ever had! Fri 31 Jul 2015 The wood is of excellent quality and the inscription was nicely done. Wih the chopping board not being square it does make the board feel smaller than the sizes given. The gift box was good quality. Fri 31 Jul 2015 Beautiful product, smartly presented. Thu 30 Jul 2015 great Wed 29 Jul 2015 great board, ideal wedding gift. quick delivery Wed 29 Jul 2015 The quality of the board is spot on. However, the board was smaller than expected. I know the website described that they leave an edge as rustic/with bark on, but the area missing was bigger than expected. For that size of board, I would have preferred to pay for the next size down. Apart from that, the wood is amazing - nicely carved, smells and feels nice. I hope for many years of use. Wed 29 Jul 2015 Beautiful craftsmanship makes this board a showpiece! A perfect wedding gift... the happy couple won't forget their anniversary in the years to come! Wed 29 Jul 2015 Very speedy delivery Wed 29 Jul 2015 Very good quality although a little pricey. Perfect wedding present for friends!! Wed 29 Jul 2015 The board looked amazing and the recipients were thrilled with it, what a great idea for a wedding gift! Wed 29 Jul 2015 Very pleased with product, excellent quality & craftsmanship Wed 29 Jul 2015 I'm delighted with this board. It really is absolutely beautiful and a perfect wedding present. It came very quickly and is even nicer than it looks in the picture. I cannot recommend this highly enough! Sun 26 Jul 2015 Fabulous Thu 23 Jul 2015 Fantastic product very nicely packaged and safely delivered good quality wood and carving. Wed 22 Jul 2015 For a wedding present very a very close friend and was over the moon with the wooden board. Tue 21 Jul 2015 Easy to do - very pleased Tue 21 Jul 2015 No comment supplied. Tue 21 Jul 2015 Quick delivery and very pleased with the item. Mon 20 Jul 2015 A nice touch to the wedding anniversary theme of 'wood'. Sat 18 Jul 2015 Smaller then I first expected, more suited to a cheese board then chopping board but it is absolutely stunning and perfect for a truly unique and individual wedding gift Fri 17 Jul 2015 This was a graduation present for a cheese lover! It arrived very quickly and looked and smelled beautiful. The recipient loved it. Tue 14 Jul 2015 A beautiful product with excellent personalisation. Sun 12 Jul 2015 Superb quality product, which arrived on time. Attention to detail was perfect. Fri 10 Jul 2015 An amazing present! Fri 10 Jul 2015 Wonderful item and beautifully engraved. This is worth every penny and makes a beautiful personalised gift. Thank you so much for a flawless service and a truly gorgeous product Fri 10 Jul 2015 The Rustic Dish company were great. They customised my chopping board perfectly and in good time. Fri 10 Jul 2015 Excellant product. Tue 07 Jul 2015 Beautifully engraved and actually arrived slightly larger than I was expecting which was great. It was a slightly different shape than the one shown on the site but this didn't matter. This will make a great chopping board or cold Meats/cheese display/serving board. Sat 04 Jul 2015 Bought a few of these as presents always well received Thu 02 Jul 2015 Good quality and innovative gift thanks Thu 02 Jul 2015 Very happy with the product, service and price. Wed 01 Jul 2015 They loved the gift and the only negative was that it did not come with a cheese knife as in the advert. Wed 01 Jul 2015 Quite nice. Bit too big for the presentation box so it bent the box but the wood was nice Fri 26 Jun 2015 We bought 7 of the personalised wooden cheese boards as an unusual wedding gift for our ushers & parents. They were excellently finished & well received by everyone. I was particularly happy with the communication from the seller who made last minute changes to my order and also ensured delivery was on time due to tight time-scales. I would recommend as an affordable & bespoke gift. Thu 25 Jun 2015 I was delighted with the chopping board and so were the bride and groom who I purchased as a wedding present for. Thu 25 Jun 2015 lovely item, very well made. Excellent present. Wed 24 Jun 2015 The goods were exactly as described and the quality was fantastic! Tue 23 Jun 2015 A lovely board that I got my husband for our 5th wedding anniversary. It is beautifully done and a gorgeous present :-) Fri 19 Jun 2015 very very small not at all useable for a chopping board we are going to have to use it as a plaque instead,waist of money The Rustic Dish's response: Thanks for your feedback and we're sorry to hear that you're disappointed with the size of your purchase. We provide very clear sizes and dimensions of each board within the description and we're always happy to answer any customer enquiries about our products prior to ordering. We give the customer 4 sizes of board to choose from and give the dimensions of those sizes within the drop down menu, and clearly detailed within the description. This is so the customer can make a very well informed choice as to the size of chopping/cheese board that suits their needs. Thank you for shopping with us and please contact us via your order enquiry if we can assist you further. Fri 19 Jun 2015 Really pleased with this item. Bought as a wedding gift,the happy couple loved it! Tue 16 Jun 2015 Not as described looks nothing like the picture! More like a plaque The Rustic Dish's response: Thanks for your feedback and we're sorry to hear that you're not totally happy with your purchase. Thank you also for the photo that you kindly provided us of your board. It is a shame that we cannot upload here as the board you have, and the engraving, is beautiful and represents exactly the quality and beauty of our rustic chopping and cheese boards, but we do understand that our rustic style of boards are not for everyone. Thank you for shopping with us and please do contact us via your order enquiry if you have any further comments. Best wishes, The Rustic Dish. Tue 16 Jun 2015 Couldn't be happier with the product. And it was delivered so quickly. So impressed ! Tue 16 Jun 2015 Too small Mon 15 Jun 2015 No comment supplied. Mon 15 Jun 2015 This board was absolutely beautiful! My colleague was so pleased with it that they even displayed it on their wedding table on the day! A wonderful, personalised gift at a very reasonable price, I would certainly recommend it to anyone buying for the couple that has everything already. Sat 13 Jun 2015 Brilliant!! Beautifully done. Sat 13 Jun 2015 Excellent quality item,highly recommended Fri 12 Jun 2015 Absoloutly brilliant! So beautiful and the couple loved it... Fri 12 Jun 2015 really pleased with this item, thank you Wed 10 Jun 2015 Bought this for my son in law 30th birthday he was really chuffed with the item as was personalized and will be a lovely keepsake. Wed 10 Jun 2015 Really excellent item, the engraving looks wonderful. Fri 05 Jun 2015 Top quality and arrived within expected time. Very pleased with service provided. Fri 05 Jun 2015 No comment supplied. Fri 05 Jun 2015 Much smaller than I expected. Clear details of size of item would help. Something well known (cutlery?) shown in yhe images of the board which allows understanding of the scale of it would really help. It looked nice, though and was well incised for personalisation. The Rustic Dish's response: Thanks for your feedback and we're sorry to hear that you're disappointed with the size of your purchase. We are sorry you missed the information regarding the various sizes on the product within description. We also state the dimensions of the sizes available from the drop menu. This is so the customer can choose the correct sized board for their needs. Thank you shopping with us. Thu 04 Jun 2015 Beautifully made and arrived just when you said it would. Thanks! Thu 04 Jun 2015 No comment supplied. Wed 03 Jun 2015 Just beautiful! Bought as a wedding gift & is a really personal item that can be treasured. The wood is gorgeous & the detail inscribed was perfect & had a great finish. Arrived well packaged & swiftly. Great communication with the seller too. Wed 03 Jun 2015 It was expensive for what it was but was a wedding present for a couple who have everything and love cheese. Glad I purchased the box for it to go in. Tue 02 Jun 2015 Great personalised product - beautiful as well as useful. Fri 29 May 2015 Beautiful craftsmanship - a lovely wedding gift. Fri 29 May 2015 As ever - lovely products Fri 29 May 2015 No comment supplied. Fri 29 May 2015 Was exactly what I was looking for Fri 29 May 2015 Beautiful chopping board a little smaller than I expected but presented in a lovely gift box. Thu 28 May 2015 Very good quality product. Tue 26 May 2015 Similar to other feedback - disappointed with size of board. I had checked the measurements following reading other feedback but even on delivery it was smaller than anticipated. Tue 26 May 2015 Excellent product, quick delivery Sun 24 May 2015 Perhaps a little smaller than I'd imagined but that's my fault I suppose. Beautifully presented. Thu 21 May 2015 No comment supplied. Thu 21 May 2015 Looks every bit as beautiful as it did in the picture. Very happy with the product. Wed 20 May 2015 Excellent quality and beautiful piece Wed 20 May 2015 Beautiful present Fri 15 May 2015 Excellent Fri 15 May 2015 No comment supplied. Fri 15 May 2015 Beautiful it was an anniversary present for my husband and he loved it, it's unique. Thu 14 May 2015 Person delighted with it Thu 14 May 2015 Love it, looks so classy. Bought for a gift and I'm sure the recipient will love it too Thu 14 May 2015 Excellent product with quick delivery Thu 14 May 2015 Easy purchase, happy with product Wed 13 May 2015 Got for a wedding gift and the couple loved it Wed 13 May 2015 Delighted with this product. Hope someone buys one for me! Wed 13 May 2015 Good quality. Would recommend Wed 13 May 2015 went straight to the recipient but they loved it Wed 13 May 2015 The board came beautifully done but came with no message like I asked. Sat 09 May 2015 Loved it :) Sat 09 May 2015 Beautiful, better then I could have imagined! Thank you Thu 30 Apr 2015 No comment supplied. Wed 29 Apr 2015 No comment supplied. Wed 29 Apr 2015 Excellant service - due to making an error on my order this was dealt with brilliant the board arrived with all alterations dealt with Mon 13 Apr 2015 Gorgeous product, really happy with the quality and made a fantastic wedding gift. Thu 09 Apr 2015 It was very quick and quality Fri 27 Mar 2015 Nice and unusual Fri 27 Mar 2015 .. Wed 25 Mar 2015 Beautifully done. Excellent turnaround from the time I placed the order. Will use them again. Tue 24 Mar 2015 Lovely item, was a gift for someone and they loved it, I will be ordering another shortly for my Mum. Fri 20 Mar 2015 The board was gorgeous, the ordering process was easy and the shipping was fast, the only problem I had was the packaging, for such a lovely product, it was simply put in a flimsy cardboard envelope, no packaging, no wrapping, nothing.... That was rather disappointing, a bit of protective bubble wrap or tissue wouldn't have gone a miss. Fri 13 Mar 2015 Got a gift for my friend and she loved it. Great quality. Neat. Tue 03 Mar 2015 Looks great, very nicely engraved. Thu 26 Feb 2015 it was the perfect wedding gift, the bride & groom loved it. Great value for money! Thank you! Tue 17 Feb 2015 The recipients absolutely loved the product! I will be definitely buying more as gifts for friends Tue 16 Dec 2014 Brilliantly built product, absolutely loved Fri 12 Dec 2014 Very attractive wood colour and grain. Has a nice solid feel. Carving of name and message is beautifully done - a first class job. The board is just a little bit on the small side for a full size loaf. The board is OK for slicing or chopping meat, but if you're chopping vegetables etc the pieces drop into the carved letters and cannot be swept off the board. Sun 23 Nov 2014 Lovely product Fri 21 Nov 2014 I thought the board was going to be bigger however that's my own fault as I should of looked at the measurements just thought for the price it was it would of been larger. Fri 21 Nov 2014 ~I had made a mistake with spelling and contacted company who changed it Tue 11 Nov 2014 Good quality, arrived on time Fri 07 Nov 2014 A gorgeous item. Thu 23 Oct 2014 Very pleased with it Thu 23 Oct 2014 -- Sat 11 Oct 2014 Nice but much smaller than I was expecting, especially considering how much it cost! Wed 08 Oct 2014 Beautiful product, excellent as unusual wedding gift! Wed 01 Oct 2014 Beautiful and delivered promptly Wed 17 Sep 2014 The quality of the wood and carved writing is good but the shape of the board isn't, the rough edge arches up all the way to the writing, I understand that each board is different but the shape of this one is very disappointing. Wed 17 Sep 2014 No comment supplied. Thu 11 Sep 2014 Bit smaller than we had anticipated but did look like the picture so happy overall. Sun 03 Aug 2014 The chopping board is gorgeous. I ordered the size shown on the product page and it's perfect for serving cheese or small nibbles at a dinner party. The engraving fonts are beautiful and it's very sturdy, beautiful wood. I can't wait to give it to my newlywed friends. Wed 30 Jul 2014 Excellent service, spelling mistake on one but quick to resolve the issue and sent a new one free of charge! would definitely recommend! Fri 25 Jul 2014 Lovely product Wed 23 Jul 2014 Really excellent product, shame the price went up before I could buy another one. Thu 17 Jul 2014 Quick delivery and good quality product - the recipients loved it . Tue 15 Jul 2014 I brought this as a wedding present. It has a lovely finish to the product. It was slighty small than I envisaged and believe it would be used more as an ornament rather than a chopping board Tue 15 Jul 2014 A lovely item bought for a wedding present - arrived promptly and couple were delighted. Many thanks. Fri 11 Jul 2014 Arrived on time. Very good quality, engraving beautifully done. Not used it as a chopping board as yet but happy with product so far. Fri 11 Jul 2014 Perfect wedding gift, exactly as described and beautiful. Fri 11 Jul 2014 Good quality product, liked by recipients enough they want to give one to a friend of theirs also Wed 09 Jul 2014 Lovely Sat 21 Jun 2014 Made an excellent and personal gift. Thrilled with the quality. Thank you. Fri 23 May 2014 The recipients were overjoyed with the board!! Thank you see all customer reviews hide some customer reviews read about our product rating system ratings guide trusted independent customer feedbackforum excellent bad good poor This product is dispatched to you by The Rustic Dish. MAINLAND UK order now and receive this item by price Standard Delivery Tuesday 20 October £2.75$5.95€4.06$4.52 Tracked Next Day Delivery Thursday 15 October £7.70$16.68€11.39$12.66 NON-MAINLAND UK estimated delivery price Not currently available for this region INTERNATIONAL DELIVERY estimated delivery price Western Europe 2-5 working daysfrom dispatch £11.50$24.92€17.01$18.91 USA & Canada 5-10 working daysfrom dispatch £18.50$40.08€27.37$30.43 You have 28 days, from receipt of cancellable goods, to notify the seller if you wish to cancel your order or exchange an item. Please note: goods that are personalised, bespoke or made-to-order to your specific requirements, perishable products and personal items sold with a hygiene seal (cosmetics, underwear) in instances where the seal is broken are non-refundable, unless faulty. Read more about our returns policy.Should you choose to return or exchange your order you will need to deliver the item(s) to the UK, where this seller is based. The Rustic Dish's return policy


text:
People involved in a wreck with an 18 wheeler (tractor trailer) need to know that the lawyer representing them should have experience beyond just car wrecks.
12/10/14 - 10:23am
12/10/14 - 10:21am
How Modern Insurance Companies Value Your Car Wreck Injuries
12/07/14 - 10:00am
5 Comments
How do insurance companies and adjusters operate?
Dos and Don'ts
Please remember: an insurance company increases profits by reducing the amount of money it pays out in claims.
12/06/14 - 5:07pm
1 Comment
FREE Checklist & Client Car Wreck Guide
Have an experienced attorney or law firm selected now so they are ready to go in the event of a wreck or emergency.
12/06/14 - 9:16am
1 Comment
With 29+ years of handling catastrophic injury cases I am often contacted by friends and family of someone who just had a horrible injury or even death in the family.
I am always at a loss of how I can respond to their concerns about the spouse or the children of the victim.
11/01/14 - 11:42am
The Bizarro World
09/27/14 - 3:51pm
1 Comment
Savannah' s South side is growing stronger every day.
07/13/14 - 10:47am
I saw where a local boxer, Stephen Bass who lost a boxing match last night and said to his fans "I'm sorry".
For what?
I often tell my karate students:
"To compete is to win.There are millions of kids in the US, there are 100,000s within the area of the tournament. There are usually 100s in the gym where the tournament is held... out of all them there are maybe 10 to 20 kids your age who have the courage to compete. Just standing here makes you a champion and a winner in my eyes".
09/07/13 - 9:58am
The true Story.

Looking at our City parks and squares and then riding on streets like Bee Road makes it is clear that the City has 2 standards for the care of our City's trees..
One standard for the Historic district where 12 million tourist visits per year and billions of dollars of revenues are generated.
A second standard is for areas such as Bee Road.
Don't the Citizens on Bee Road and White Bluff Road and other areas of town deserve the...
08/24/13 - 12:56am
3 Comments
Subscriber Services:
Digital Network:
Social Networking:
Savannahnow.com, Savannah Morning News ©2015. All Rights Reserved.


text:
Over 3 billion Draw Something sketches already
So we knew Draw Something was big. We just didn't know how big.
Since being launched just seven weeks ago a staggering 20 million people have used the app, with more than three billion - that's billion - sketches drawn.
Of course the app is free (a paid for ad-free version is also available) and is available on both iOS and Android platforms, all of which are contributing factors to its mass appeal.
However, the game's creators Omgpop are said to have earned more revenue in a single day from people downloading Draw Something than they have with all of their previous games combined.
For the two of you who aren't familiar with Draw Something, think of it as a virtual game of Pictionary.
Playing with, rather than against, your friend, you take it in turns to draw objects, actions or even famous people while the other tries to guess it. You can even play people you don't know.
We have to admit we've got the Draw Something bug too, though we're a long way from producing any works of art such as the virtual masterpieces below.
- Zynga SVP talks the future of Draw Something
This guy plays all the bad iOS GTA clones so you don't have to
What is Google's Now on Tap and how does it work?
YouTube Kids app adds new parental controls to combat safety complaints
Starbucks Mobile Order and Pay service goes live in UK
- This guy plays all the bad iOS GTA clones so you don't have to
- What is Google's Now on Tap and how does it work?
- YouTube Kids app adds new parental controls to combat safety complaints
- Starbucks Mobile Order and Pay service goes live in UK
- Apple OS X El Capitan review: Tweaks rather than overhaul for free OS update
- Chromecast 2 hands-on: All-new shape and a full-featured app to go with it
- Microsoft Office for iPad Pro needs a 365 subscription if you want to edit docs
- Full Twitch apps finally coming soon to PS4, PS3, PS Vita, and PS TV
- Best 3D Touch apps for iPhone 6S and 6S Plus
- BBC iPlayer for Children app coming for iPad and Android in 2016
- When is Android 6.0 Marshmallow coming to my phone?
- Microsoft Surface Pro 4: Release date, rumours and everything you need to know
- Microsoft Lumia 950 and Lumia 950 XL: What's the story so far?
- Master HTML5 and CSS3 web design for 81 per cent off
- Microsoft Lumia 550: What's the story so far?
- Apple buys AI speech startup that could make Siri sound more natural
- Watch the final trailer for Spectre here, ahead of film's 26 Oct release
- Microsoft Lumia 950 (Talkman) vs Microsoft Lumia 950XL (Cityman): What's the difference?
- Logi Circle: Smart filtering video camera could get addictive
- Halo 5 limited edition Xbox One controllers now available: This is what they look like


text:
What do you dislike about The Dark Knight?
View Single Post
January 3 2009, 04:35 AM
Location: Montgomery County, State of Maryland
Re: What do you dislike about The Dark Knight?
DWF wrote:
Yet again you're not providing any proof that the Joker gave away inaccurate infomation because he didn't know the truth.
That would be because I wasn't arguing the point, I was simply stating that that's my opinion. If you disagree with it, fine, but there's nothing in the film that precludes it, and I happen to think that if
The Killing Joke
, one of the many comic sources Nolan and Co. drew upon in making the film, establishes that he has an unreliable memory, then I'll go with that. You're welcome to another interpretation, but I don't share it.
The point that I
argue was whether or not an individual who unknowingly conveys inaccurate information can be reasonably said to have lied, but that was tangential.
And we're not the same page at all, you claimed he improvised the things he did,
No. Re-read my post: I claimed that he has short-term plans but not long-term "big picture" plans. You essentially said the same thing. It was just a matter of how we were phrasing it.
Democratic socialism is the hope of human freedom.
View Public Profile
Send a private message to Sci
Find More Posts by Sci


text:
Filter by:
Content type:
Stage 1&2
Stage 2&3
Stage 3&4
Stage 4&5
Challenge level:
Make and prove a conjecture about the value of the product of the Fibonacci numbers $F_{n+1}F_{n-1}$.
Given that a, b and c are natural numbers show that if sqrt a+sqrt
b is rational then it is a natural number. Extend this to 3
Find a connection between the shape of a special ellipse and an
infinite string of nested square roots.
An iterative method for finding the value of the Golden Ratio with explanations of how this involves the ratios of Fibonacci numbers and continued fractions.
In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).
Which of these triangular jigsaws are impossible to finish?
This is an interactivity in which you have to sort the steps in the
completion of the square into the correct order to prove the
formula for the solutions of quadratic equations.
The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
This problem is a sequence of linked mini-challenges leading up to the proof of a difficult final challenge, encouraging you to think mathematically. Starting with one of the mini-challenges, how. . . .
Prove that if a is a natural number and the square root of a is
rational, then it is a square number (an integer n^2 for some
integer n.)
The diagram shows a regular pentagon with sides of unit length.
Find all the angles in the diagram. Prove that the quadrilateral
shown in red is a rhombus.
A quadrilateral inscribed in a unit circle has sides of lengths s1, s2, s3 and s4 where s1 ≤ s2 ≤ s3 ≤ s4.
Find a quadrilateral of this type for which s1= sqrt2 and show s1 cannot. . . .
Caroline and James pick sets of five numbers. Charlie chooses three of them that add together to make a multiple of three. Can they stop him?
Show that x = 1 is a solution of the equation x^(3/2) - 8x^(-3/2) = 7 and find all other solutions.
A polite number can be written as the sum of two or more
consecutive positive integers. Find the consecutive sums giving the
polite numbers 544 and 424. What characterizes impolite numbers?
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
An article about the strategy for playing The Triangle Game which
appears on the NRICH site. It contains a simple lemma about
labelling a grid of equilateral triangles within a triangular
Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.
The problem is how did Archimedes calculate the lengths of the sides of the polygons which needed him to be able to calculate square roots?
You have twelve weights, one of which is different from the rest.
Using just 3 weighings, can you identify which weight is the odd
one out, and whether it is heavier or lighter than the rest?
Can you convince me of each of the following: If a square number is
multiplied by a square number the product is ALWAYS a square
Investigate the number of points with integer coordinates on
circles with centres at the origin for which the square of the
radius is a power of 5.
Explore the continued fraction: 2+3/(2+3/(2+3/2+...)) What do you
notice when successive terms are taken? What happens to the terms
if the fraction goes on indefinitely?
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
Find all positive integers a and b for which the two equations:
x^2-ax+b = 0 and x^2-bx+a = 0 both have positive integer solutions.
The sums of the squares of three related numbers is also a perfect
square - can you explain why?
To find the integral of a polynomial, evaluate it at some special
points and add multiples of these values.
In this 7-sandwich: 7 1 3 1 6 4 3 5 7 2 4 6 2 5 there are 7 numbers between the 7s, 6 between the 6s etc. The article shows which values of n can make n-sandwiches and which cannot.
Take any two numbers between 0 and 1. Prove that the sum of the
numbers is always less than one plus their product?
With n people anywhere in a field each shoots a water pistol at the
nearest person. In general who gets wet? What difference does it
make if n is odd or even?
Can you rearrange the cards to make a series of correct
mathematical statements?
By considering powers of (1+x), show that the sum of the squares of
the binomial coefficients from 0 to n is 2nCn
Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.
Here the diagram says it all. Can you find the diagram?
Is the mean of the squares of two numbers greater than, or less
than, the square of their means?
Let a(n) be the number of ways of expressing the integer n as an
ordered sum of 1's and 2's. Let b(n) be the number of ways of
expressing n as an ordered sum of integers greater than 1. (i)
Calculate. . . .
An inequality involving integrals of squares of functions.
These proofs are wrong. Can you see why?
Take any whole number q. Calculate q^2 - 1. Factorize
q^2-1 to give two factors a and b (not necessarily q+1 and q-1). Put c = a + b + 2q . Then you will find that ab+1 , bc+1 and ca+1 are all. . . .
Show that the arithmetic mean, geometric mean and harmonic mean of
a and b can be the lengths of the sides of a right-angles triangle
if and only if a = bx^3, where x is the Golden Ratio.
Explore a number pattern which has the same symmetries in different bases.
Show that for natural numbers x and y if x/y > 1 then x/y>(x+1)/(y+1}>1. Hence prove that the product for i=1 to n of [(2i)/(2i-1)] tends to infinity as n tends to infinity.
Tom writes about expressing numbers as the sums of three squares.
Prove that in every tetrahedron there is a vertex such that the
three edges meeting there have lengths which could be the sides of
a triangle.
Start with any whole number N, write N as a multiple of 10 plus a remainder R and produce a new whole number N'. Repeat. What happens?
The final of five articles which containe the proof of why the sequence introduced in article IV either reaches the fixed point 0 or the sequence enters a repeating cycle of four values.
Take a number, add its digits then multiply the digits together,
then multiply these two results. If you get the same number it is
an SP number.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
An article which gives an account of some properties of magic squares.
If I tell you two sides of a right-angled triangle, you can easily work out the third. But what if the angle between the two sides is not a right angle?


text:
Vijay Singh is playing in the Annika Sorenstam Open, unless he is paired with The Divine Ms. S., and will get no end of grief for doing so.
The Eldrick is not playing, and will be given his customary pass.
So no, you don't need to know anything more about Golf 2003.
Without boring you with any of the He Said/He Didn't Say, we'll simply say that Singh finds the inclusion of Sorenstam at the Colonial something of an insult, but is playing anyway.
The Eldrick, on the other hand, is taking the week off to help his preparations for the U.S. Open at a Sorenstam-free course next month.
You may decide for yourselves who is the stronger person. Frankly, we're pretty well Burk-ed out after The Masters, and we long ago lost our sense of outrage over an unpopular opinion sincerely delivered.
Plus, Sorenstam is playing, Singh or no Singh, Woods or No Woods. I think the late Mendy Rudolph put it best when he said, "No harm, no foul.''
Thus, we are down to trying to deduce how your average PGA Tour golfer, pride and slightly right-of-center viewpoint, is going to deal with the presence of those noxious media types who will notice Sorenstam's presence and will wait patiently for her to clean at least a few Rolexes, take those names and make sure you never forget them.
Well, most will try to win the tournament, on the theory that Sorenstam can't possibly beat all of them. After all, they guessed right on Hootie's staying power against the relentless but ultimately underclubbed Ms. Burk.
But the fun isn't going to be at the top of the leaderboard, which is probably why Singh's underwear is in such a knot. The fun is going to be found within three strokes of Sorenstam either way, at any given point.
You see, this is going to be cast, the way the Billie Jean King/Bobby Riggs pie fight, as more proof that women can do everything men can, except refuse to go to Lamaze class.
Why this matters is anyone's guess. Sorenstam long ago proved everything a golfer can prove, no matter what kind of reproductive system is involved. This isn't about Annika Sorenstam ... it really and truly isn't.
If you think otherwise, then you're downgrading Sorenstam's skills for the
sake of proving a point nobody wondered about in the popular comic book
No, it's about how men unused to discomfort (I mean, they play in Midnight Mass conditions on grass that doesn't grow naturally anywhere on earth) deal with artificially induced shame.
In this corner, we're fine with that. I mean, what are they, six? You don't want to play, don't play. Nobody will know you're missing.
As for those who are playing, well, consider this incentive if you must. If being beaten by a woman is that much of a problem for you, play better. Don't shoot 82, shoot 72. If 72 doesn't get it done, shoot 69.
And if 69 doesn't do it, then it really is true that she's a hell of a golfer, and there are going to be a lot of fellas in the team photo with you, all saying, "She really is good, isn't she?''
After all, it's the capacity to learn from new experiences that separates us from, say, insects, reptiles and other invertebrates, such as figure skating judges.
So here is what the men get to learn from Annika Sorenstam per se:
Here, though, is what they get to learn from playing with Annika Sorenstam:
Playing under pressure that has nothing to do with prize money. Playing
for misplaced pride, prodded by the fear that comes with thinking your
friends (or, say, insects, reptiles and other invertebrates, such as golf
writers) will laugh at you.
So laugh back. Or don't. It's all snicks and giggles here anyway.
And that's the thing to remember. It's golf, but it isn't golf the way
you're used to seeing it -- from the top down.
It's Friday golf, only with a new way to make players wish they'd taken
up tennis instead.
And if you can't see the fun in that, well, you're Vijay Singh. Right now, there are better things to be.
There are also worse. After all, he said what he said, he meant it when
he said it, and he's still showing up. That counts for something, too.
Ray Ratto is a columnist with the San Francisco Chronicle and a regular contributor to ESPN.com