text:
The invention discloses a data validation, mirroring and error/erasure correction method for the dispersal and protection of one and two-dimensional data at the micro level for computer, communication and storage systems. Each of 256 possible 8-bit data bytes are mirrored with a unique 8-bit ECC byte. The ECC enables 8-bit burst and 4-bit random error detection plus 2-bit random error correction for each encoded data byte. With the data byte and ECC byte configured into a 4 bit×4 bit codeword array and dispersed in either row, column or both dimensions the method can perform dual 4-bit row and column erasure recovery. It is shown that for each codeword there are 12 possible combinations of row and column elements called couplets capable of mirroring the data byte. These byte level micro-mirrors outperform conventional mirroring in that each byte and its ECC mirror can self-detect and self-correct random errors and can recover all dual erasure combinations over four elements. Encoding at the byte quanta level maximizes application flexibility. Also disclosed are fast encode, decode and reconstruction methods via boolean logic, processor instructions and software table look-up with the intent to run at line and application speeds. The new error control method can augment ARQ algorithms and bring resiliency to system fabrics including routers and links previously limited to the recovery of transient errors. Image storage and storage over arrays of static devices can benefit from the two-dimensional capabilities. Applications with critical data integrity requirements can utilize the method for end-to-end protection and validation. An extra ECC byte per codeword extends both the resiliency and dimensionality.
1. A method of encoding a data byte, comprising the steps of:
selecting an irreducible polynomial;
generating an error control code as a function of the polynomial and the data; and generating an encoded data matrix wherein the data and the error control code comprise the elements of the matrix;
dispersing an element of the encoded data matrix to a selected one of a plurality of channels based upon a position of the element in the matrix.
2. The method of
the error control code is the same length as the data byte.
3. The method of
the polynomial is selected as an eighth degree polynomial.
4. The method of
5. The method of
6. The method of
7. The method of
8. The method of
9. The method of
10. The method of
11. The codeword of
12. A method of encoding data in the form of a data byte Di=d0d1d2d3d4d5d6d7 comprising the steps of:
selecting an irreducible error correcting eighth degree polynomial; dividing the data byte by the polynomial to produce an error correction code in the form Ei=e0e1e2e3e4e5e6e7 ; and
generating an encoded data word in the form d0d1d2d3d4d5d6d7e0e1e2e3e4e5e6e7.
13. The method of
14. The method of
15. The method of
d0 d1 d2 d3 d4 d5 d6 d7
e0 e1 e2e3e4e5 e6e7.
16. The method of
forming the encoded data word as an array.
17. The method of
18. The method of
forming a error detection code for every element in the rows and columns of the array of arrays.
19. The method of
counting errors in a codeword in a column;
counting errors in a codeword in a row;
using column equations to correct errors if the number of column errors is less than row errors;
using row equations otherwise.
20. The method of
counting errors in a codeword in a column;
counting errors in a codeword in a row;
using row equations to correct errors if the number of row errors is less than or equal to column errors;
using column equations otherwise.
21. The method of
forming the encoded data word as a 4×4 array.
22. The method of
forming the encoded data word as a 3×4 array.
23. The method of
forming the encoded data word as a 4×3 array.
24. The method of
arranging the matrix so that each element of the data byte is horizontally or vertically adjacent to at least three other elements of the data byte.
25. The method of
arranging the matrix so that each element of the data byte and the error control byte is a row of the matrix.
26. The method of
forming the encoded data matrix as
27. The method of
dispersing the first row of the matrix to a first device;
dispersing the second row of the matrix to a second device;
dispersing the third row of the matrix to a third device;
dispersing the fourth row of the matrix to a fourth device; and
dispersing each column of the matrix to one of the first through fourth devices such that only one column from the matrix is stored on any of the first through fourth storage devices.
28. The method of
determining which of the first through fourth devices that has not failed and contains error correction codes for data on a device that has failed;
retrieving the dispersed combination of error correction codes and data from the device so selected;
recreating data dispersed to a failed device using the known data and error correction codes in the equations below to recreate lost data
29. The method of
determining which of the first through fourth devices that has not failed and contains error correction codes for data on a device that has failed;
retrieving the dispersed combination of error correction codes and data from the device so selected;
recreating data dispersed to a failed device using the known data and error correction codes using the equations to recreate lost data when
decoding with inputs s and u rows available,
decoding with inputs s and v rows available,
decoding with inputs t and u rows available,
decoding with inputs t and v rows available
d7=d7; or
decoding with inputs u and v rows available,
30. The method of
determining which of the first through fourth devices that has not failed and contains error correction codes for data on a device that has failed; retrieving the dispersed combination of error correction codes and data from the device so selected;
recreating data dispersed to a failed device using the known data and error correction codes using the equations to recreate lost data when
decoding with inputs w and x columns available,
decoding with inputs w and y columns available,
decoding with inputs w and z columns available,
decoding with inputs x and y columns available,
decoding with inputs x and z columns available,
d7=d7; or
decoding with inputs y and z columns available,
31. The method of
determining which of the first through fourth devices that has not failed and contains error correction codes for data on a device that has failed;
retrieving the dispersed combination of error correction codes and data from the device so selected;
recreating data dispersed to a failed device using the known data and error correction codes in the equations below to recreate lost data
32. The method of
determining which of the first through fourth devices that has not failed and contains error correction codes for data on a device that has failed;
retrieving the dispersed combination of error correction codes and data from the device so selected;
recreating data dispersed to a failed device using the known data and error correction codes using the equations to recreate lost data when:
decoding with inputs s and u rows available,
decoding with inputs s and v rows available,
decoding with inputs t and u rows available,
decoding with inputs t and v rows available
d7=d7; or
decoding with inputs u and v rows available,
33. The method of
determining which of the first through fourth devices that has not failed and contains error correction codes for data on a device that has failed;
retrieving the dispersed combination of error correction codes and data from the device so selected;
recreating data dispersed to a failed device using the known data and error correction codes using the equations to recreate lost data when
decoding with inputs w and x columns available,
decoding with inputs w and y columns available,
decoding with inputs w and z columns available,
d2 d0+d3+d7+e3+e7
decoding with inputs x and y columns available,
decoding with inputs x and z columns available,
d7=d7; or
decoding with inputs y and z columns available,
34. A method of encoding a data byte, comprising the steps of:
selecting an irreducible polynomial;
generating a first error control code as a function of the polynomial and the data;
generating a second error control code as a function of the polynomial and the data;
generating an encoded first data matrix wherein the data and the first error control codes comprise the elements of the matrix;
generating an encoded second data matrix wherein the data and the first and second error control codes comprise elements of the matrix; and
dispersing an element of the encoded data matrix to a selected one of a plurality of channels based upon a position of the element in the matrix.
The invention has application in the fields of corporate business continuity and disaster recovery, ultra-resilient storage arrays for space, medical, financial, home and other mission critical applications and resilient distributed messaging within data system networks, routers, switches, directors, adapters, appliances, mobile devices and communication channels.
The present application claims the benefit of U.S. Provisional Patent Application Nos. 60/399,635 entitled "Data Dispersion and Mirroring Method with Fast Dual Erasure Correction and Multi-Dimensional Capabilities" filed on Jul. 29, 2002 and 60/460,545 entitled "Composite Data Protection Method for Micro Level Data" filed Apr. 4, 2003.
To information theorists the field of Error Control Codes and Coding was developed to utilize redundancy to maximize transmission rates. To the engineer it is useful to use redundancy to improve data resiliency, guarantee data integrity and to construct fail-safe hardware designs. Some codes are useful only for the detection of errors. Error correction codes are designed to recognize when data is in error, then locate the errors and finally remove the errors and if possible leave some degree of assurance that the final result is accurate. A third major category is that of erasure recovery codes. This is the case where segments of data are dispersed with the expectation that not all segments will be retrievable. Error control codes have been developed for all three major categories; error detection, error correction and erasure recovery. Sometimes a code can be used for double or triple duty. A common practice is to not use all of the mathematical robustness for correction but leave some for post correction data integrity verification. In other instances it is necessary to nest two or more different codes in order to accomplish multiple requirements to an acceptable degree.
Different forms of error control coding have been developed to handle the error modes inherent to ever changing communications channels, memory systems, storage networks and devices and system networks. Within hardware systems error modes are caused by transient effects such as alpha particles, others by asperities in storage media, by electrical noise and signal skew, by physical wear or chemical alteration, by inter-symbol interference and many other phenomena. Each may affect data differently and occur at a different rate and distribution pattern. This has spawned a continuous evolution of new codes and decoding techniques.
Specific examples of error detection codes are the Cyclic Redundancy Check codes CRC-16, CRC-320 and CCITT. They are popular codes used to detect errors in relatively short messages. Their capabilities are well understood but limited. A common application of CRC codes is in data communication where data is formatted into small sequential packets with each packet protected by a CRC checkword. As packets are input at the receiving node the CRC is recalculated and compared with the received CRC checkword. A good compare may result in the return of an acknowledge (ACK) signal. A miss compare might result in an Automatic Retry Request (ARQ) negative acknowledge (NACK) signal. After a limited number of retries the algorithm might assume that success is not likely and the transmission is terminated, delayed or rerouted. In specific applications that can tolerate inaccurate data the data can simply be flagged as being in error.
In coding theory the minimum difference in binary bit assignments between any two codewords is referred to as the Hamming distance, d. There is a direct correlation between the minimum Hamming distance of a code and its' ability to distinguish one codeword from another and also a code's potential for detecting and correcting random bits in error.
Consider the CCITT 16-bit polynomial code. The generator polynomial is g(x)=1+x5 +x12+x16. It has a Hamming distance d=4 giving it the following capabilities: 1) It can detect all combinations of 3 random bit errors over its length of 65,536 bits, d=t+1; 2) It can detect all odd bit errors; and 3) It can detect all burst errors of up to 16 bits length.
Single and multiple bit correction over short to medium length messages often use Hamming and BCH codes. This would include applications such as computer memories and other devices that exhibit transient single bit error modes.
Special codes have been developed to correct for single and multiple short burst errors over medium data lengths. Fire codes and the Kasami Computer Generated Cyclic codes are common single burst codes. Reed-Solomon codes are a popular multiple burst error correcting code type. Primary applications for burst error codes are disk read errors due to media asperities or scratches and inter-symbol electronic interference.
In 1967 a code was developed by Nordstrom and Robinson as an existence proof of an n=15, k=8, d=5 code since an n=12, k=5, d=5 code had already been discovered. Here n=total code bits and k=information bits. With a Hamming distance of d=5 it would detect up to 4 single bit errors and correct up to 2 single bit errors. The code length of 15 would be cumbersome in the 8-bit world. It was later determined that the N–R code could be extended to an n=16, k=8 code.
In the book Algebraic Coding Theory, (Elwyn Belekamp 1968) the author published that the polynomial whose roots are the finite field elements of order p is called the cyclotomic polynomial, denoted by Q(P) (x). He noted that the factors of Q(17) (x) are gl(x)=1+x3+x4+x5+x8 and g2(x)=1+x+x2+x4+x6+x7+x8 and that each polynomial could correct two random errors in a block of 17 binary digits.
U.S. Pat. No. 3,868,632 (Hong et al.) discloses that the Q(17) (x) code factors can be further exploited as an erasure code for 9 track tapes called Optimal Rectangular Code. Both tape and tape heads exhibit wear due to contact recording and the aggressive abuse of tape by the handling mechanisms. The most common associated error mode is loss of a media track on tape or the temporary or catastrophic loss of a read/write head. The erasure decoder was designed to recover data on the fly for up to two (typically outside edges) simultaneously failing data streams. The code is actually two different codes working in tandem plus a pointer system to identify which two of nine channels have failed or likely to be in error. Data is formatted in 7-byte groups, each a 56-bit rectangular data array with an 8-bit ECC and 8 bits of side-band parity. A similar dual erasure method has been designed for disk arrays.
The paper, A Case for Redundant Array of Inexpensive Disk (RAID), (Patterson et al., University of California—Berkeley, 1987) describes several methods for achieving disk device resiliency. RAID-1 mirroring is the simple process of generating and maintaining a single duplicate copy of a file, device or file system. RAID-2 has roots with Hamming single error correction/double error detection (SECDED) codes used primarily for computer memory systems. Two forms of erasure recovery that have roots with tape data track erasure recovery are RAID-3 and RAID-5, an extension of RAID-3. Also pertinent to this discussion is RAID-6. RAID-6 is a method that tolerates two device failures (erasures) and also has roots with dual erasure tape systems. There are also RAID-6 examples based on multiple level parity calculations across small data arrays.
The commodity nature of disk storage devices keeps driving the costs lower and lower with a tendency toward producing a single commodity product that supports the smallest to the largest applications. The increasing data capacity of storage products and the business and legal responsibilities now make data resiliency and data integrity requirements more essential than ever before. Business continuity back-up recovery performance requirements often dictate disk drives over tape. This is an opportunity to raise the reliability, integrity and resiliency of those and other applications via the use of new error control coding techniques. RAID-6 dual erasure capability is necessary for data protection while the first failure is being repaired.
Considerable work is in progress in the area of error coding for mobile communications. Convolution codes and many computer generated forward error correcting codes have been developed for serial transmission in the presence of errors. Many different kinds of array codes are being constructed and tested. Some of these rely on a composite of multiple error codes and innovative forms of ARQ retry algorithms for satisfying bandwidth and integrity requirements. In comparison they are exceedingly complex and require complex decoding algorithms such as the Viterbi and turbo methods.
A critical component of contemporary processor and storage architectures is the fabric of switches, routers and links used to scale processors, storage devices and network connectivity. These networks carry different data formats but in general move small to medium size packets of processor cache lines or communication and storage data packets. The requirement for resiliency and data integrity is high. To date cost has limited the error control measures to CRC error detection with ARQ retry methods and rerouting when alternate paths exist. There is inadequate end-to-end data integrity validation and hardware resiliency. Here too it is necessary and possible to raise the integrity, reliability and resiliency of data systems via new error control coding techniques.
The prior art includes some solutions based on the dispersal of data with the recovery via dual erasure control coding. In the context of small disk arrays this is commonly referred to as method RAID level 6. The number of disk drives clustered in these arrays typically varies from as few as four to six to as many as nine or seventeen. Other erasure control applications may be called information dispersal and reconstruction, erasure or loss resilient coding or in specific context forward error correction coding, FEC.
U.S. Pat. Nos. 5,128,810 (Halford) and 5,283,791 (Halford), in the name of the present inventor, show dual drive error correction method using a data bit dispersal with erasure control technique. This method requires a parity side-band drive and a significant amount of computation due to the dual dependent ECC codes (odd parity and irreducible polynomial). This approach is relatively cumbersome and slow if implemented in software. Also the code data array is rectangular M * (M-1) which limits data size flexibility.
U.S. Pat. No. 5,485,474 (Rabin), shows a method also significantly computationally intensive that suggests using a vector processor, systolic array or parallel processor for decoding. Therefore the encoding and decoding is both slow or relatively expensive to implement. Original data is not transmitted in clear systematic form. The preferred embodiment works with multiple bytes per codeword which results in file size matching issues, magnifies the size of encode/decode mechanisms and when dealing with application data can be a source of error migration during both the encode and decode processes. It also does not provide simultaneous error detection and correction nor a multi-dimensional data recovery capability.
U.S. Pat. No. 5,271,012 (Blaum et al.) describes an M*(M−1) data array where M is a prime number. Pairs of simple parity bits are recursively encoded over data in respective and recursive diagonal and row order array directions. The example embodiment shows a 5-drive array with data on 3 drives and parity on 2 drives. Data is encoded in 12-bit quanta and dispersed across the 5 drives in 4-bit quanta.
U.S. Pat. No. 5,579,475 (Blaum et al.) is a continuation of the 1993 patent with certain specific improvements such as a less recursive parity calculation algorithm. The array size M is again a prime number. While the operations are not mathematically complex the calculations are numerous.
U.S. Pat. No. 6,088,330 (Bruck et al.) and U.S. Pat. No. 6,128,277(Bruck et al.) describes a data array encoding where the array is N*N square and N preferably a prime number. If data is dispersed via columns, parity is developed in rows causing each dispersal element to contain both data and parity. Two separate independent parity row calculations are made along two slopes within the data array then stacked at the bottom to complete the encoding. The encoding supports specific error correction capabilities along with dual column erasure recovery. The 5×5 array described in the preferred embodiment represents 15 data bits and 10 parity bits. The decoding operations are numerous.
U.S. Pat. No. 6,138,125 (DeMoss) describes yet another dual-parity method that also requires the formatting of data into arrays with parity diagonals. Here the array is also a square N*N where N+1 is a prime number. Parity positions are the major diagonals and data positions are the remaining non-comer diagonal locations. The computation uses simple logical exclusive-or operations but the algorithm described is relatively extensive, as are all others that format data around diagonal parity vectors.
Many contemporary systems are being built by creating a network of processor/memory nodes utilizing single chip processors designed to meet the basic requirements for systems ranging from workstations to high-end supercomputers. Systems fabrics can be created by the interconnection of routers or switches together with a combination of processor nodes, I/O ports and fabric interconnect ports. An important aspect of some of these systems is for nodes, links and routers to have a specific degree of resiliency. Those with a more automatic resiliency capability are referred to as being fail-safe, self-healing or autonomic. This requirement is also emerging into storage network subsystems.
The invention provides an ultra-reliable mechanism for transmitting and storing byte quanta data on storage, processing, communications and disaster resistant systems. Comparative methods that encode data in quanta either larger or smaller than 8 bits require residual fractional packets in many applications. This invention can deal with as little as a single byte and up to any integer value of multiple bytes in a most flexible manner. This primary object of the invention is to provide both data integrity and data resiliency for each data byte. The data integrity capability includes robust data validation with quantitative error detection at the micro level. The data resiliency capability includes a quantitative error correction capability for multiple random bit errors and a quantitative two, three or four-way dispersal method for single and dual erasure recovery also at the byte level. It is also a primary object of the invention that all aspects of the composite error control method work for serial and parallel data formats including the capability to work for specific two-dimensional data and device configurations. The more capable and flexible the method the more useful and ubiquitous it can become within a large system and within the industry.
Refer to
The invention relates to error control coding of byte quanta data. The 8-bit byte is the lowest common data size typical in the vast majority of data processing, communication and storage equipment. The invention brings data validation, error detection, error correction, mirroring and erasure recovery into a single composite method at the micro, byte quanta, level. This flexibility provides improved data integrity and resiliency methods that benefit many critical data applications.
The invention has application in the fields of corporate business continuity and disaster recovery, ultra-resilient storage arrays for space, medical, financial, home and other mission critical applications and resilient distributed messaging within data system networks, routers, switches, directors, adapters, appliances, mobile devices and communication channels.
The invention also enables error and erasure correction over two dimensions of aggregated data bytes. While the preferred embodiment describes a single dimensional RAID application the two-dimensional column and row method enables a new method for future applications such as memory device technologies with initial inherent high error rates. Note that this error control code can simultaneously do erasure recovery in two dimensions on data as opposed to some existing error control codes that construct codewords by calculating parity in two dimensions.
Since the invention performs error detection, error correction and erasure recovery at the data byte level there is sufficient flexibility to incorporate these capabilities in an end-to-end fashion across a system fabric including data channels, messaging planes, routers, storage switches and storage devices.
High speed switched parallel connections are common in modem computers of the variety called scalable servers. These machines rely on a very small number of ASIC types per system design. There is typically only one or two ASIC types beyond the processor chip itself. It is possible to have a single large hub ASIC for the interface to the processor, memory, I/O and system interconnect ports. The bandwidth of the system interconnect ports is critical in that remote memory data references must transit this network. At the same time it is advantageous to have as many ports as possible in order to expand the connection fabric in as many dimensions as possible without having to rely on external router ASICs. In the largest of systems it is necessary to have it all; high bandwidth ports, several system interconnect ports at the node level and external router ASICs to further expand the system fabric. In these larger systems the interconnection fabric becomes a significant aspect of the total hardware cost, system reliability and maintenance strategy.
The recently developed HyperTransport channel is one example of a high-speed parallel system channel. HyperTransport is intended to support a wide range of applications including routers, hubs, switches, servers, workstations, PCs, desk tops, mobile game consoles, hand-held devices and embedded systems. The HyperTransport channel can be 2, 4, 8, 16 or 32 bits wide with transfer size in multiples of 4 bytes. It expects three predominant error modes; a data line error, a clock (frame) error and a window (single symbol) error.
Table 1. Codewords denoted as row elements.
Table 2. Decoding lookup translation table for row couplets.
Table 3. Codewords denoted as column elements.
Table 4. Decoding lookup translation table for column couplets.
Table 5. is the error pattern table for the 16 single bit random errors and 120 double bit random errors.
It is noted by Berlekamp that the factors of Q(17) (x) are a pair of degree 8 irreducible self-reciprocal polynomials capable of performing error correction. These factors are g1(x)=1+x3 +x4+x5+x8 and g2(x)=1+x+x2+x4+x6+x7+x8. While each of these irreducible polynomials work equally well the patent application will nominally refer to g1(x). The ECC byte is determined by dividing the data byte by one of the irreducible polynomials g1(x)=1+x3+x4+x5+x8 and multiplying by x8. The register labeled 200 is first cleared to all zeros prior to the operation. Each data byte is divided by the polynomial g1(x)=1 +x3+x4+x5+x8 and multiplied by x8 by inputting the data byte serially into the x8th exclusive-or position 201, of the 8-bit feedback shift register labeled 200. The residual data, after all 8-bits are input becomes the ECC value. The example in
It is desirable for the error control code to provide robust data integrity and for data to be verified/validated at a micro level to a known criteria. This is of particular value to the financial industry that is held accountable for mistakes. Data is validated at the byte level to the limit of the error detection specifications of the ECC as noted. The two polynomials expressed as examples have marginally different error detection characteristics.
In general for the best codes with codeword length=n, information bits=k and Hamming distance=d the following is true:
For short codes the code will detect all error bursts of length=k. The composite method will: detect t=d−1 random bits in error; detect all odd number of bits in error; and correct t=(d−1)/2 random bits in error.
The Hamming distance noted by Berlekamp for the invention's preferred ECC is d=5. Therefore each codeword for this invention will have the following set of known mathematical capabilities: detect all data bytes in error, k=8; detect t=5−1=4 random bits in error; detect all odd number of bit errors; correct t=(5−1)/2=2 random bits in error; and correct a single data bit in error simultaneously with a single ECC bit in error.
Each codeword can self detect and self correct errors per the following procedure:
In the actual operational table they are simply 1 bits in the codeword positions that require exclusive-or bit toggling to effect correction.
It is also desirable to keep a part of each codeword packet a copy of the original clear data. Some users and application developers distrust methods that modify users' data fearing potential data loss or corruption. The invention has the option of using the ECC byte as a mirrored "proxy" for the data, which can be translated to clear data whenever desired. There is a one to one translation between data and ECC so there is little chance for loss or corruption if used in this manner. The data byte and ECC byte can be configured into 4 bit×4 bit codeword arrays and dispersed in either row, column or both dimensions and when viewed as an array the method can also perform dual 4-bit row or column erasure recovery. It is shown:that for each-codeword there arc 12 possible combinations of row and column elements called couplets capable of mirroring the data byte. See
Given a data byte [Di]=d0d1d2d3d4d5d6d7 construct an ECC byte [Ei]=e0e1e2e3e4e5e6e7 via the self-reciprocal irreducible polynomial g1(x)=1+x3+x4+x5+x8 or g2(x)=1+x+x2+x4+x6+x7+x8. The codeword for each data byte becomes [CWi]=[Di][Ei]=d0d1d2d3d4d5d6d7e0e1e2e3e4e5e6e7 where i is the ith information byte in the datagram. With ts=the data byte and vu=the ECC byte and st,su,sv, tu,tv, and uv, are row couplets mirroring the data byte [Di]=st and wx, wy, wz, xy, xz and yz are column couplets also mirroring the data byte [Di]=st. [Di] is found by boolean evaluation or table look-up method given any row or column couplet. It can be said that all couplets mirror all other couplets. Via the inherent capability of the ECC all codewords [CWi]=[Di][Ei] have self error detecting capabolity. Via the inherent capability of the ECC all codewords [CWi]=[Di][Ei] have 2-bit random error correcting capability.
While the table look-up method is likely preferred for software or firmware implementations, applications that can embed boolean translations into integrated circuits or programmable logic arrays can achieve the fastest possible line speeds.
Consider the codeword in array form. If we know wx=d0d4 e0e4 d1d5 e1e5 we can find yz=d2 d6 e2 e6 d3 d7 e3 e7 by combination and substitution using the ECC equations of
The ECC values for all 256 possible data bytes can be computed once and saved in a list or table for look-up. They are summarized as follows for columns and rows.
For G1(x)=1+x3+x4+x5+x8
Given the data byte, the error control code byte can be evaluated via the following set of equations.
Given the error control code byte, the data byte can be evaluated via the following set of equations:
Data can be evaluated from column couplets (for generator polynomial g1(x)=1x3+x4+x5+x8):
[The plus sign, +, denotes the exclusive-or boolean logic operator, d are binary data bits and e are binary ECC bits]
Data can be evaluated from row couplets (for generator polynomial g1(x)=1+x3+x4+x5+x8):
Given the data byte, the error control code can also be evaluated via the following set of equations.
Given the error control code byte, the data byte can be evaluated via the following set of equations.
Data can be evaluated from row couplets (for generator polynomial g2(x)=1+x+x2+x4+x6+x7+x8):
[The plus sign, +, denotes the exclusive-or boolean logic operator, d are binary data bits and e are binary ECC bits]
Data can be evaluated from column couplets (for generator polynomial g2(x)=1+x+x2+x4+x6+x7+x8):
ti d0=d0st,su,sv or (d4+d5+d6+d7+e2)tu or (d4+d7+e4+e5)tv or (e0+e2+e5+e7 )uv
These two sets of equations become a mathematical proof of the dual erasure capability of the error control method. They show that given any two elements (rows or columns) and the initial ECC equations the remaining two elements can be evaluated by algebraic methods. In a hardware logic design the terms in each of the eight lines are evaluated with 5-input exclusive-or gates and multiplexed via a 6-input mux. Both the column and row implementations require only 24 5-input exclusive-or gates and eight 6-input muxes. In a single dimensional application such as a RAID storage design only the column or row design would be needed. This is extremely efficient logic to accomplish dual erasure recovery.
A second exhaustive proof can be realized by constructing from
A significant object of the invention is to complement the erasure recovery method of utilizing an identical ECC polynomial and identical codeword construction, with the random bit error correction capability. This provides solutions to systems, which may be disposed to both erasure and/or random error modes, a composite and complete error control recovery procedure.
Consequently both error correction and erasure recovery can simultaneously be integrated into most application solutions. These byte level micro-mirrors outperform conventional mirroring in that each byte and its ECC mirror can self-detect and self-correct random errors. And when codeword arrays are dispersed in row or column direction or arrayed in two dimensions any one of twelve mirrored couplets can self-recover the data byte provided the identity of the couplet is determined. The invention outperforms conventional mirroring again by recovering all dual erasure combinations within four elements of a codeword. This enables many new kinds of erasure recovery including new RAID methods and new disaster resistance and disaster recovery methods. It is noted that the ECC byte also provides superior and quantitative error detection capability.
Another object of the invention is to minimize the amount of computation for encoding, decoding and reconstruction when the correction and erasure logic can't be implemented in hardware logic. A simple table lookup procedure can efficiently perform the encode, decode and reconstruction processes. A 256-word×16-bit translation table is used for encoding and a 256-word by 64-bit table is used for ECC translation and the decode of all erasure corrections. When tables are used no logic or arithmetic operations are required as the entries represent final results.
While specific new implementations may prefer to integrate the inventions boolean equations into application specific:logic-it is possible to retrofit existing systems with a total software or firmware implementation. It is an object of the invention that both software table lookup and hardware boolean logic implementation methods are available.
It is an object of the invention that degree 8 polynomials other than those noted could be used to obtain very similar results. It is an object of the invention that hardware implementations make use of the boolean equations noted earlier in the summary for encoding, decoding and reconstruction. Different equations with very similar capabilities exist when using the polynomial g2(x)=1+x+x2+x4+x6+x7+x8 or other capable polynomials. It is also noted that the codewords can be arranged in different configurations without changing the overall capabilities.
It is essential to compare this to conventional mirroring. Consider mirroring a single data byte A with a duplicate byte A′. If a bit in both A and A′ becomes corrupted it would be inherently impossible to know which byte, A or A′, is correct. In fact neither would be correct. Now consider the new method with data byte A and it's mirrored ECC byte B. Again assume that a bit becomes corrupted in both A and B. Now bring A and B together and they self-determine that error(s) exist then self-correct the error bit in each byte. A mirrored data file can do this for each successive data byte. Likewise mirrored devices can be compared and errors corrected at the sector or block level. These capabilities are objects of the invention.
Also consider two storage devices A and B conventionally mirrored with two other devices A′ and B′. There are now four devices; A, A′, B and B′. Should two devices fail there are six possible failure combinations; AA′, AB, AB′, A′B, A′B′ and BB′. Two of these combinations AA′ and BB′ will result in lost data. The invention hasn't any such limitations. Any two of four units can incur catastrophic failure without loss of data plus multiple units can incur numerous random errors that can be error corrected at the byte level. These too are objects of the invention.
Since certain mission critical applications rely on triplicate redundancy for resiliency it is imperative to compare with the inventions data array extended via a second ECC byte (qr) as follows:
Consider a dual-element data set [st] conventionally mirrored by two additional data sets [uv] and [qr]. A system with this much redundancy must anticipate more than two potential failures before corrective reconstruction can be scheduled. Consider the effects of three and four failures. Clearly five failures within a six element system results in a catastrophic loss of data. For conventional triplicate redundancy there are two combinations of three failures out of the 20 possible combinations that would result in a catastrophic loss of data. They are [suq] and [tvr]. Likewise there are 6 combinations of four failures out of the 15 possible combinations that would also result in a catastrophic loss of data. They are [tvqr], [tuvr], [suqr], [suvq], [stvr] and [stuq]. Simple triple redundancy appears to have substantial mathematical deficiencies with eight failing combinations.
The invention can disperse rows q, r, s, t, u and v and recover all but three combinations of 1,2, 3 and 4 element failures. Random dual bit error correction and data validation is possible as with the inventions four element dispersal method. It is also an object of the invention to pennit dispersal of 4-bit column elements m, n, o and p.
Another object of the invention is that it can be used for disaster recovery data protection with approximately the same simplicity and efficiency as RAID-1 mirroring. Mirroring for disaster recovery often includes RAID-1 mirroring of RAID level 3 or 5 arrays. This reduces conventional mirroring efficiency to approximately 40%. The invention's efficiency remains at 50% for the four-element dispersal method with micro-level dual erasure and dual random bit correction functionality.
It is possible to shorten the array by removing either a row or a column limiting the dispersal to three channels or devices and the erasure capability to one element. This is comparative to RAID-3 or RAID-5. Positive attributes include an increase in efficiency to 67% and an increase in inherent array reliability due to one less device.
The encoding of the three element codeword array is exactly the same as for the four element codeword array with a row or column removed. For explanatory purposes assume the array has the first three rows "s", "t" and "u". The "v" row is left off. Included are the data byte and half of the ECC byte. The array size is now 3×4 bits.
There are two methods for single erasure recovery. The first is exactly as with the four element array where if only one element is identified to be in error or missing a fourth is also assumed missing as two available elements are necessary and sufficient to effect erasure recovery of two missing elements. The missing element and the last row, the "v" element, could both be assumed to be missing. Either the equations or the Table look-up procedure recovers the original data byte and/or codeword.
One of the preferred embodiments is a double rank of four devices. The data bytes are accumulated and stored on the first rank and the ECC bytes are accumulated and stored on the second rank. An object of the invention is that the recording of the ECC bytes can be disjoint from the data and can lag the recording of the data bytes. This permits separate sectors and files to be recorded on single devices like RAID-5 data. There are of course consistency issues that have to addressed when operating in this manner. This is also possible in a four-device array utilizing row dispersal.
And yet another object of the invention is a dispersal method that leaves insufficient data on any single disk or perhaps at any single site for a potential security breach if a device were to fall into the wrong hands. The return of broken disk drives for repair or replacement can put secure data at risk. The invention disperses only 2 data bits and 2 ECC bits in each codeword element for column dispersal and either 4 data bits or 4 ECC bits in each codeword for row dispersal.
Another object of the invention is to achieve fast random access to data across a 4-wide disk array by reading the first 2 of 4 disk drives to access distributed data. Original data can then be recovered faster by translation than by waiting out the latency of the remaining two units.
A further object of the invention is a disk array optimized for dealing with the bathtub reliability curve for disk drives. It is known that the reliability of disk drives is lower in the first months or few years of operation, rises to a plateau for most of the remaining life then falls off rather abruptly as it approaches end of life. A 4-drive array capable of handling dual erasures can optimize data center costs and availability by configuring 2 new or older units with 2 mid-life high reliability units. When the older units near end-of-life, they are replaced by new units in this phased approach.
A further object of the invention is that the codeword packet can be developed over time and stored in dispersed locations and on disparate media. For instance the data bytes could be stored on disk drives for fast random access performance and the ECC bytes could be on tape. Another strategy is to have the data bytes on disk and the complete codeword distributed across 4 tape cartridges. Reading any two tape cartridges successfully would recover data bytes lost on tape or disk. Backup to tape could occur overnight when the disk files see potentially less activity and snapshots of data are easier.
Another object of the invention is to allow discretionary use of the method permitting it to coexist on other arrays such as RAID-0 or RAID-1 JBOD Oust a bunch of disk) arrays. The attribute of encoding 2-byte codewords that can optionally be divided into two parts and stored separately maximizes this flexibility.
While the present invention consistently shows a data byte distributed equally across all four elements of an array it is not the intention of the invention to restrict higher level hardware, software or firmware from distributing records, sectors, files or data bases onto individual elements of the array. The invention simply makes it possible to distribute each byte over the array for security concerns.
Another object of the invention is that data can be dispersed to four devices then during read back the four data segments are assessed as to which devices need recovery and whether the error correction or the erasure recovery method should be used. Also it may be advantageous that device groups can fluctuate between two and four units as resiliency requirements change. In a virtualized system all devices can be non-arrayed and the application or file system decide on the resiliency level and choose to disperse data to two, three or four devices. Also it may be advantageous to migrate data first to two devices, one containing data and the other ECC bytes then later migrate data to "s" and "t" devices and ECC to "u" and "v" devices.
It is also an object of the invention that the combination of flexible mirroring attributes, multiple polynomial choices and error correction and dispersal capabilities could lend the technology useful for cryptographic coding.
Yet another objective of the invention is that it have the flexibility to correct error bytes or erasure bytes when the codeword elements are dispersed across other than 4 channels. One object is to correct single bursts or erasures when long sequences of w, x, y and z column elements are concatenated in series on a serial channel. Consider sequences of Nw+Nx+Ny+Nz codeword column elements where N is the expected burst error length. A CRC is optional at the end of each element sequence in order to help identity sequences in error. The receiver can tolerate any two sequences out of four being missing or unreadable thus recovering either from long burst errors or errors that straddle segment boundaries. An error burst that straddled the w and x sequences for instance would appear as 2N dual erasure errors. The serial scheme applies to serial copper and fiber-optic cable or wireless communications channels that experience periodic long error bursts. Data validation and transient error detection and correction capabilities all continue to work in the serial fashion.
A further preferred embodiment of this disclosure is a computer or storage network with both error detection and correction capability. Clusters of processors or devices are connected together via a system of routers and links. Links can be either serial or parallel in width and either copper or optical in media. An object of the invention is for the error control method to work for any link width. Note again
A principal object of the invention is to provide an error correction method for channels that currently implement the ARQ, automatic retry on request, algorithm for error recovery. The most simplistic embodiment of this invention-permits an equal size retry packet of ECC bytes be transmitted on a negative acknowledge (NACK) and either be translated into data if transferred successfully or be used in conjunction with the previously received data packet for the error correction process.
A further object of the invention for ARQ recovery with error correction is that each data byte codeword can sustain multiple random errors that are correctable.
A further object of the invention for ARQ recovery with error correction is that it self-detect and self-correct for a permanent data line failure. This is quantified to a single bad line per each 8-bit width increment and can therefore be scaled to larger widths with more bad data lines. Note that when implementing the erasure method, along with ARQ, multiple line failures become recoverable.
A further object of the invention is to show that the same technique used to provide resiliency for a single network link can be implemented in a sequentially distributed manner to produce an active cable capable of self-detecting and self-correcting errors as they occur along its length.
An object of the invention for ARQ type channels with data packets formatted for erasure recovery as shown in
An additional object of the invention for ARQ-type channels with data packets formatted for erasure recovery as shown in
Sometimes it may be advantageous to disperse data across multiple physical links. It is an object of the invention that data dispersed across different links can be reassembled, verified/validated and even error corrected if necessary. This would be applicable for dispersed storage data or data transmitted within computer system fabrics as pictured in
Another object of the invention is that data created at a processor or read from storage can be encoded once then be viable for error detection, error correction or data dispersal as required by various elements within the system other than the end points. The data can be moved about within the system or forwarded to: other systems and continuously be ready for validation, error correction or erasure recovery.
Yet another object of the invention is that pairs of 64-bit words made up of 8 data bytes and 8 ECC bytes respectively can be made resilient to memory chip failure. This is an example embodiment of the form of what is in general referred to as a Chip-Kill method permitting fail-safe operation after the catastrophic loss of a memory chip. 8-bit wide memory chips distribute all eight bit 0 bits to chip 0, all eight bit 1 bits to chip 1, all eight bit 2 bits to chip 2, etc. This is done separately for both the data and ECC words. If the chips are 16 bits wide connect all 16 bit 0 bits to chip 0, etc. Since the data/ECC codewords can self-detect up to 4 random bit errors and self-correct up to 2 random bit errors a single memory chip can fail without the loss of memory data. Even though the efficiency is only 50 percent a PC or data application that could run at half speed until maintenance is performed is better than no capability at all. The erasure recovery mode can also implement Chip-Kill but requires more special formatting of data.
Yet another object of the invention is the capability to construct both scalar and vector processor instructions to facilitate the fastest possible encode, decode, error detection, error correction, erasure recovery and codeword reconstruction. For the most complete end-to-end implementation for the sake of resiliency a processor should encode data just as it has been created and before it ever goes to memory. Special instructions can capture data within processor registers, encode the data into codewords and distribute the data to four separate sections of memory. In similar fashion processor instructions can read data from memory and evaluate data from ECC or dispersed codeword element pairs (couplets) and validate or perform error correction on retrieved codewords. At the receiving or retrieval end data should be decoded and evaluated at the last point and instance prior to being used. Special instructions would include a minimal functionality: set/select generator polynomial value(s); set/select dispersal mode; data byte and ECC byte, 4-bit row elements or 4-bit column elements; set/select function mode(s); validate, error correction, erasure recovery; generate codewords from data bytes and disperse to buffers in memory; merge received elements into couplets, evaluate desired couplet (nominally data) and write to memory; merge data and ECC fields, validate and/or correct random errors then write data and error pattern to memory; and merge received codeword, validate and/or correct random errors then-write data and error pattern to memory.
All in all it is an object of the invention to provide a concept for protecting data at a micro level that uses a unified composite capability that includes data validation, error detection, error correction, mirroring and erasure recovery. While the discussion is centered on byte quanta coding for flexibility and low cost of implementation the method should scale to other data sizes that are important to specific applications. Likewise ECC codes other than those identified here are also capable of producing similar results for erasure control and error correction.
Refer to
The example shows how three 8-bit data bytes are encoded, dispersed and recovered in the presence of dual element erasures. Two of the four devices/locations are assumed to become unavailable. The method works for any number of data bytes. In the disk drive example there would nominally be 256 or 512 bytes recorded on each physical device sector. In the case of data dispersal to remote storage sites data might be dispersed in encoded files that could range from the very small to the exceedingly large. The method of the invention works at the micro level, one byte at a time.
Refer to
The example data bytes are 47, D2 and 1F hexadecimal. Table 1 is addressed with 47 to obtain the 16-bit codeword 113C hexadecimal. A 1 (0001) is dispersed to drive w, another 1 (0001) is dispersed to drive x, the 3 (0011) is dispersed to drive y and the C (1100) is dispersed to drive z, item 300. The procedure is repeated for the second and third data bytes.
The four-drive array shown in item 310 with Xs across drives y and z noting that they have failed or are otherwise assumed to be unreliable or are perhaps not yet READY for the read operation. Within the four-drive array there are six combinations of possible drive pairings; wx, wy, wz, xy, xz and yz. If both drives y and z are unavailable then the pairing of drives w and x is the only choice. The data is read from drives w and x and assembled into the 8-bit wx couplet. The wx couplet is then used to access Table 2, field wx, for the corresponding mirrored data byte. For the first data byte couplet wx is 11 hexadecimal and produces 47 hexadecimal from Table 2, field wx. The process is repeated for the second and third data bytes. Dual erasure recovery has been achieved.
The fastest method for hardware logic designs arc the column and row erasure equations listed in this section of the disclosure titled Data evaluated from column couplets using generator polynomial g1(x)=1+x3+x4+x5+x8. These equations can also be implemented via specialized scalar and vector processor progranuned instructions. Since we know wx=d0 d4 e0 e4 d1 d5 e1 e5 we can find yz=d2 d6 e2 e6 d3 d7 e3 e7 by combination and substitution usi the EGO equations of
Again we find the recovered data=47 hexadecimal and dual erasure recovery has been accomplished correctly.
When only a single unit becomes unavailable there are three choices for addressing the recovery table. If drive y were unavailable, then data from drives; wx, wz or xz could be used for data recovery. If the application's reliability requirement doesn't demand dual erasure capability an array of only three drives will suffice.
In the nominal case all four disk drives are fully operational and dual simultaneous read streams are possible using the dual recovery method to mirror two sets of clear data. When row dispersal is chosen no recovery is required for the st couplet pairing as it is the original clear data byte. This is a valuable attribute for data applications that are read intensive. A further performance attribute is the ability to read the first two of four devices to access data.
The reconstruction of data for rebuilding either one or two replacement devices is very simple relative to other methods. As with the recovery process previously explained the data from a minimum of two drives must be read successfully. Each successive couplet, either row or column, can be used to address the corresponding recovery table which will return the true data byte value. The data byte can then be used to address the codeword table, Table 1 or Table 3, which will return the whole codeword or it can address the recovery table to obtain the ECC byte. A separate table for 1-step reconstruction can be used that will return the codeword when addressed by the couplet. The codeword is then masked for the one or two row or column element for distribution to the respective drive(s) under reconstruction. The erasure recovery equations may again be the best implementation choice for hardware implementations. Specialized scalar or vector processor instructions using the boolean equations are also applicable.
The data recovery process is somewhat more tedious for the 8-drive array as data from 4 drives need to be read in order to aggregate two ordered column couplets for the recovery procedure. Once the elements are assembled recovery proceeds as with the 4-drive array in
The ECC rank can also be written on separate cylinders of the same disk drives or perhaps even recorded on different media such as tape depending on the application and the specific requirements. It is also possible to first record the data bytes and later (perhaps overnight) generate and record the ECC bytes. The combination of data bytes and ECC bytes enable the dual erasure and error correction capabilities regardless of the location of the two elements or the order and time in which they were created.
The preferred embodiment for the invention when used for disaster recovery of industrial and government databases would be to disperse the column elements of each codeword to four separate secure sites. No site would have sufficient information to recreate data. Any two sites or any site with reliable access to any two sites would have sufficient information to recover data. Any drive or media failure could possibly be discarded without concern of it causing a breach of security.
The present invention's attribute of both-column pair and row pair erasure correction affords a small set of data sharing rules. It is possible to allow users access to various row and column information such that they can share data with only certain other users.
The second primary embodiment of the invention adds data line failure resiliency and error correction to links of a scalable server or storage area network fabric. Consider the computer system fabric sketch of
Consider the simplified data packet of
Consider the elements of
Once the data packet exits the CRC Checker, item 705, it is buffered in the Data Buffer In logic block, item 700. If no data packet CRC error is detected at the node input the buffered data packet can be moved into the node, item 760. Here again it is prudent to reverify the CRC as the data packet can possibly be corrupted in the buffering process. The data passes from data buffer, item 700 to the node, item 760, through the second CRC Checker, item 730. If a CRC error is detected the Message Control In logic block, item 715, is again signaled to reply to the transmitting node with a NACK signal. A CRC error occurring at either CRC Checker will flag the data packet to be in error at the node, item 760. If no CRC errors have been detected the Message Control In logic block, item 715 replies to the transmitting node with an Acknowledge signal.
Automatic Retry Request, ARQ, signal protocol for transient error correction causes the next data packet to be transferred upon reception of an ACK signal and a retry/resend of the previous data packet upon reception of a NACK signal. Consider the node output in closer detail. There is a Data Output Buffer, item 770, which buffers at least one two data packets followed by a CRC generator, item 780. A Message Control Out logic block, item 775 receives both ACK and NACK signals from the upstream node. As described above an ACK causes the next new data packet to be transmitted while a NACK will cause the Data Output Buffer, item 770, to resend the previous data packet. The circuit so far is only capable of retries effecting recovery of transient errors.
The explanation block 795 details the encoding of ACK and NACK signals. Effectively there is no special encoding at this level, an active ACK line translates as an ACK and an active NACK line translates as a NACK. Setting both ACK and NACK is not applicable and disallowed.
Consider the data packet [D], item 900 in
Had the ECC packet [E] 1010 transferred;without error the CRC check would have determined this correctness. When this occurs it is advantageous to forward the ECC packet 1010 to the ECC to Data Converter logic block
The Mux In logic block,
The explanation block
The process flow depicted in
Step 1285 sends ACK and NACK signals requesting a retry of the previous data packet then advances to step 1225.
It is an object of the invention to utilize both erasure recovery method and the random bit error correction capability providing solutions for systems that may be disposed to both erasure and error modes. Consider the data packet [D] 1300 in
More complex packet formats that support the erasure recovery method can also support error correction. Note in
Consider the
So far the preferred embodiment has shown data dispersed within a packet on a single link. It is also an object of the invention to disperse data across multiple physical links. Data dispersed across multiple links can be reassembled, validated, error corrected and if necessary recovered by the erasure methods. This would be applicable for dispersed storage data or data transmitted across computer system fabrics as pictured in
Refer again to the codeword in binary array form as in box 120 of
Referring now to
Referring now to
Referring now to
Referring now to
All patents, patent applications and printed publications heretofore cited in the present application are incorporated herein by reference.
The foregoing has been a description of a novel and non-obvious data encoding and decoding method and apparatus. The description provided is give as an example of the invention and is not intended as a limitation of the invention. The applicant describes the scope of his invention through the claims appended hereto.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
After a mysterious woman confesses to an author simply known as "R" that she has loved him since she was a teenager, she offers the following explanation: "There is nothing on earth like the love of a child that passes unnoticed in the dark because she has no hope: her love is submissive, so much a servant's love, passionate and lying in wait, in a way that the avid yet unconsciously demanding love of a grown woman can never be." This theme of a child's submissive love runs throughout Stefan Zweig's story collection Letter from an Unknown Woman and Other Stories.
In the title story, which kicks off this collection, a woman sends a letter to "R" for his birthday, announcing that her son has died and that his receipt of her letter means that she has died as well.. . .
Floating around the internet amid the hoopla of a new Haruki Murakami release, you may have come across a certain Murakami Bingo courtesy of Grant Snider. It is exactly what it sounds like, and it's funny because it's true, to a certain extent: Murakami, for better or worse, has a particular style, and with it come the trappings and clichéd Murakami-isms that, as a fan, you come to both love and loathe about the 65-year-old writer. He has become the master of a certain kind of metaphysical mystery wrapped in urban ennui. You're either on board (like me), or you aren't (like a certain editor of this website).
But anyone attempting to play Murakami Bingo with his latest novel, Colorless Tsukuru Tazaki and His Years of Pilgrimage, is going to lose. There are no parallel worlds, talking animals, or. . .
The publisher's blurb for Oleg Pavlov's The Matiushin Case promises the prospective reader "a Crime and Punishment for today," the sort of comparison that is almost always guaranteed to do a disservice to both the legendary dead and the ambitious living. Predictably enough, The Matiushin Case is nothing like Crime and Punishment, although anyone familiar with Russian literature can see how Pavlov gamely attempts to tick off certain boxes that are often associated with Serious Russian Themes: the unflinching examination of even the darkest corners of human existence, the exploration of wider social themes and problems through the careful depiction of individual experience, all heralded by a Biblical epigraph—"Am I my brother's keeper?"—to signal the novel's soul-searching, philosophical designs. For anyone who loves Russian literature, as I do, all of these elements are entirely welcome, but in Pavlov's hands, the. . .
One hundred years have passed since the start of World War I and it is difficult to believe that there are still novels, considered classics in their own countries, that have never been published in English. Perhaps it was the overwhelming number of novels in English in the years following the war that prevented their appearance. Just looking at the list of American authors, a country whose contribution was quite short, Wharton, Cather, Cummings, Faulkner, Dos Passos, and of course Hemingway with A Farewell to Arms, makes it obvious that it was a subject that once had to be written about. Still, that doesn't explain why perhaps the most famous WWI novel is from Germany, Erich Maria Remarque's All Quiet on the Western Front. Maybe it was that a second even more devastating war eclipsed the first one, and. . .
In the London of Hédi Kaddour's Little Grey Lies, translated by Teresa Lavender Fagan, peace has settled, but the tensions, fears, and anger of the Great War remain, even if tucked away behind stories and lies. Directly ahead, as those leftovers of the war simmer to a boil, is World War II. Little Grey Lies is a war novel without war, and about the inevitability of the next. War is a filter over the book, it is life in the inescapable aftermath of war, not the destruction, not the loss of life and property, but instead the constant memory, the subconscious, ongoing afflictions. In that space, it is the intricacies of personal connections, of secrets and the desire to out them, that become the conflicts.
Max, the character we spend the most time with, is a journalist and the book is. . .
One of the greatest services—or disservices, depending on your viewpoint—Bertrand Russell ever performed for popular philosophy was humanizing its biggest thinkers in his History. No longer were they Platonic ideals, the clean-shaven exemplars of the kind of homely truisms that might've been found in commonplace books: they had become eccentrics, weirdos, freaks. This was a transformation Russell's readers might have felt privileged to witness. Then again, they might have been horrified.
Sigizmund Krzhizhanovsky has done something similar with ideas, both those belonging to Russell's eccentrics and those roaming about in other fields. Written between 1922 and 1939, the short stories collected in Autobiography of a Corpse wriggle into the liminal spaces between fiction, reality, and the world of ideas: in fact, there's even a story called "The Collector of Cracks."
Krzhizhanovsky is fundamentally concerned with how fiction and reality influence each. . .
The best way to review Alejandra Pizarnik's slim collection, A Musical Hell, published by New Directions as part of their Poetry Pamphlet series, is to begin by stating that it is poetry with a capital P: serious, dense, and, some might say, difficult. Take from that what you will, but I'm going to follow an idea from Julio Cortázar who, in a letter to Pizarnik (reprinted as a preface to this collection), wrote: "You've heard of this reviewing method where you page through a book and cite various verses and passages, then make some comment to praise or shoot it down? I don't care for this sort of thing." Okay, point taken, Sr. Cortázar. I'm going to avoid that kind of review this time and try to capture instead the impression of Pizarnik's art, a truly foolish endeavor on my. . .
Upon completing Albertine Sarrazin's Astragal I was left to wonder why it ever fell from print. Aside from the location, Astragal could pass as the great American novel. Its edginess and rawness capture the angst and desires we all had in our 20s, while still bearing a literary feel that is more thought provoking than The Catcher in the Rye. Perhaps this is why Patti Smith, as described in the introduction, carried around the work in her travels for so many years.
Astragal begins in a disruptive and disjointed style, evolving into a tragic love story and ending with the empowering breakup. The anti-heroine, Anne, escapes from prison only to injure her ankle after jumping from the prison wall. From there she crawls to the road, where she is picked up by a criminal, Julien, and taken to a defunct brothel. . .
When my eyes first crossed the back cover of Fabio Genovesi's novel Live Bait, I was caught by a blurb nestled between accolades, a few words from a reviewer for La Repubblica stating that the novel was, however magically, "[b]eyond any cliché."
Generally, I'm a suspicious reader; big claims scare me off. Having never watched a Fellini film and with only Calvino and Pavese as literary signposts, I entered the novel (guided by veteran translator Michael F. Moore) with a healthy amount of skepticism. Just a few chapters in, however, I knew that even if Genovesi hadn't managed to overcome cliché, he had indeed created an electric book, a book that stirs, and one that you can't help living—and living with—along the way. It's fair to say that Genovesi's English debut touches all the right spots and echoes back just. . .
"I preferred the war to the plague," writes Curzio Malaparte in his 1949 novel, The Skin. He speaks of World War II and the destruction it has wrought on Italy, the city of Naples in particular. But the plague he refers to is elusive. "It was a kind of moral plague, against which it seemed that there was no defense."
The Skin is Malaparte's description of this moral plague. He writes about a character of the same name who accompanies a band of Pollyannaish American soldiers as they go about Naples acting as both conquerors and liberators. He bears witness to the variety of horrors that come at the end of a long war: starvation, slavery, casual murder, careless disposal of the dead, and the caustic nature with which the rich feed upon the poor (both literally and metaphorically), to name. . .

