1. A method of operating a primary data processor and a secondary data processor for access to a file system in data storage, said method comprising:
the primary data processor managing locks upon files in the file system, and managing allocation of free blocks of the file system; and
appending new data to a file in the file system by the secondary data processor obtaining an allocation of at least one free block from the primary data processor, the secondary data processor writing the new data to the free block, the secondary data processor obtaining a lock on the file from the primary data processor, and the secondary data processor updating metadata of the file.
2. The method of claim 1, wherein the secondary data processor updates metadata of the file by writing new metadata of the file directly to the file system in data storage by bypassing the primary data processor.
3. The method of claim 1, wherein the secondary data processor sends a request to the primary data processor for a lock on the file, and thereafter writes the data for the file to the free block, and thereafter receives an indication of a grant of the lock on the file.
4. The method as claimed in claim 3, wherein the secondary data processor receives from the primary data processor an inode number of an inode of the file with the indication of a grant of the lock on the file, and the secondary data processor uses the inode number of the file to update the metadata of the file.
5. A method of operating a primary data processor and a secondary data processor for access to a file system in data storage, said method comprising:
the primary data processor managing locks upon files in the file system, and managing allocation of free blocks of the file system; and
the secondary data processor appending new data to a file in the file system by obtaining an allocation of at least one free block from the primary data processor, writing the new data to the free block, obtaining a lock on the file from the primary data processor, and linking the free block to the file.
6. The method of claim 5, wherein the secondary data processor links the free block to the file by writing new metadata of the file directly to the file system in data storage by bypassing the primary data processor.
7. The method of claim 5, wherein the secondary data processor sends a request to the primary data processor for a lock on the file, and thereafter writes the data for the file to the free block, and thereafter receives an indication of a grant of the lock on the file.
8. The method as claimed in claim 7, wherein the secondary data processor receives from the primary data processor an inode number of an inode of the file with the indication of a grant of the lock on the file, and the secondary data processor uses the inode number of the file to link the free block to the file.
9. The method of claim 5, wherein the primary data processor maintains a record of free blocks allocated to the secondary data processor.
10. The method of claim 5, which further includes the secondary data processor truncating blocks from files of the file system.
11. The method of claim 10, which further includes the secondary data processor returning the truncated blocks to a pool of free blocks in the file system in the data storage.
12. The method of claim 5, which further includes the secondary data processor obtaining a lock on a specified directory from the primary data processor, and then the secondary data processor writing to the specified directory in the data storage.
13. A storage system comprising:
data storage containing a file system;
a primary data processor linked to the data storage for access to metadata of the file system for locking files of the file system and allocating free blocks in the file system; and
a secondary data processor linked to the data storage for access to data and metadata of the file system over a data path that bypasses the primary data processor, and linked to the primary data processor for requesting and obtaining locks on the files in the file system and requesting and obtaining allocations of free blocks in the file system;
wherein the secondary data processor is programmed for writing data to a specified file in the file system by obtaining an allocation of at least one free block from the primary data processor, writing data to said at least one free block, obtaining a lock on the specified file from the primary data processor, and appending said at least one free block to the specified file by writing new metadata for the specified file to the file system in the data storage over the data path that bypasses the primary data processor.
14. The storage system as claimed in claim 13, wherein the data storage is in a cached disk array, the primary data processor is a file manager computer, and the secondary data processor is a client in a data network linking the client to the cached disk array and the primary data processor.
15. The storage system as claimed in claim 13, wherein the data storage is a cached disk array in a network file server, the primary data processor is a first data mover computer in the network file server, and the secondary data processor is a second data mover computer in the network file server.
16. The storage system as claimed in claim 13, wherein the secondary data processor is programmed to send a request to the primary data processor for a lock on the specified file, and thereafter write data for the specified file to said at least one free block while the primary data processor is responding to the request for the lock on the specified file.
17. The storage system as claimed in claim 16, wherein the secondary data processor is programmed to receive from the primary data processor an inode number of an inode of the specified file with an indication of a grant of the lock on the specified file, and to use the inode number of the specified file to link said at least one free block to the specified file.
18. The storage system as claimed in claim 17, wherein the secondary data processor is programmed to truncate blocks from files of the file system by writing new metadata of the files to the file system in the data storage over the data path that bypasses the primary data processor.
19. The storage system as claimed in claim 18, wherein the secondary data processor is further programmed to return the truncated blocks to a pool of free blocks in the file system in the data storage.
20. The storage system as claimed in claim 13, wherein the secondary data processor is programmed to write to a specified directory of the file system by obtaining a lock on the specified directory from the primary data processor, and writing to the specified directory in the data storage over the data path that bypasses the primary data processor.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A machine-implemented method of displaying a pre-specified colored image on a pre-specified display panel having a respective display area, the method comprising:
receiving a first image signal representing the pre-specified colored image in accordance with a first arrangement of pixels corresponding to a regular matrix of equally sized red, green and blue subpixels;
applying a subpixel rendering process to data of the received first image signal to thereby generate a second image signal representing the pre-specified colored image in accordance with a second arrangement of pixels corresponding to a matrix of differently sized subpixels, the second arrangement being substantially constituted by a repeating group of form:
C1(big)
C3(small)
C2(big)
C3(small)
C2(big)
C3(small)
C1(big)
C3(small)
wherein the upper row of the above form represents a first driven row of the repeating group;
wherein the lower row of the above form represents a second driven row of the repeating group;
wherein the first through fourth columns of the above form respectively represent first through fourth driven columns of the repeating group;
wherein C1(big) denotes a first colored light emitter having a corresponding first emission area;
wherein C2(big) denotes a second colored light emitter having a corresponding second emission area, the second color being different than the first color;
wherein C3(small) denotes a third colored light emitter having a corresponding third emission area, the third color being different than each of the first and second colors, the third emission area being substantially smaller than each of the first and second emission areas; and
outputting the generated second image signal for driving the pre-specified display panel to display the pre-specified colored image on the respective display area of the pre-specified display, where the respective display area is populated by subpixels arranged in accordance with the above given repeating group form.
2. The machine-implemented method of claim 1 wherein:
the first arrangement of pixels is a striped RGB arrangement.
3. The machine-implemented method of claim 1 wherein:
the third color is blue.
4. The machine-implemented method of claim 3 wherein:
the first and second colors are a respective one and the other of red and green.
5. The machine-implemented method of claim 4 wherein:
the third colored light emitters (C3(small)) have respective horizontal widths that are substantially smaller than respective horizontal widths of the first and second colored light emitters.
6. The machine-implemented method of claim 5 wherein:
the second and fourth driven columns are shorted together so as to cause the third colored light emitters (C3(small)) of a given driven row of the repeating group to be split emitters that are simultaneously driven to a same output intensity by their respective and shorted together second and fourth driven columns.
7. The machine-implemented method of claim 1 wherein:
the applied subpixel rendering process is based upon:
pre-defining for each of the first, second and third colored light emitters (C1(big), C2(big), C3(small)) a respective resampling area that substantially tessellates the respective display area of the pre-specified display;
pre-defining for the respective resampling area of each of the first, second and third colored light emitters a respective resampling point at a center of the respective resampling area; and
the applied subpixel rendering process provides area resampling based upon:
positioning at least one of the respective resampling points of the first and second colored light emitters (C1(big), C2(big)) so that the respective resampling point is spatially shifted away from a center point of the emission area of its respective colored light emitter and is disposed between the center point of the emission area of its respective colored light emitter and a center point of the emission area of an adjacent third colored light emitter (C3(small)).
8. The machine-implemented method of claim 7 wherein:
the applied subpixel rendering process provides area resampling based upon:
positioning the respective resampling points of the third colored light emitters (C3(small)) so that the respective resampling point of the third colored light emitter is spatially shifted away from a center point of the emission area of its respective colored light emitter and is disposed between the center point of the emission area of its respective colored light emitter and a center point of the emission area of an adjacent one of the first or second colored light emitters (C1(big), C2(big)).
9. The machine-implemented method of claim 8 wherein:
the third color is blue; and
the first and second colors are a respective one and the other of red and green.