subset: commoncrawl


text:
September 26, 2002
Landmarks Commission Blocks Demolition, Saving Modern Theatre
BOSTON, MA — In another victory for local preservationists, the Boston Landmarks Commission voted on Tuesday to block the demolition of the Modern/Mayflower Theatre paving the way for its renaissance alongside the Opera House and the Paramount Theatre.
According to the Boston Globe, the Boston Redevelopment Authority is now working to purchase the theater from the Levin family or take it by eminent domain. Work on the theater is estimated to cost $5 million and could bring the theater back to life as a mixed use venue for movies and live performances.
Meanwhile, the $15 million restoration of the Paramount's interior is about to get underway, and the Opera House, which won its court case this week, should soon begin a $30 million expansion, renovation, and restoration project.
Foundation To Support Senator Theatre; Expand Operations
BALTIMORE, MD — Through a series of strategic legal and financial moves, the Senator Theatre will soon be leased and operated by a non-profit entity, the Senator Theatre Foundation, which will also assume operation of the long-shuttered Rotunda twin theater nearby.
According to the Baltimore Sun, the moves will help keep the Senator Theatre afloat and will give its operator, Thomas Kiefaber, a move-over house in the newly renamed, Rotunda Cinematheque. When the system is in place, the Foundation plans to show first-run films in the Senator and then move them over to the Rotunda.
The plan has been in place for nearly a year pending funding which is now coming in the form of a bank loan, half of which has been secured through the city of Baltimore. The theaters will be run by the newly formed foundation which is currently pending IRS approval. With the Rotunda, the Senator should be able to book more first-run movies by giving them a longer life with both theaters in operation.
The Rotunda closed last year as part of Loews Cineplex' bankrupcty reorganization. The Senator, meanwhile, is one of the best presentation movie houses in the country and has a cult-like following amongst its celebrity and everyday patrons. These moves should help future generations enjoy this Art Deco movie house treasure.
September 25, 2002
Hawaii Theatre Posts A Profit; Plans Restoration
HONOLULU, HI — The Hawaii Theatre has finally posted a profit in its sixth year of operation after reopening in 1996 following a seven year restoration effort. According to the Pacific Business News, the theater ended the fiscal year with a net profit of $178,000 and has reduced its outstanding debt to $1.5 million.
The theater's $10.5 million capital campaign recently received a $500,000 Kresge Foundation grant and $1 million from the state and is now within $2 million of completion. With the funds, the theater hopes to first pay down the remaining debt and then restore the exterior of the former movie palace and install a new "movie marquee".
The Hawaii Theatre was originally opened in 1922 by Consolidated Amusements which operated the theater until 1984 when it was finally shuttered. Saved from the wrecking ball, the theater was carefully restored and then reopened as a performing arts center.
No Fat Lady Singing At This Opera House
BOSTON, MA — The final legal hurdle has been removed in Clear Channel Entertainment's battle to restore and reopen the aging Opera House/Keith's Memorial in Downtown Crossing thanks to a Superior Court judge who ruled in favor of the city and against a condominium complex which had sought to block the theater's expansion efforts.
According to the Boston Globe, with the ruling, Clear Channel now plans to spend $30 million to redevelop, renovate, and restore the 2,500-seat palace into a venue for touring Broadway productions. The theater has been closed for over a decade and is need of substantial repair.
The early Thomas Lamb theater was built as a memorial to B.F. Keith and was a popular vaudeville venue for years. The theater later switched to movies as part of the RKO circuit and was the jewel of the Sack Theatres empire when it was known as the Savoy.
It was taken over by Sarah Caldwell in 1991 as a venue for opera, but the project ran out of money and the theater has changed hands and arrangements several times over the last decade. It appears, thankfully, that the Opera House will be back and better than ever.
Mayor Thomas Menino, who helped spearhead its revival, is proving to be one of the best friends a movie palace could have in goverment office and is now moving ahead with more plans to "revive" the Paramount and Modern theaters which are just a few doors down from the Opera House.
If all three of these theaters go back in operation and the Wang Center, Orpheum and Majestic are still delighting patrons, Boston would become a must-see destination for historic theater fans. When was the last time you could say that?
September 24, 2002
Strand Theatre To Undergo Renovation; Install Digital Projection
MARIETTA, GA — Plans are underway to renovate and reopen the historic Strand Theatre in downtown Marietta as a mixed use venue for "films and other peformances", according to the Marietta Daily Journal.
A press release from Don Shafer, who also operates the 3-screen Marietta Star Cinema, says that the 800-seat Strand is also "in the process of securing exclusive rights to an advanced digital system of delivery and presentation that is just being made available to theaters in the USA. This could be available to the Strand as an exclusive area venue."
The Strand may have some competition in the future as the Downtown Marietta Development Authority has just agreed to issue up to $80 million in bonds to erect a new performing arts center.
(Thanks to Don Shafer for the update.)
Chehalis Theater Operator To Take Over Older Triplex
CHEHALIS, WA — Lund Theaters, which owns and operates the historic Chehalis Theater, has taken over operation of the old Yard Birds Mall triplex in North Chehalis.
According to the Chronicle, the theater, which had been operated by the Regal Entertainment Group until last Thursday, is already being run by Lund who had planned to take over the theater at the end of the year. Regal now operates only one theater in all of Washington state, the Regal Capital Mall 4 in Olympia.
Daryl Lund, owner of Lund Theaters, plans to install new seats, curtains, a new sound system, and alter the auditoriums for stadium seating. He also plans to add five screens to the Yard Birds.
Despite these plans, Lund will continue operating the old Chehalis (former Pix) Theater which was erected in 1938 and still turns a tidy profit. Lund resurrected that theater in 1994 after it had been closed for a decade.
September 23, 2002
Senator Theatre Unveils Lawrence of Arabia For Next 2 Weeks!
BALTIMORE, MD — The much heralded, newly restored print of David Lean's masterpiece, "Lawrence of Arabia," is now playing at the historic Senator Theatre in the 'wide-gauge, 70mm format including a DTS digital soundtrack.'
The Senator joins the Music Box in Chicago, the Cinerama Dome in Hollywood, and the Ziegfeld in New York in celebrating the 40th anniversary of this epic motion picture.
For more information on the newly restored print, please read Jon Burlingame's article which appeared in Sunday's Los Angeles Times.
September 20, 2002
DC Theater News
WASHINGTON, D.C. — The Sprenger-Lang Foundation, which had previously put $450,000 down of the necessary $1.2 million to purchase the shuttered Atlas Theater, has now pledged another $2 million dollars to help bring the Atlas back to life, according to a report by WJLA-TV.
The planned restoration and renovation project will turn the John Zink-designed movie house into the Atlas Performing Arts Center and will "contain four theaters for both movies and live performances, as well as offices and restaurants." $12 million more is needed to begin the project.
The 1000-seat Art Moderne Atlas opened in 1938 and has been closed since 1976. Theater organizers hope to bring the Atlas back to life in 2004.
In other Washington, D.C.-area news, Jennifer Kaplan of the Avalon Theater Project reports that a new Northwest Current article has been published entitled "Jemal Says Avalon To Reopen by Christmas."
The ATP has been working tirelessly to bring the old twin movie house back to life which now seems scheduled to reopen by the end of 2002. The Avalon was previously closed by Loews Cineplex as part of their bankruptcy reorganization in April 2001.
NY Theater News
NEW YORK, NY — The St. George Theatre, which is currently undergoing a large-scale restoration, is hosting the The First Annual St. George Poetry Festival tomorrow.
The festival is an all-day celebration of poetry [which] will bring together several generations of world-class, eclectic poets from all across the country to read in a festival atmosphere from Noon until Midnight.
Readings will be interspersed with screenings of experimental films inspired by poetry, and with rare sound recordings of poets. Presses and literary magazines will feature works by the participants, and food and alcohol will be available.
Closed for the last 25 years, the 2,800-seat St. George is being brought back to life by the not-for-profit organization, The St. George Theatre Inc. and its volunteers.
(Thanks to Jean for the update.)
In other New York news, the Upper East Side of Manhattan, which has been battered by a number of movie theater closings over the past decade including the 68th Street Playhouse, the Baronet and Coronet, the Crown Gotham, and the Manhattan 1 & 2, has managed to retain its most recent loss, the New York Twin on 66th & 2nd.
The New York Twin, which has been closed since this past Spring, is reportedly being reopened by Crown Theatres on October 4th. This will be Crown's first New York theater since the Crown Gotham was shuttered in 2001.
September 19, 2002
Warner Theatre To Reopen On November 23rd
TORRINGTON, CT — The $7 million restoration of the Warner Theatre is nearly complete with theater officials announcing that the Art Deco movie palace will have its official reopening on November 23rd.
According to the Register-Citizen, when the Warner reopens in November, "surrounded by shiny black marble, blinding gold leafing and elegant, larger-than-life size murals, theatergoers will feel as if a door to the past has been permanently reopened."
The official reopening ceremonies on November 23rd will be a formal, black tie gala complete with live big band music with guests arriving in vintage cars from the 1920's and 30's.
The theater attracted almost 75,000 guests during the 2001-2002 seasons while organizers were completing the year-long restoration. They expect even larger numbers to come.
Opened in 1931, the theater was rescued from demolition in 1980 and reopened as a performing arts center in 1983.


text:
Welcome, skip to the content.
Official site for Melbourne, Victoria, Australia
Address: 37D Cypress Drive, Mulwala, Victoria 2647
Freecall: 1800 188 879
Email: firstname.lastname@example.com: yarrawongamulwalaaccommodationcentre.com.au/accommodation/45
Cypress Drive Apartment is a two bedroom apartment on the top floor of a multi unit complex. Enjoy the views of the lagoon and Lake Mulwala from the comforts of your private balcony. Cypress Drive has two communal swimming pools to enjoy and a barbecue area. The apartment balcony overlooks the beautiful lagoon on Lake Mulwala, and the adjoining swimming pool. Cypress Drive Apartment features two bedrooms and one with bath. There is a open plan living, kitchen and dining area with a flat screen television, DVD player and stereo. The kitchen is fully equipped with a microwave and dishwasher. There are laundry facilities available and supplied linen for guests. Split system heating and cooling system within the apartment. Please note, no boat trailers are allowed on site in Cypress Gardens under the Strata Plan No 37724, additional parking can be arranged for trailers during your stay. Please contact Yarrawonga Mulwala Accommodation Centre or Cypress Drive Apartment for further information.
Content: Yarrawonga Mulwala Accommodation Centre
Nightly RateRates vary due to peak and off seasons. A minimum of two nights stay.
Select all |
Unselect all


text:
DietCalendar Ladys Free(weightAdd to My Apps
|Health & Fitness
|App Views
|0 views
|0 votes
|Google Rating
DietCalendar Ladys is the application for women that have both functions of our LadysCalendar's and DietCalendar! You can manage your diet and menstruation with one app, DietCalendar Ladys!Users of DietCalendar and LadysCalendar: From Menu → Backup → Export SDcard, save the existing data of DietCalendar and LadysCalendar. Open DietCalendar Ladys → Menu → Backup → Import LadysCalendar or DietCalendar or both and OK.*Initial Window*When you launch DietCalendar Ladys, the initial window is "Base Setting".*Base Setting*Enter user information. There are descriptions on the setting window as well.*Calendar1*1.「Today」button: go back to today's date.2.「Left」&「Right」button: move the date right and left.3.「Graph&List」button: select Graph or List to display.4.「Temperature」button: a calculator will be displayed. Enter the temperature → OK.5.「Camera」button: save the photos of today's meal or anything.6.「Weeklydisplay」button: Press right-corner button of the calendar to switch the display from monthly to weekly.*How to save the data of menstruation and weight*1. Tap the screen "Touch here to Register".*Registeration Window*2.「Menstrual Start」: check here when the period starts.3.「End」: check here when the period ends.4.「Sex」: when you check here, ♡mark will be displayed on the date.5.「Memo」: keep memos or use this memo as a diary.6.「Weight」&「Body fat per」: you can save morning and night data.7. Press Plus button of List.8. Move to "Detailed" window. You can add more photos here, save memos for the photo and save the calories of what you have eaten. Tap the 「Photo」icon → from「Photos」pop-up, select 「From Album」or 「Camera」to save photos.9. Press 「Back」button of the mobile to save.10. You can confirm the information you have saved on the list.*Calendar2*1. You can see now the data you have saved reflected on the calendar.2. There are 4 different types of arrow to show the fluctuation of the weight on the date.3. Orange dots show days of ovulation.4. When you enter the temperature, it will displayed right-bottom corner of the date.5. The remaining of your target weight will displayed on the top-right corner of the screen.*Mark*You can add 2 marks on each calendar to organize your daily plans!1. Menu → Mark → Tap and select a mark you like → Tap the date and add.2. When you want to delete the mark that you have just added, tap twice the same mark and it will be deleted.*Setting Mark*There are so many marks on the list so here, you can customize the mark list by selecting only marks you want to use.1. Menu → Setting Mark.2. When the mark list is opened, all marks are selected.3. Tap marks that you want to use then the background of the mark will be black. This means, marks are not selected.4. Press「Save」to save.*Temperature Graph*♥mark is 「Sex」, ★mark is 「Menstrual Start」and ☆mark is 「Menstrual End」.When there is no data of temperature, these marks will not displayed on the graph.*Weight Graph*Press top-right corner button of the screen to switch the graph from 「Weight」to 「Body fat per」.※Pay ver No ads


text:
Nationwide Career Events - Los Angeles Job Fair
- Business & Professional
- 5400 West Century Blvd, Los Angeles, CA, 90045
Dinner With Henry - Fund Raiser & Celebration
Santa Clarita Shakespeare Festival
Friday, July 12, 2013 from 6:30 PM to 10:00 PM (PDT)
Dinner With Henry
a fund raising preview of this summer's Shakespeare in the Park performance of
William Shakespeare's
Dinner, Wine, Shakespeare & Celebration
Dinner provided by
All proceeds support the free Shakespeare in the Park performances
and the free High School Summer Apprentice program.
Santa Clarita Shakespeare Festival is a 501(c)3, non-profit public benefit organization
The Santa Clarita Shakespeare Festival is dedicated to keeping the classics ALIVE! Presenting free Shakespeare in the Park in the summer and offering dynamic Educational Outreach Programs during the school year, bringing performances and workshops to area schools at little or no charge. During the July and August we conduct an Apprentice Program for local high school students to work with professionally trained theatre artists.
In order to purchase these tickets in installments, you'll need an Eventbrite account. Log in or sign up for a free account to continue.


text:
M3S End of Year Trip Packing List
Due to limited cargo space in vehicles, please pack in a small bag ** Medications go to Ms. Sherilyn 2 pairs shorts or jeans or 1 of each *Students will wear their school shirt. Ms. Sherilyn has the shirts and the students will change into them at school the morning. 2 shirts bathing suit and… Read more »


text:
Many expectant moms want to give their babies a head start on health and choose to take prenatal vitamins. But why is it important to take prenatals and what is in them that makes them different from regular multivitamins?
- Iron – Prenatals help increase the body's amount of iron. Pregnant women need more iron to nourish the baby and because blood volume expands with pregnancy. Iron is necessary to help carry oxygen in your blood.
- Folic Acid – This member of the vitamin B complex is another pregnancy nutrition need. Folic acid is essential for cell division and may help prevent certain birth defects including spina bifida and anencephaly.
- Pre-Baby Nutrition – Taking a multi before you get pregnant is a good way to prepare your body to nourish a baby.
Source: WebMD


text:
Terri Hall
Terri Hall, a homeschool mom of nine turned citizen activist, is the founder of Texans for Toll-free Highways and Texans Uniting for Reform and Freedom.
Posts filtered on Category
Texans celebrate repeal of Trans Texas Corridor
"How could we even think of selling off our infrastructure to foreign companies? Shame on us, shame on us for thinking about it. I will fight any Republican, any Democrat, anyone who wants to take our state from us." – Texas State Representative Lois Kolkhorst [Read More]
Perry & his cronies: The Shelley-Cintra-Giuliani connection
Rick Perry's crony capitalism wasn't just a fleeting lapse of judgment pertaining to the HPV scandal, it's a consistent pattern of revolving door, pay-to-play crony capitalism that Americans detest and can ill afford. [Read More]
Rick Perry tied to Agenda 21, globalist policies
While Perry is staking his campaign on Texas being the top net jobs creator, Perry's version of Texas being "Open for Business" isn't about low taxes and less regulation as much as it is about doing business with foreign companies, including selling off Texas' sovereign land and public assets to foreign creditors, an issue which Perry's first television ad uses to take aim at President Obama. [Read More]
Texas for Sale: New laws sell Texas to highest bidder
The public cannot pressure nor hold accountable a private corporation if the 'fee' or 'tax' is too high. Public private partnerships are the marriage of the corporation with the state and grants monopolies to private entities for a private rather than a public benefit. [Read More]
Feeding Frenzy: Texas House makes a mockery of TxDOT Sunset Review
Watching the Texas House amending the TxDOT Sunset Bill was like watching kids in a candy store, giddy to sell-off Texas to the highest bidder and get to be the next one to do it. The Texas House made a mockery of TxDOT sunset review process. What they did was a disgrace and makes me ashamed to be a Texan. [Read More]
Phillips' bill resurrects the Trans Texas Corridor
HB 3789 re-authorizes Public Private Partnerships (PPPs) and resurrects the Trans Texas Corridor. It would grant the private toll road developers control of not only the toll lanes/road, but also non-toll lanes, frontage roads, buildings on the tollway, parking areas, rest stops, ancillary facilities, etc. It's eminent domain for private gain all over again, which is what caused a Texas-sized backlash against the TTC in earnest in 2007, when a moratorium on PPPs was put in place. [Read More]
Eminent domain bill fails landowners
Today, the Texas Senate passed Governor Rick Perry's fast-tracked 'emergency' eminent domain bill, SB 18. The grassroots don't think the bill goes far enough because it still fails to protect landowners from Kelo abuses (ie – blight, economic development, foreign-owned toll roads). It looks great in parts of subsection "b" only to undo it with […] [Read More]
TxDOT Director resigns, too little but not too late
Yesterday, with the announcement that Texas Department of Transportation (TxDOT) Executive Director Amadeo Saenz will retire at the end of August comes much relief from the grassroots who have insisted that change at the top of the beleaguered agency is necessary to move transportation forward. However, the speculation has already begun as legislators, local officials, […] [Read More]
Sunset review of TxDOT a sham; Perry's eminent domain 'emergency' hazardous for landowners
Postcards from the Lege… Sunset Commission goes soft on TxDOT Today the Sunset Advisory Commission, a group of lawmakers tasked with reviewing state agencies for inefficiencies, waste, and abuse of taxpayer money, went decidedly soft on the Texas Department of Transportation under the leadership of Senator Glenn Hegar. Hegar, once a critic of TxDOT and […] [Read More]
Truth Be Tolled film to premiere in San Antonio Thursday
From the producers of the award-winning series,"Truth Be Tolled," a powerful NEW documentary exposes the controversial truth behind converting our free roads into toll roads, like 281 and 1604, a HUGE DOUBLE TAX, as well as the saga behind the Trans-Texas Corridor. The film will premiere at the Palladium Theater at the Rim off I-10 […] [Read More]
Show More


text:
The Message audio Bible is now available on Bible Gateway! Click to learn more.
76:2 in Salem . . . his dwelling place. Salem is the ancient name for Jerusalem. God's tabernacle is His sanctuary. The tabernacle was a tent, but the temple that replaced it could still be called a tent poetically.
Zion. The mountain where the temple was situated (Ps. 2:6).


text:
More about this preview.

Change DPI Base size is 150
Explore Our fabrics
Optional Filters
I'm going to use this fabric to make...
I'm looking for a fabric that is...
Receive our weekly email with news about contests, giveaways and prodution releases.
Email Address
No Thanks
© 2008-2015 Spoonflower Inc


text:
This year's theme for Staff Development Day was "Pay It Forward: Service Over Self." According to Robin Boyles, Staff Council chair, the theme was chosen for two reasons — to acknowledge and celebrate staff contributions
Home » News and Events » Posts tagged "Staff Council" (Page 2)
Tag Archives: Staff Council
The Staff Council Incentives and Recognition Committee hosted a successful luncheon today to honor the Employee of the Month (EOM) recipients for 2013. The annual event takes place each January in the Simmons Room of the
Patsy Burchfield, assistant to Provost/Vice President of Academic Affairs at Delta State, was recently honored as Delta State's December 2013 Employee of the Month. Originally from French Camp, Miss., Burchfield graduated
The Staff Council at Delta State University continues to work hard at helping others this holiday season. The Staff Council Projects Committee is sponsoring the DSU Toy Drive to benefit children in Bolivar County. Each


text:
Good location with respect to the center and the leaning tower, the train station is at 2,7 km, but buses ride until about 8:15 and stop nearby.
The owner was very friendly and helpful.
The rooms were big, cozy and clean and there was no noise. The kitchen is at all time accessible to the guests as such that the accommodation can be used. A PC with printer is available too and wifi is accessible in the whole house.
A BBQ and bikes can be rented at very low price compared to commercial businesses. The breakfast is extensive and very good,and can be eaten outside in the garden. There also are lounge chairs on a covered terrace.
- Official Description (provided by the hotel):
- This is a bed and breakfast in a very quite residential area, is located at about 15 minutes walking from the leaning tower. The Villa has a garden and a terrace where you can have some relax on the sofa reading a book or listening to the music of the birds. The house is composed of three rooms, one twin bedroom and a double marriage room with shared bathroom and a double marriage room with private ensuite bathroom. ... more less
- Reservation Options:
- TripAdvisor is proud to partner with Booking.com and Priceline so you can book your A Due Passi dal Centro Bed and Breakfast reservations with confidence. We help millions of travelers each month to find the perfect hotel for both vacation and business trips, always with the best discounts and special offers.


text:
Got it!
We'll remember your season preference for the rest of your visit.
You are viewing reviews from a season you previously selected.
Show all reviews
No reviews are available for the season you selected.
We were pleasantly surprised with how nice the facilities were. The beaches were beautiful for swimming and we found some beautiful snorkeling spots. The restaurant was not the most beautiful but the food was very good and the service was friendly.
For the last 3 years I have enyojed my vacations in Camp Ježevac and I have to say it has always been great.
First of all the stuff is very helpful, friendly and polite.
The facilities are all clean, almost instantly repaired if broken and overall very well maintained.
The beach in camp is nicely looked after and you can...
This camp has everything you need if you decide to spend some time close to nature: decent beach, 10 minutes to the town center, all the facilities are clean, in general you can see on every spet that the camp is well run.
We stayed here from the 18th August, initially we had booked to stay for 8 nights, but after what happened in Camping Area G. We left after just four days, ending our holidays on the beautiful island of Krk.
on our 3rd night my wife and I, with our 5 year old son were awoken at 2am.. by a series...
If I needed to recommend the best camping on Adriatic coast, with no doubt in my mind and heart , it would be this place, camping Jezevac in city of Krk, island Krk!!!
For many years I am coming here for vacation in summer ,but also spring and autumn and always again I am amassed !!!
It is first of...
We spent a lovely last minute week here in early may, it was very quiet even at night, which was surprising for a campsite as large as this. Obviously I can't say if it's like this at the height of the season. We had cabin b9 a premium cabin which was spotlessly clean and had 2 bedrooms 2 bathrooms and...
Perfect combination between relax and comfort. The camping offers all the solutions one should expect: bungalows, mobile houses, caravan spaces and tents. Located 5 min walk from KRK centre, its the ideal choice for people who want a camping holidays without avoiding nightlife and restaurants. The camping is very clean, surrounded by rock beaches and sport facilities who offers a...