text:
Unlimited file system snapshots and clones
The invention relates to a system that includes a file system configured to create a snapshot of a hierarchical block tree (HBT) and a storage pool. After the snapshot has been created, the storage pool includes a snapshot, where the snapshot includes a copy of a first version of a root block and the HBT, where the HBT includes a second version of the root block. Further, the copy of the first version of the root block is created prior to overwriting the first version of the root block with the second version of the root block, the second version of the root block comprises references to a first block and a second block, and the copy of the first version of the root block comprises a reference to the first block and no reference to the second block.
Ahrens, Matthew A. (San Francisco, CA, US)
Maybee, Mark J. (Boulder, CO, US)
Bonwick, Jeffrey S. (Los Altos, CA, US)
Sun Microsystems, Inc. (Santa Clara, CA, US)
707/E17.01, 707/999.202
20090094275 AUDITABLE ACTION REQUEST PROCESSING IN A WORKFLOW ENVIRONMENT April, 2009 Patton et al.
20070112827 Abstract rule sets May, 2007 Dettinger et al.
20090063543 Media Asset Rating System March, 2009 Martin et al.
20020035568 Method and apparatus supporting dynamically adaptive user interactions in a multimodal communication system March, 2002 Benthin et al.
20080222190 Device user interface XML string table manager September, 2008 Kosaka
20090265372 Management of Document Attributes in a Document Managing System October, 2009 Esmann-jensen
20030140037 Dynamic knowledge expert retrieval system July, 2003 Deh-lee
20060294104 Database processing and management December, 2006 Morrison et al.
20090138441 Additional Content Information May, 2009 Valentine et al.
20090112893 Creation and management of electronic files for localization project April, 2009 Pinkerton et al.
20070208766 Apparatuses and methods for interactive communication concerning multimedia content September, 2007 Malik
SHMATOV, ALEXEY
FBFK/Oracle (HOUSTON, TX, US)
1. A system, comprising: a file system configured to create a snapshot of a hierarchical block tree (HBT); a storage pool, after the snapshot has been created, comprises: the snapshot comprising a copy of a first version of a root block, the HBT comprising a second version of the root block; and wherein the copy of the first version of the root block is created prior to overwriting the first version of the root block with the second version of the root block, wherein the second version of the root block comprises references to a first block and a second block; wherein the copy of the first version of the root block comprises a reference to the first block and no reference to the second block.
2. The system of claim 1, wherein the file system is further configured to create a clone of the snapshot, wherein the clone of the snapshot initially consists of a clone root block, wherein the clone root block corresponds to the copy of the first version of the root block.
3. The system of claim 2, wherein the file system is configured to perform at least one action selected from a group consisting of adding an additional block to the clone and deleting an existing block from the clone, and wherein performing the at least one selected action does not alter the HBT.
4. The system of claim 3, wherein adding the additional block to the clone comprises overwriting the clone root block to obtain a modified clone root block, wherein the modified clone root block comprises a reference to the additional block.
5. The system of claim 4, wherein the modified clone root block directly references the additional block.
6. The system of claim 3, wherein deleting the existing block comprises overwriting the clone root block to obtain a modified clone root block, wherein the modified clone root block does not comprise a reference to the existing block.
7. The system of claim 2, wherein the copy of the first version of the root block and the second version of the root block are linked to each other using a doubly-linked list.
8. The system of claim 2, wherein the clone root block is linked to the copy of the first version of the root block using a pointer.
9. The system of claim 2, wherein the snapshot is associated with a reference count and wherein the reference count is incremented when the clone of the snapshot is created.
10. The system of claim 2, wherein the snapshot is associated with a reference count and wherein the reference count is decremented when the clone of the snapshot is deleted.
11. The system of claim 1, wherein the HBT is associated with a dead list, wherein the dead list comprises a block referenced in the snapshot and not currently referenced in HBT.
12. The system of claim 11, wherein a block is referenced by the snapshot if a birth time associated with the block is earlier than the birth time associated with the snapshot.
13. The system of claim 12, wherein the birth time of the snapshot corresponds to the birth time of the first version of the root block.
14. The system of claim 1, wherein the snapshot is associated with a dead list and wherein contents of the dead list initially corresponds to content of a dead list associated with the HBT prior to overwriting the first version of the root block with the second version of the root block
15. A computer readable medium comprising computer executable instructions for creating a snapshot of a hierarchical block tree (HBT), the executable instructions comprising: instructions for obtaining a copy of a first version of a root block of the HBT prior to overwriting the first version of the root block with a second version of the root block; instructions for designating the copy of a first version of a root block as a root block of the snapshot; instructions for associating a dead list of the HBT with the snapshot; instructions for overwriting the first version of the root block with a second version of the root block; and instructions for associating the HBT with an empty dead list, wherein the HBT comprises the second version of the root block.
16. The computer readable medium of claim 15, further comprising: instructions for creating a clone of the snapshot, wherein the clone of the snapshot initially consists of a clone root block, wherein the clone root block corresponds to the copy of the first version of the root block.
17. The computer readable medium of claim 16, further comprising: instructions to perform at least one action selected from a group consisting of adding an additional block to the clone and deleting an existing block from the clone, wherein performing the at least one selected action does not alter the HBT, wherein adding the additional block to the clone comprises overwriting the clone root block to obtain a first modified clone root block and the first modified clone root block comprises a reference to the additional block, and wherein deleting the existing block comprises overwriting the clone root block to obtain a second modified clone root block, wherein the second modified clone root block does not comprise a reference to the existing block.
18. The computer readable medium of claim 17, further comprising: instructions for creating a snapshot of the clone, wherein the snapshot of the clone initially consists of a clone snapshot root block, wherein the clone snapshot root block corresponds to a copy of one selected from a group consisting of the first modified clone root block and the second modified clone root block.
19. The computer readable medium of claim 16, further comprising: instructions for incrementing a reference count when the clone is created; and instructions for decrementing when the clone of the snapshot is deleted, wherein the reference count is associated with the snapshot.
20. The computer readable medium of claim 15, further comprising: instructions for updating the deadline associated with the HBT, wherein the dead list is updated when a block referenced by root block of the snap shot ceases to be referenced by the second version of the root block.
This application claims benefit of U.S. Provisional Application Ser. No. 60/734,039 filed on Nov. 4, 2005, entitled "UNLIMITED FILESYSTEM SNAPSHOTS AND CLONES" in the names of Matthew A. Ahrens, Mark J. MAYBEE, and Jeffrey S. Bonwick.
The present application contains subject matter that may be related to the subject matter in the following U.S. patent applications, which are all assigned to a common assignee: "Method and Apparatus for Self-Validating Checksums in a File System" (application Ser. No. 10/828,573) filed on Apr. 24, 2004; "Method and Apparatus for Dynamic Striping" (application Ser. No. 10/828,677) filed on Apr. 21, 2004; "Method and Apparatus for Vectored Block-Level Checksum for File System Data Integrity" (application Ser. No. 10/828,715) filed on Apr. 21, 2004; "Method and Apparatus for Identifying Tampering of Data in a File System" (application Ser. No. 10/853,874) filed on May 26, 2004; "Method and System for Detecting and Correcting Data Errors Using Checksums and Replication" (application Ser. No. 10/853,837) filed on May 26, 2004; "Method and System for Detecting and Correcting Data Errors Using Data Permutations" (application Ser. No. 10/853,870) filed on May 26, 2004; "Method and Apparatus for Compressing Data in a File System" (application Ser. No. 10/853,868) filed on May 26, 2004; "Gang Blocks" (application Ser. No. 10/919,878) filed on Aug. 17, 2004; "Method and Apparatus for Enabling Adaptive Endianness" (application Ser. No. 10/919,886) filed on Aug. 17, 2004; "Automatic Conversion of All-Zero Data Storage Blocks into File Holes" (application Ser. No. 10/853,915) filed on May 26, 2004; "Multiple Replication Levels with Pooled Devices" (application Ser. No. 60/733,848) filed on Nov. 4, 2005; "Multiple Replication Levels with Pooled Devices" (Attorney Docket No. 03226/750001; SUN060258) filed on Apr. 19, 2006; "Method and System Supporting Per-File and Per-Block Replication" (Attorney Docket No. 03226/751001; SUN060259) filed on Apr. 19, 2006; "Ditto Blocks" (Attorney Docket No. 03226/761001; SUN060269) filed on Apr. 19, 2006; and "Method and System for Adaptive Metadata Replication" (Attorney Docket No. 03226/762001; SUN060270).
A typical operating system includes a file system. The file system provides a mechanism for the storage and retrieval of files and a hierarchical directory structure for the naming of multiple files. More specifically, the file system stores information provided by the user (i.e., data) and information describing the characteristics of the data (i.e., metadata). The file system also provides extensive programming interfaces to enable the creation and deletion of files, reading and writing of files, performing seeks within a file, creating and deleting directories, managing directory contents, etc. In addition, the file system also provides management interfaces to create and delete file systems.
File systems are typically controlled and restricted by operating system parameters. For example, most operating systems limit the maximum number of file names that can be handled within their file system. Some operating systems also limit the size of files that can be managed under a file system.
An application, which may reside on the local system (i.e., computer) or may be located on a remote system, uses files as an abstraction to address data. Conventionally, this data is stored on a storage device, such as a disk.
To access a file, the operating system (via the file system) typically provides file manipulation interfaces to open, close, read, and write the data within each file. More specifically, the file system stores data on the storage device by managing the allocation of space within the storage device. Typically, the volume manager provides space which is managed by the file system. Two common types of file system space allocation strategies are known as block-based allocation and extent-based allocation. Block-based allocation creates incremental disk space for each file, each time the file is extended (i.e., modified via a write request to add information). Whereas extent-based allocation creates a large series of contiguous blocks (i.e., extents) each time the file exhausts the space available in the last extent of the file.
When allocating space, both block-based and extent-based allocation use space provided by the volume manager. The volume manager allows multiple physical disks to be used as a single volume (i.e., a virtual disk) to provide larger consolidated storage sizes and simpler management. The volume manager allows users to organize data along volume boundaries (i.e., each volume has physical disk space allocated to the volume such that the volume is tied only to that dedicated physical disk). The volume manager is typically implemented as a separate layer between the physical disks and the file system, and is presented to the user as a virtual disk device. In other words, volume managers organize the collections of physical devices (e.g., disks) into virtual devices. Additionally, the space allocated within the volume manager is handled by the file system. Consequently, the volume manager is not aware of which blocks within the available storage space are in use and which blocks are free for data to be stored.
Further, file systems may be mounted on the virtual disk devices. Thus, physical disks are partitioned and allocated to multiple virtual disk devices, and each virtual disk device is capable of having a file system that exclusively uses that particular virtual disk device. A request to access a file is typically performed by an application, via the file system, using a file name and logical offset. This file name and logical offset (i.e., the manner in which applications express file operation requests) corresponds to a location within the virtual disk device. Subsequently, the request is translated to physical disk space on the storage device by the volume manager, allowing the user of the application to access the data within a particular file.
In general, in one aspect, the invention relates to a system. The system includes a file system configured to create a snapshot of a hierarchical block tree (HBT) and a storage pool. After the snapshot has been created, the storage pool includes the snapshot comprising a copy of a first version of a root block, the HBT comprising a second version of the root block, and wherein the copy of the first version of the root block is created prior to overwriting the first version of the root block with the second version of the root block, wherein the second version of the root block comprises references to a first block and a second block, and wherein the copy of the first version of the root block comprises a reference to the first block and no reference to the second block.
In general, in one aspect, the invention relates to a computer readable medium comprising computer executable instructions for creating a snapshot of a hierarchical block tree (HBT). The executable instructions including instructions for obtaining a copy of a first version of a root block of the HBT prior to overwriting the first version of the root block with a second version of the root block, instructions for designating the copy of a first version of a root block as a root block of the snapshot, instructions for associating a dead list of the HBT with the snapshot, instructions for overwriting the first version of the root block with a second version of the root block, and instructions for associating the HBT with an empty dead list, wherein the HBT comprises the second version of the root block.
Other aspects of the invention will be apparent from the following description and the appended claims.
FIG. 1 shows a system architecture in accordance with an embodiment of the invention.
FIG. 2 shows a storage pool allocator in accordance with an embodiment of the invention.
FIG. 3 shows a hierarchical block tree in accordance with an embodiment of the invention.
FIG. 4 shows a hierarchical block tree, a snapshot, and a clone in accordance with an embodiment of the invention.
FIGS. 5A-5F show examples to illustrate one or more embodiments of the invention.
FIG. 6 shows a flow chart in accordance with an embodiment of the invention.
FIG. 7 shows an example of freeing blocks in accordance with an embodiment of the invention.
FIG. 10 shows a computer system in accordance with an embodiment of the invention.
Specific embodiments of the invention will now be described in detail with reference to the accompanying figures. Like elements in the various figures are denoted by like reference numerals for consistency. Further, the use of "ST" in the drawings is equivalent to the use of "Step" in the detailed description below.
In the following detailed description of one or more embodiments of the invention, numerous specific details are set forth in order to provide a more thorough understanding of the invention. However, it will be apparent to one of ordinary skill in the art that the invention may be practiced without these specific details. In other instances, well-known features have not been described in detail to avoid obscuring the invention.
In general, embodiments of the invention relate to a method and apparatus for creating snapshots of a hierarchical block tree. Further, embodiments of the invention relate to a method and apparatus for creating clones of the snapshots.
FIG. 1 shows a system architecture in accordance with one embodiment of the invention. The system architecture includes an operating system (103) interacting with a file system (100), which in turn interfaces with a storage pool (108). In one embodiment of the invention, the file system (100) includes a system call interface (102), a data management unit (DMU) (104), and a storage pool allocator (SPA) (106).
The operating system (103) typically interfaces with the file system (100) via a system call interface (102). The operating system (103) provides operations (101) for users to access files within the file system (100). These operations (101) may include read, write, open, close, etc. In one embodiment of the invention, the file system (100) is an object-based file system (i.e., both data and metadata are stored as objects). More specifically, the file system (100) includes functionality to store both data and corresponding metadata in the storage pool (108). Thus, the aforementioned operations (101) provided by the operating system (103) correspond to operations on objects.
More specifically, in one embodiment of the invention, a request to perform a particular operation (101) (i.e., a transaction) is forwarded from the operating system (103), via the system call interface (102), to the DMU (104). In one embodiment of the invention, the DMU (104) translates the request to perform an operation on an object directly to a request to perform a read or write operation at a physical location within the storage pool (108). More specifically, the DMU (104) represents the objects as data blocks and indirect blocks as described in FIG. 3 below. Additionally, in one embodiment of the invention, the DMU (104) includes functionality to group related work (i.e., modifications to data blocks and indirect blocks) into I/O requests (referred to as a "transaction group") allowing related blocks to be forwarded to the SPA (106) together. The SPA (106) receives the transaction group from the DMU (104) and subsequently writes the blocks into the storage pool (108). The operation of the SPA (106) is described in FIG. 2 below.
In one embodiment of the invention, the storage pool (108) includes one or more physical disks (110A-110N). Further, in one embodiment of the invention, the storage capacity of the storage pool (108) may increase and decrease dynamically as physical disks are added and removed from the storage pool. In one embodiment of the invention, the storage space available in the storage pool (108) is managed by the SPA (106).
FIG. 2 shows the SPA (106) in accordance with one embodiment of the invention. The SPA (106) may include an I/O management module (200), a compression module (201), an encryption module (202), a checksum module (203), and a metaslab allocator (204). Each of these aforementioned modules are described in detail below.
As noted above, the SPA (106) receives transactions from the DMU (104). More specifically, the I/O management module (200), within the SPA (106), receives transactions from the DMU (104) and groups the transactions into transaction groups in accordance with one embodiment of the invention. The compression module (201) provides functionality to compress larger logical blocks (i.e., data blocks and indirect blocks) into smaller segments, where a segment is a region of physical disk space. For example, a logical block size of 8K bytes may be compressed to a size of 2K bytes for efficient storage. Further, in one embodiment of the invention, the encryption module (202) provides various data encryption algorithms. The data encryption algorithms may be used, for example, to prevent unauthorized access. In one embodiment of the invention, the checksum module (203) includes functionality to calculate a checksum for data (i.e., data stored in a data block) and metadata (i.e., data stored in an indirect block) within the storage pool. The checksum may be used, for example, to ensure data has not been corrupted.
As discussed above, the SPA (106) provides an interface to the storage pool and manages allocation of storage space within the storage pool (108). More specifically, in one embodiment of the invention, the SPA (106) uses the metaslab allocator (204) to manage the allocation of storage space in the storage pool (108).
In one embodiment of the invention, the storage space in the storage pool (108) is divided into contiguous regions of data, i.e., metaslabs. The metaslabs may in turn be divided into segments (i.e., portions of the metaslab). The segments may all be the same size, or alternatively, may be a range of sizes. The metaslab allocator (204) includes functionality to allocate large or small segments to store data blocks and indirect blocks. In one embodiment of the invention, allocation of the segments within the metaslabs is based on the size of the blocks within the I/O requests. That is, small segments are allocated for small blocks, while large segments are allocated for large blocks. The allocation of segments based on the size of the blocks may allow for more efficient storage of data and metadata in the storage pool by reducing the amount of unused space within a given metaslab. Further, using large segments for large blocks may allow for more efficient access to data (and metadata) by reducing the number of DMU (104) translations and/or reducing the number of I/O operations. In one embodiment of the invention, the metaslab allocator (204) may include a policy that specifies a method to allocate segments.
As noted above, the storage pool (108) is divided into metaslabs, which are further divided into segments. Each of the segments within the metaslab may then be used to store a data block (i.e., data) or an indirect block (i.e., metadata). FIG. 3 shows the hierarchical block tree (hereinafter referred to as a "HBT") for storing data blocks and indirect blocks within the storage pool in accordance with one embodiment of the invention. In one embodiment of the invention, the HBT includes a root block (300), one or more levels of indirect blocks (302, 304, 306), and one or more data blocks (308, 310, 312, 314). In one embodiment of the invention, the location of the root block (300) is in a particular location within the storage pool. The root block (300) typically points to subsequent indirect blocks (302, 304, and 306). In one embodiment of the invention, indirect blocks (302, 304, and 306) may be arrays of block pointers (e.g., 302A, 302B, etc.) that, directly or indirectly, reference to data blocks (308, 310, 312, and 314). The data blocks (308, 310, 312, and 314) contain actual data of files stored in the storage pool. One skilled in the art will appreciate that several layers of indirect blocks may exist between the root block (300) and the data blocks (308, 310, 312, 314).
In contrast to the root block (300), indirect blocks and data blocks may be located anywhere in the storage pool (108 in FIG. 1). In one embodiment of the invention, the root block (300) and each block pointer (e.g., 302A, 302B, etc.) includes data as shown in the expanded block pointer (302B). One skilled in the art will appreciate that data blocks do not include this information; rather data blocks contain actual data of files within the file system.
In one embodiment of the invention, each block pointer includes a metaslab ID (318), an offset (320) within the metaslab, a birth value (322) of the block referenced by the block pointer, and a checksum (324) of the data stored in the block (data block or indirect block) referenced by the block pointer. In one embodiment of the invention, the metaslab ID (318) and offset (320) are used to determine the location of the block (data block or indirect block) in the storage pool. The metaslab ID (318) identifies a particular metaslab. More specifically, the metaslab ID (318) may identify the particular disk (within the storage pool) upon which the metaslab resides and where in the disk the metaslab begins. The offset (320) may then be used to reference a particular segment in the metaslab. In one embodiment of the invention, the data within the segment referenced by the particular metaslab ID (318) and offset (320) may correspond to either a data block or an indirect block. If the data corresponds to an indirect block, then the metaslab ID and offset within a block pointer in the indirect block are extracted and used to locate a subsequent data block or indirect block. The HBT may be traversed in this manner to eventually retrieve a requested data block.
In one embodiment of the invention, copy-on-write transactions are performed for every data write request to a file. Specifically, all write requests cause new segments to be allocated for the modified data. Therefore, the retrieved data blocks and indirect blocks are never overwritten (until a modified version of the data block and indirect block is committed). More specifically, the DMU writes out all of the modified data blocks in the HBT to unused segments within the storage pool. Subsequently, the DMU writes out the corresponding block pointers (within indirect blocks) to unused segments in the storage pool. In one embodiment of the invention, fields (i.e., metaslab ID, offset, birth, checksum) for the corresponding block pointers are populated by the DMU prior to sending an I/O request to the SPA. The indirect blocks containing the block pointers are typically written one level at a time. To complete the copy-on-write transaction, the SPA issues a single write that atomically changes (i.e., overwrites) the root block to reference the indirect blocks referencing the modified data block.
Using the infrastructure shown in FIGS. 1-3, the following discussion describes the creation of a snapshot of the HBT and the creation of a clone from the snapshot.
In one embodiment of the invention, the HBT corresponds to a group of blocks referenced, directly or indirectly, by a root block. As discussed above, as the blocks referenced by the root block are modified, the modified blocks are written to unused locations in the storage pool and the root block is modified to include references to the modified blocks.
A snapshot corresponds to a state of the HBT at a given time, where the state of the HBT corresponds to all blocks referenced, directly or indirectly, by the root block of the HBT at the aforementioned time.
In one embodiment of the invention, a clone corresponds to an HBT where the initial state of the clone is obtained from a snapshot of the HBT. Said another way, the clone corresponds to a pre-populated HBT where the clone initially includes only blocks referenced, directly or indirectly, by the root block of the HBT at the time the snapshot was created. In one embodiment of the invention, file system may also create snapshot(s) of the clones.
In one embodiment of the invention, the HBT and the clone may each be modified independently. For example, modifying the contents of the HBT will not affect the clone and vise versa. Further, the file system is configured to manage HBTs, snapshots and clones concurrently. For example, FIG. 4 shows a hierarchical block tree, a snapshot, and a clone in accordance with an embodiment of the invention. As shown in FIG. 4, each block (e.g., B1 (408), B2 (410), B3 (412), B4 (406)) may be referenced by, and therefore be a part of, the HBT (400), the snapshot (402), and the clone (404).
Specifically, the HBT (400) includes a second version of the root block R′ (418). The second version of the root block R′ (418) in turn references blocks B1 (408), B2 (410), and B3 (412). Further, the snapshot (402) includes a first version of the root block R (416). The first version of the root block R (416) in turn references blocks B1 (408) and B2 (410). Finally, the clone (404) includes a copy of the first version of the root block CR (i.e., the clone root block) (414). The clone root block CR (414) in turn references blocks B2 (408) and B4 (406).
As discussed above, the snapshot of the HBT correspond to the state of the HBT at a given time. Accordingly, in FIG. 4, the snapshot (402) corresponds to the state of the HBT (400) prior to the addition of block B3 (412) to the HBT (400). Similarly, as discussed above, the initial state of the clone corresponds to the snapshot. Accordingly, in FIG. 4, the initial state of the clone (404) (i.e., the blocks initially referenced by the clone root block CR (414)) are blocks B1 (406) and B2 (408).
Finally, as discussed above, the clone and the HBT may be modified independently of one another. As shown in FIG. 4, the clone (404) is modified to remove the reference to block B1 (408) and to add a reference to block B4 (406). The removal of the reference to block B1 (408) from the clone (404) did not affect the reference to block B1 (408) by the HBT (400).
In one embodiment of the invention, the HBT (400) and the snapshot (402) are each associated with their own dead list (not shown). In one embodiment of the invention, the dead list associated with the HBT (400) is initially empty. As the HBT is modified, the dead list associated with the HBT is updated to list all block pointers (along with the referenced birth time of the block) corresponding to blocks which are referenced in the snapshot (402), but are no longer referenced in the HBT (400). Further, the dead list associated with the snapshot (402) corresponds to the dead list associated with the HBT (400) at the time the snapshot was created.
In one embodiment of the invention, the clone is also associated with a dead list (not shown). When the clone (404) is initially created, its dead list is empty. As the clone (404) is modified, the dead list associated with the clone (404) is updated to list all block pointers (along with the referenced block's birth time) corresponding to blocks which are referenced in the snapshot (402), but are no longer referenced in the clone (404). Dead lists are further discussed below in FIGS. 7 and 8.
FIG. 5A-5F show examples to illustrate one or more embodiments of the invention. More specifically, FIGS. 5A-5F show an example of the creation of an HBT, a snapshot, and a clone in accordance with one embodiment of the invention. Referring to FIG. 5A, the HBT (500) initially includes a root block (R) and block (B1), where R references B1. Referring to FIG. 5B, HBT (500) is subsequently modified to include a reference to block (B2). In accordance with the copy-on-write mechanism implemented by the file system, R (in FIG. 5A) is overwritten with a modified copy of the root block (R′), where the R′ references both B1 and B2.
Referring to FIG. 5C, at some later point in time a snapshot (502) of HBT (500) is created. The snapshot (502) is created prior to modifying R′ to obtain R″, where R″ is a modified version of R′ and references B1, B2 and block (B3). As shown in FIG. 5C, the snapshot (502) includes a copy of R′ (denoted as Rc′). Rc′ references B1 and B2. Note that the snapshot (502) does not include an additional copy of B1 and B2.
Referring to FIG. 5D, HBT (500) is subsequently modified to include a reference to block (B4). In accordance with the copy-on-write mechanism implemented by the file system, R″ (in FIG. 5C) is overwritten with a modified copy of the root block (R″′), where the R″′ references both B1, B2, B3 and B4.
Referring to FIG. 5E, at some later point in time, a clone (504) is created from the snapshot (502). As shown in FIG. 5E, the clone (504) includes a copy of R′ (denoted as CRc′). CRc′ references B1 and B2. Note that the clone (504) does not include an additional copy of B1 and B2.
Finally, referring to FIG. 5F, HBT (500) is subsequently modified to delete a reference to B3 and to include a reference to block (B6). In accordance with the copy-on-write mechanism implemented by the file system, R″′ (in FIG. 5D) is overwritten with a modified copy of the root block (R″″), where the R″″ references both B1, B2, B4 and B6. In addition, the clone (504) is modified to delete a reference to B2 and to include a reference to block (B5). In accordance with the copy-on-write mechanism implemented by the file system, CRc′ (in FIG. 5E) is overwritten with a modified copy of the root block (CRc″), where the CRc″ references both B1 and B5.
FIG. 6 shows a flow chart in accordance with an embodiment of the invention. More specifically, FIG. 6 shows a method for creating a snapshot in accordance with one embodiment of the invention.
Initially, the current root block of the HBT is copied (ST600). The copy of the current root block is subsequently associated with an administrator-chosen name for the snapshot (ST602). Said another way, the copy of the current root block is designated as the root block of the snapshot, where the snapshot is identified by the administrator-chosen name. The dead list associated with the HBT is subsequently associated with the snapshot (ST604), such that the dead list is no longer associated with the HBT. For example, referring to FIG. 5F, when clone (504) removes its reference to B2, then B2 is placed on the deadlist associated with clone (504).
The current root block is then overwritten with a new version of the root block to obtain a new HBT (ST606). The new HBT is subsequently associated with a new empty dead list (ST608). Finally, the snapshot (or more specifically the root block of the snapshot) is optionally linked to the new HBT (or more specifically the root block of the new HBT) (ST610). In one embodiment of the invention, the snapshot is linked to the HBT using a doubly-linked list.
In one embodiment of the invention, the clone of the snapshot is created using a method similar to one described for creating a snapshot in FIG. 6. However, instead of obtaining a copy of the current root block, the clone is created by obtaining a copy of the root block of the snapshot from which it was created. Further, unlike the dead list associated with the snapshot, the dead list associated with the clone is initially empty. Finally, the clone (or more specifically the root block of the clone) is linked to the snapshot from which it was created. However, unlike the link between the snapshot and the HBT, the link between the clone and the snapshot is an unidirectional link (typically a pointer) from the clone to the snapshot. Accordingly, one cannot traverse from the snapshot to the clone.
In one embodiment of the invention, when the clone is created, a reference count associated with the snapshot is incremented to reflect that a clone of the snapshot has been created. In one embodiment of the invention, the reference count associated with a snapshot is decremented each time a clone created from the snapshot is deleted. In one embodiment of the invention, the referenced count is used by the file system to determine whether the snapshot can be deleted. In one embodiment of the invention, the snapshot cannot be deleted if the reference count is greater than to a threshold value. In one embodiment of the invention, the threshold value is one.
As discussed above, each HBT, snapshot, and clone is associated with a dead list. In one embodiment of the invention, the contents of the dead list associated the HBT(s) and the contents of the dead list associated with the clone(s) may change over time, while the contents of the dead list associated with the snapshot(s) is static. The following discussion describes how the contents of the dead list associated the HBT(s) and the contents of the dead list associated with the clone(s) may change over time.
As discussed above, when the HBT is modified such that it no longer references a given block (e.g., the block is overwritten, or the object that contains it is freed), a determination must be made about whether the block can actually be freed (i.e., reclaimed for storing other data). A block can only be freed if and only if there are no other references to it (i.e., it is not referenced by any snapshot). In order to determine whether there are any references to the block, a comparison of the block's birth time with the birth time of the most recent snapshot (i.e., the most recently created snapshot of the HBT) is performed. In one embodiment of the invention, the most recent snapshot may be determined by traversing the linked list that links the root block of the HBT with the root blocks of its snapshots. The first snapshot encountered in the traversal corresponds to the most recent snapshot.
Returning to the discussion of how to determine whether there are any references to the block, if the birth time of the block is earlier than the birth time of the most recent snapshot, then, at a minimum, the most recent snapshot references the block and, thus, the block cannot be freed. If the block cannot be freed, then the block pointer associated with the block is placed on the dead list of the HBT. Alternatively, if the block's birth time is later than the birth time of the most recent snapshot, then none of the snapshots reference block and, thus, the block can be freed.
FIG. 7 shows an example of freeing blocks in accordance with an embodiment of the invention. As shown in FIG. 7, Block A (700) has a birth time that is earlier than the time the most recent snapshot (i.e., snapshot (704)) was created. Further, Block B (702) was born after the time the snapshot (706) was created. If the HBT (706) stops referencing Block A (700), Block A (700) cannot be freed because it was born before the snapshot (704) was created.
Accordingly, Block A is placed on the dead list associated with the HBT (700).
However, if the HBT (706) stops referencing Block B (702), then Block B (702) can be freed because it was born after the snapshot (704) was created and, thus, is not referenced by the snapshot (704).
In one embodiment of the invention, the file system includes functionality to delete any snapshot in the file system. Once a snapshot has been deleted (i.e., the user deletes the snapshot), a determination must be made about which blocks may be freed and which blocks must be maintained on a dead list prior to completing the deletion of the snapshot.
In one embodiment of the invention, in order to free a block that is referenced in the deleted snapshot, the following constraints must be met: (1) the block was born after the previous snapshot (i.e., the snapshot created immediately prior to the deleted snapshot), (2) the block was born before the deleted snapshot, (3) the block was placed on the dead list after the deleted snapshot was created, and (4) the block died (i.e., was placed on the dead list) before the next snapshot (i.e., the snapshot created immediately after the deleted snapshot) or the block was placed in the dead list associated with the HBT, if the next snapshot corresponds to the HBT. In one embodiment of the invention, if a given block satisfies all four of the aforementioned criteria, then the block is unique to the snapshot.
The blocks on the dead list associated with the next snapshot (or dead list associated with the HBT, if the next snapshot does not exist ) are those that meet constraints (2), (3) and (4) (i.e., the blocks live in the deleted snapshot, but are dead in the next snapshot).
FIG. 8 shows a flow chart in accordance with an embodiment of the invention. More specifically, FIG. 8 describes a method for determine which blocks of the deleted snapshot may be freed. Turning to FIG. 8, initially, the dead list associated with the next snapshot (or HBT) is obtained (ST800). A block pointer (BP) on the dead list is then selected (ST802). A determination is then made about whether the birth time of the block, referenced by the BP, is less than or equal to the birth time of the previous snapshot (ST804). In one embodiment of the invention, the birth time of the previous snapshot corresponds to the birth time of the root block of the previous snapshot.
If the birth time of the block, referenced by the BP, is less than or equal to the birth time of the previous snapshot, then the BP is added to the dead list associated with the deleted snapshot (ST806). If the birth time of the block referenced by the BP is greater than the birth time of the previous snapshot, then the block referenced by the BP is freed (i.e., the block referenced by the BP is now available to be overwritten by new data) (ST810). If there are any remaining BPs on the dead list to analyze then the method proceeds to ST802. Otherwise, the method proceeds to ST812. At ST812, the dead list associated with the next snapshot is deleted. Finally, the dead list associated with the deleted snapshot (which may have been modified in ST806) is associated with the next snapshot.
The method shown in FIG. 8 assumes that the dead list associated with the next snapshot includes at least one BP. However, if the dead list associated with the next snapshot does not include any BPs, then the method in FIG. 8 is not performed.
FIG. 9 shows an example of freeing blocks using the method described in FIG. 8, in accordance with an embodiment of the invention. In the example shown in FIG. 9, snapshot 2 (902) is deleted. Accordingly, prior to completing the deletion of snapshot 2 (902), the dead list (DL3) associated with the HBT (904) must be analyzed in accordance with the method described in FIG. 8.
Prior to analyzing DL3, the following discussion details which of the block pointers corresponding to Block A (906), Block B (908), Block C (910), and Block D (912) is included in DL3. With respect to Block A (906), Block A (906) was born before the snapshot 1 (900) and was deleted after snapshot 2 (902) was created. Thus, Block A (906) is included in DL3. With respect to Block B (908), Block B (908) was born after snapshot 1 (900) and was deleted after snapshot 2 (902) was created, thus, Block B (908) is also included in DL3.
With respect to Block C (912), Block C (912) was born before snapshot 1 (900) and was deleted after HBT (904) was created, thus, Block C (912) is included in DL3. Finally, with respect to Block D (914), Block D (914) was born before snapshot 1 (900) and was deleted before snapshot 2 (902) was created, thus, Block D is on the dead list (DL2) associated with snapshot 2 (902).
At this stage, DL3 includes Block A (906), Block B (908) and Block C (912). Using the method described in FIG. 8, Block A (906) and Block C (912) are placed on DL2 to obtain DL2′ (i.e., the result of modifying DL2 to include Block A (906) and Block C (912)) while Block B (908) is freed. The aforementioned results were obtained as follows. With respect to Block A (906), because Block A's birth time is earlier than snapshot 1's birth time, Block A (906) cannot be freed and, thus, is included in a DL2′. With respect to Block B (908), because Block B's birth time is later than snapshot 1's (900) birth time, Block B (908) can be freed. Finally, with respect to Block C (912), because Block C's birth time is earlier than snapshot 1 's birth time, Block C (912) cannot be freed and, thus, is also included in DL2′.
At this stage, the dead list (DL3) associated with HTB (904) is deleted and replaced with the dead list (DL2′) associated with HBT (904). Once HBT (904) is associated with DL2′, the file system may complete the deletion of snapshot 2 (902). Note that DL1 associated with Snapshot 1 (900) is not affected by the deletion of snapshot 2 (902).
In one embodiment of the invention, deleting a snapshot also includes removing the snapshot name from the file system and updating the links between the remaining snapshots and/or HBTs as appropriate.
In one embodiment of the invention, the file system supports "roll back" functionality. In one embodiment of the invention, roll back functionality allows a user to return the contents of the file system (i.e., the HBT) to the state corresponding to a selected snapshot. In one embodiment of the invention, the HBT is rolled back to a state corresponding to a selected snapshot by traversing the HBT and the appropriate snapshots (i.e., the snapshot created after the selected snapshot) and freeing the blocks that were born after the selected snapshot. In one embodiment of the invention, the blocks are freed using the method described above in FIG. 8.
In one embodiment of the invention, the file system implements a copy-on-write mechanism (as discussed above). As such, a block can only reference blocks that are the same age or older than it. Using this property, the aforementioned traversal of the HBT and appropriate snapshots may be optimized by not reading any blocks (or their associated braches) that have a birth time before the selected snapshot.
As discussed above, the clone is a HBT. Thus, the clone, like a HBT, may be associated with its own snapshots. However, when a clone is initially created, the previous snapshot of the clone (for the purpose of deleting the clone) corresponds to the snapshot from which the clone was created.
In one embodiment of the invention, in order to delete a clone, all the snapshots associated with the clone (i.e., the clone's snapshots) must be deleted. Once all the snapshots of the clone are deleted (using the snapshot deletion procedures described above), the clone itself is rolled back to the snapshot from which it was created. At this stage, there are no blocks that are unique to the clone and, thus, the clone can be removed from the file system.
While the above invention has been discussed with respect to a file system managing a single HBT with multiple snapshots and clones, the invention may be extended to include implementations in which there are multiple HBTs each of which is associated with multiple snapshots and clones.
The invention may be implemented on virtually any type of computer regardless of the platform being used. For example, as shown in FIG. 10 a networked computer system (1000) includes a processor (1002), associated memory (1004), a storage device (1006), and numerous other elements and functionalities typical of today's computers (not shown). The networked computer system (1000) may also include input means, such as a keyboard (1008) and a mouse (1010), and output means, such as a monitor (1012). The networked computer system (1000) is connected to a local area network (LAN) or a wide area network (e.g., the Internet) (not shown) via a network interface connection (not shown). Those skilled in the art will appreciate that these input and output means may take other forms. Further, those skilled in the art will appreciate that one or more elements of the aforementioned computer (1000) may be located at a remote location and connected to the other elements over a network. Further, the invention may be implemented on a distributed system having a plurality of nodes, where each portion of the invention (e.g., the storage pool, the SPA, the DMU, etc.) may be located on a different node within the distributed system. In one embodiment of the invention, the node corresponds to a computer system. Alternatively, the node may correspond to a processor with associated physical memory.
Further, software instructions to perform embodiments of the invention may be stored on a computer readable medium such as a compact disc (CD), a diskette, a tape, a file, or any other computer readable storage device.
While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of this disclosure, will appreciate that other embodiments can be devised which do not depart from the scope of the invention as disclosed herein. Accordingly, the scope of the invention should be limited only by the attached claims.
Previous Patent: System and method for integrating data between computer systems
Next Patent: File management method for log-structured file system for sequentially adding and storing log of fil...


text:
Money World Asia Pte Ltd
one of the region's most trusted and reliable Foreign Exchange and Remittance dealers
Money World is a well-known business leader in the world of money that prides itself on its consistent and constant availability in providing currencies securely, quickly and without fuss.
Starting out as a numismatic company dealing with money collectibles and commemorative products, Money World is a well-known business leader in the world of money. Implementing its two-pronged approach in business strategy, Money World is today, an established remittance service provider in the region. Registered under and licensed by the Monetary Authority of Singapore as a Remittance Agent, Money World has been in the remittance business for over 20 years. Aside from "G7" currencies, Money World has the expertise in the global forex market sector handling currencies such as the Chinese Ren Min Bi, Indonesian Rupiah and the Malaysian Ringgit. Leveraging on favourable ties with major banks and national currency issuing institutions worldwide, Money World prides itself on its consistent and constant availability in providing these currencies securely and efficiently, giving them a competitive edge over both their local and regional peers. Money World is also known for its field of excellence and know-how on how to remit currencies to almost every country in the region.
Money World was a numismatic company
Money World held its first exhibition which was in conjunction with the Board of Commissioners of Currency Singapore (BCCS) 25th Anniversary
Taking part in international exhibitions and events, Money World grew exponentially, and expanded regionally
Money World established its remittance business
Money World was awarded the Singapore E50 Award
Money World was awarded 50 Fastest Growing SME Award

redpajama_set_name: RedPajamaCommonCrawl


This men's ski jacket from the Space Race capsule collection boasts vibrant colours and playful symmetry in homage to the Colmar line from the 1980s. Made with mechanical stretch fabric and the G+ graphene® lining transfers body-generated heat from the warmest to coldest parts of the body, offering a pleasantly comfortable feel and better blood circulation. Soft, natural down feather padding. Jacket laminated with breathable and waterproof technical membrane (15,000 gr/m2/24h), with resistance equal to a water column of 15,000 mm. Item is complete with Recco® reflectors allowing the wearer to be traced in the event of an avalanche.


text:
2019/2020 Main stage/coffee House
Woody Holler and His Orchestra
Winnipeg Symphony Orchestra
Kenzie Jane & Victoria Turko
Royal MTC
Braden Gates
Those Guys
Other Performances
George Canyon Hit After Hit Tour
Myxxd Bagg
Prairie Players Presents - "Mary Poppins"
Amalgamation FAQs
Manitoba Fiddle Association Inc.
The Portage Community Centre Incorporated (William Glesby Centre) and the Portage & District Arts Centre (PDAC) announced today that after months of deliberation, both groups will be pursuing amalgamation. The goal of this amalgamation is to focus the existing resources of both PDAC and the Glesby Centre, to maximize facility use and to create a destination centre that all residents will want to visit.
FAQs
Why is the amalgamation taking place?
There is a real opportunity to focus the existing resources of both the Portage & District Arts Council (who runs PDAC, Portage and District Arts Centre) and the Portage Community Centre Inc. (PCCI, who runs the William Glesby Centre) to maximize facility utilization and create a destination centre that all citizens will want to visit.
Bringing the two organizations together will expand our human resource capacity at both a board and staff level to create the opportunity for us to improve and expand existing programming and introduce new programming and other opportunities.
How did we arrive at this decision?
PDAC and PCCI, after preliminary discussions with the City of Portage la Prairie, decided in early 2016 to investigate the feasibility of an amalgamation of the two organizations. As a result, the PDAC/Glesby Centre Amalgamation Feasibility Committee (the Committee) was formed.
The Amalgamation Feasibility Committee was chaired by Roberta Christianson (a past board Chair of both organizations), Brent Gilbert (Board Director of Southport and the Portage la Prairie Mutual Insurance Company), and the current Chairs of each organization.
The Committee confirmed the current reality that there were two compatible organizations operating separately within one large subdivided building which was not being utilized to its potential capacity even though both staff groups were fully deployed and working hard.
The mandate of the Committee was to study the feasibility of creating one centre of excellence for both the performing and visual arts in Portage la Prairie and surrounding Districts. Significant due diligence and community consultations were performed ahead of a combined meeting of board directors and staff and management of both organizations on Saturday September 23, 2017. It was agreed to pursue amalgamation if the biggest challenge was addressed.
What was the biggest Challenge?
The Glesby Centre is forced to spend a disproportionate amount of money, staff time and board attention on physical plant issues instead of program development to benefit the community. They have been successful is raising these necessary dollars to deal with facility issues, these efforts take away from being able to focus on more programming and a better experience for all stakeholders.
What was a Key Question?
How do we focus the existing resources of both PDAC and the Glesby Centre to maximize facility utilization and create a destination centre that all citizens want to visit?
What was the Answer?
The City of Portage la Prairie, owner of the building, will assume responsibility for the operation and maintenance of the physical plant to allow the creation of an amalgamated entity that focuses its combined resources on programming for the benefit of the community at large. The City has agreed to assume this responsibility as of January 1, 2018; thus removing this huge barrier.
Who is looking after all the amalgamation details?
A Transition committee has been established, led by Delnora Rice and Jeff Dubois as co-chairs and comprised of 2 board members from both PDAC and the Glesby Centre. Mr. Dave Omichinski of Portage la Prairie agreed to serve as a facilitator for the Transition Committee when asked by the Amalgamation Feasibility Committee. Clear terms of reference have been approved to guide the committee.
What are some of the benefits?
We are envisioning an exciting and vibrant new entity that focuses on the arts. Our new entity will have one board and one staff team solely dedicated to arts programming development and delivery. Both organizations will no longer be in competition for funding and visibility. We are confident that this amalgamation will result in efficiencies and will provide one unified voice to advocate for the arts. Both organizations feel that by combining our efforts we will be able to focus our existing resources and maximize the use of our facility to create a destination centre that all citizens will want to visit. Bringing our two organizations together will help us to improve and expand existing programming and introduce new programming and other opportunities to benefit the community at large. For example, we hope to increase our reach to our community schools and Aboriginal populations.
We are planning a Rejuvenation Project. This project would breathe life into our current facilities and make them into a cultural centerpiece for Portage la Prairie now and for years to come. The new centre would become fully accessible to people of all abilities. It would house an enhanced dance studio, studio spaces for artists, a functional classroom/pottery room for art instruction, a performance theatre with improved seating and optimal open exhibition spaces for visual art. The theatre and the classrooms would contain the essential equipment required to provide professional instruction in the arts. This renovation would enhance the appeal of our new site. It would not increase the size of our combined centres, but would make better use of our current space. Having an accessible site with the appropriate technology and equipment, and studio, classroom and performance spaces is essential to the production of masterful art and community engagement in the arts. We strongly believe that it is our role to provide this service to our community. We also intend to pursue matching funding for this project through municipal, provincial and federal grants and community fundraising.
What type of programming changes might happen?
To be determined – but programming should be improved and expanded, not decreased. Combining resources creates a real opportunity for expanded programming in the future. One goal will be to reach out to the School Division to see what opportunities may exist for much greater use of both the Theater and Arts Centre by our youth.
This is not a new issue as there have been many preliminary discussions over the last 10 plus years but those discussion did not go anywhere for a variety of reasons. The work of the Feasibility Committee clearly shows here is a real opportunity for these two compatible organizations to more effectively work together for the good of art throughout the area.
Discussions with key community supporters (business, government and individuals) also showed strong support for a combined entity.
Is this a take over?
No – it is an amalgamation of two similar entities interested in joining all resources into one stronger more vibrant organization for the benefit of the community.
How will staff be impacted?
There will be no job loss because of this merger. Current staff will be retained in positions that will best use their unique skill sets. Margaret Bernhardt-Lowdon will be Executive Director reporting to the Board of Directors and Keith Hutlet will assume the role of Artistic Director. Work will be completed over the next few months on all job descriptions to clarify the roles of all staff.
What will the name be?
The new Board will work through a process to brand a new identity for the new entity and expects this will include input from stakeholders.
From a technical perspective, the legal entities Portage and District Arts Council (who runs PDAC, Portage and District Arts Centre) and the Portage Community Centre Inc. (PCCI, who runs the Glesby Centre) will merge under a new legal name which is separate issue from how the new entity brands itself.
How will the board structure work?
The amalgamated organization will have a 9 person board, three from each PDAC and PCCI existing boards and three new board members from the community with varied term lengths to ensure continuity.


text:
Q: How do I identify who votes on my question?
Possible Duplicate:
See Who is Upvoting/ Downvoting My Question/Answer

I am a new user of this site. Many users give up and down votes to questions. So how do I identify who votes on my question?

A: You can't.
Voting is anonymous by design.

redpajama_set_name: RedPajamaStackExchange


text:
Alessandro D'Ottavio  (26 August 1927 – 25 December 1988) was an Italian boxer. He won the bronze medal at the Olympic Games in 1948 for Italy in the 67 kg category. He was born in Rome, Italy.

1948 Olympic results
Below is the record of Alessandro D'Ottavio, an Italiam welterweight boxer who competed at the 1948 London Olympics:

 Round of 32: defeated George Issaberg (Iran) on points
 Round of 16: defeated Pierre Hernandez (France) on points
 Quarterfinal: defeated Zygmunt Chychla (Poland) on points
 Semifinal:  lost to Julius Torma (Czechoslovakia) on points
 Bronze Medal Bout: defeated Duggie Du Perez (South Africa) on points (won bronze medal)

Professional career
D'Ottavio turned pro in 1950 and captured the vacant Italian light heavyweight title in 1957 with a win over Rocco Mazzola.  He retired the following year after a loss to Mazzola.

References

External links

1927 births
1988 deaths
Boxers from Rome
Welterweight boxers
Light-heavyweight boxers
Boxers at the 1948 Summer Olympics
Olympic boxers of Italy
Olympic bronze medalists for Italy
Olympic medalists in boxing
Italian male boxers
Medalists at the 1948 Summer Olympics
20th-century Italian people

redpajama_set_name: RedPajamaWikipedia


BrightSign state-of-the-art technology is found across the globe, powering digital signage in every vertical market. BrightSign hardware is known for ultimate reliability and an extremely robust OS purpose-built for digital signage. With BrightSign, your digital signage ecosystem can be as simple and turn-key or as specialized and power-packed as the application demands.
Brightsign Network is an affordable, secure and scalable cloud-based digital signage management system that frees you from the complexities of hosting and maintaining your own network.
BrightSign's free BrightAuthor PC application takes the guesswork out of creating, previewing, publishing and managing presentations.
Bypass the digital signage learning curve completely with BrightSign's abundant, easy-to- use features and robust presentation creation tools for building multi-screen video walls, multi-zone screen layouts and more.


Mark Kramer is a journalist and a scholar. He is the writer-in-residence and the director of the Nieman Program on Narrative Journalism at Harvard University. Kramer was recently in Iceland, where he delivered a lecture at the University of Iceland on the subject of narrative journalism. The Grapevine sat down with Kramer for a few questions.
/// Would you describe the concept of 'narrative journalism to us in a few words?
Mark Kramer: The best definition is probably to be found on my website, where it has been thought through, but I am willing to stumble around a bit. The journalism part means it should be factual, and the standard of factuality should be very high, since we are dealing with matters of public trust. Journalism is only useful to the extent that the public trusts. The more so when journalism includes storytelling, and narrative journalism is storytelling journalism. It is journalism that includes as much as possible about what happened, not just the official facts, but also emotions, context, whether taboo or otherwise. It includes all the things, at its bests, that would go into a private judgment of a situation that you might make and share with your partner. So, it opens a vast field of journalistic practise that was previously walled off, and it requires a lot of integrity and skills to do it at that kind of level. It invites in complexities that are avoided by the stilted form of journalism that we are used to. Narrative journalism sets scenes with characters, described with the social and status life of the characters communicated. It also often includes the voice of a storyteller about which the storyteller has made some decisions as to what kind of character should tell the story.
/// How would you contrast narrative journalism to conventional journalism? What are the pros and cons?
/// So, that has to be the next question then, what is news now?
– To my way of thinking, the human condition is, and has always been, news. The retreat into civic information has been a brilliant civic invention. It has been good for democracy, insofar that it is open and candid. If it is trusted and it is not open and candid, it is not good for democracy. But, nowadays, cities in most countries are aggregations of many ethnicities and there are many sources of authority, and there are many senses of what is good and what is bad. It is not enough for journalists simply to be loyal sentinels on the walls of the city, reporting on danger from afar and congratulating sources of internal social cohesion because the world is too complicated for that. And besides that, most readers are getting most of their information from other sources than daily print journalism now. They are getting it from TV news, from radio news in the car They are getting it from the Internet. The breaking civic headlines come in from other sources than newspapers, so there may be room for newspapers to play to their strength, which is sophisticated staff, a little more time, a little more space than broadcast journalism has. But to do so they have to acknowledge the complexities of the questions raised by broadening coverage, so an administrative change has to be made so newspapers can include more narrative journalism. And it has to be from the top. There has to be space for it and an understanding of news that has to be more sophisticated.
/// At what point would you say this school of journalism started?
– Historically? Goodness. If you are a scholar of Mark Twain you can find an article he wrote after interviewing and hanging out with the survivors of a shipwreck as a young journalist in Hawaii that is straight journalism. You can find personal essays of Montaigne that are arguably narrative journalism and diaries of Samuel Pepys that are arguably narrative journalism. It goes way back, but the idea of mixing a description of an actual scene with the presence of a narrator that acknowledges that he is a full human personality, not merely a civil servant in a sentinel's outfit. This is an idea that goes way back. But they started to coalesce as a movement, probably in magazines and book pieces in the 1960s, some of which were collected by Tom Wolfe in his 1972 anthology called The New Journalism. And at the front of that book is a glorious essay by him pretty much explaining the uses and the significance of it in a way that doesn't need much revision. That led to an increased consciousness. Many writers read that book and said 'Aha, so that is a good name –or a bad name – but at least it is a name for what we are doing. The interest in evaluating things for oneself comes from a change in civic trust or the endowment of civic power. Just the fact that people felt they could look at a complex situation and evaluate it for themselves in print and in public comes from a diffusion of authority that is very modern. It stems in part from an increased acknowledgement of what communication theorists call 'the backstage life of public figures'. If politicians have real private emotions and not just pious civic emotions, if they have not just scandalous girlfriends, but actual moods and angers and manipulation and frailties that influence their decisions, why stick to the formal argument if the whole presence of a person explains things better? And from where do Americans suddenly know all about backstage life? They know about it from TV. Not from TV news, which is woefully restricted in what it talks about and how it talks about it, maybe because it is just so damn powerful, but from the rest of TV, from sitcoms where the father is a foolish man and the dog passes gas and soap operas where powerful captains of industry have lovers of several genders on the side. The complex backstage life, once it is acknowledged as an element of explanation, suddenly is conspicuously lacking from newspapers that have been steady in how they explain things.
/// The subject matter of narrative journalists is very varied though.
– Yes, conventional journalism, because of this official voice and because of its focus on civic information for citizens, citizen being the civic identity of a real person who also has many other identities too. Once you broaden the journalism to inform more aspects of someone's life than just the civic identity, the number of subjects expands. Conventional journalism is mostly about disturbances in what is normal. A fire in an area where buildings don't usually burn, a robbery in a bank that doesn't usually get robbed. But there is another story in the bank. How on earth can someone endure being a bank teller for 23 years? Wouldn't that make a good story? And how would you go about collecting that story? Would a reporter go and be a bank teller, maybe not for 23 years, but two or three days? Gain the trust of the bank teller to earn permission to explore that part of their lives? It is a lovely story to tell. The paradox of handling money, such a powerful item, routinely without any personal attachment, there is a little story there. It would take a good writer to make it work, and an interesting choice of subject, but it could work.
Narrative journalism is especially good for exploring routine lives that can symbolise installed social problems, for example, racism. Racism is not like a bank robbery or a fire. It is not something that happens once in a while, living in the poor part of town happens every day, having all of one's neighbours also being black happens every day, going to a food store where the prices are 20 percent more expensive and the quality is not the same happens every day, going to a public school that turns out to be entirely minority, this is a routine event. There has been some beautiful writing exploring these installed social phenomena in newspapers that is just not possible without the tools of narrative journalism. It is one of its most powerful uses.
You can learn more about Mark Kramer and the Nieman Program on Narrative Journalism at: www.narrativedigest.org and www.nieman.harvard.edu/narrative.


text:
Class Action Lawsuit Filed Against Gas Company After Massachusetts Blasts
Lawyers filed a class action lawsuit Tuesday on behalf of people who were forced out of their homes for days when dozens of natural gas explosions and fires ripped through three Massachusetts towns.
The lawsuit is the first of what's likely to be several filed against Columbia Gas and its parent company over Thursday's explosions, which killed one person and injured more than two dozen in Lawrence, Andover and North Andover.
It accuses the utility companies of negligence and seeks compensation for residents of who had to evacuate but didn't suffer injuries or damage to their homes.
Frank Petosa, one of the attorneys who brought the case, said although families were allowed to return to their homes on Sunday, they still don't have gas or hot water and must live in fear that the explosions could happen again.
"These individuals have had their lives turned upside down," said Petosa, of Morgan & Morgan.
Columbia Gas officials didn't immediately respond to an email on Tuesday.
About 8,600 customers were affected by the explosions. Many had to evacuate their homes for days and may have to go without gas service for weeks.
A letter sent by the state's U.S. senators to executives at Columbia Gas and its parent company, NiSource, on Monday said the pressure in natural gas pipelines was 12 times higher than it should have been.
"The federal Pipeline and Hazardous Materials Safety Administration has reported that the pressure in the Columbia Gas system should have been around 0.5 pounds per square inch (PSI), but readings in the area reached at least 6 PSI – twelve times higher than the system was intended to hold," the letter said.
The pressure spike registered in a Columbia Gas control room in Ohio, the senators said in the letter, which requests a reply by Wednesday.
"We write to request that you provide us with information in order to help the American people understand why this terrible disaster occurred, whether the company was sufficiently prepared to respond to an incident of this magnitude, and how we can prevent any similar tragedy in the future," the senators wrote.
The explosions are under investigation by the National Transportation Safety Board. Chairman Robert Sumwalt has said the investigation is partially focused on pressure sensors that were connected to a gas line that was being taken out of service shortly before the blasts.
On Tuesday, Columbia Gas President Stephen Bryant announced that the utility is donating $10 million to an emergency relief fund for people affected by the emergency.
The Greater Lawrence Disaster Relief Fund will help residents of the three communities with food, housing and other short-term needs as they recover, Republican Gov. Charlie Baker said.
Lawrence Mayor Dan Rivera, who has been highly critical of Columbia Gas, said the utility is "living up to their corporate responsibility" with the donation.
Also Tuesday, Moody's Investor's Service said the explosions and fires are likely to damage the finances of Columbia Gas and its parent company.
The Wall Street credit rating firm said the disaster was "credit negative" for Columbia and NiSource Inc., and may cause "the deterioration of each company's financial position."
TikTok Video Helps Louisiana Woman With Storm Claims
Categories: East NewsTopics: deadly natural gas explosion, gas utility sued, Massachusetts home explosions


"Drooff tree planting – action save the forest everyone can change the world!" We live in a world in transition. Sometimes it seems as if mother nature against us people revolted because the density and the extent of the environmental disasters to take. It is high time to embark on a different path and back to give the Earth rather than to exploit them. Without hesitation Joel and Ethan Coen explained all about the problem. This new way may actually start with the purchase of a wood-burning stove. The ecology of the fireplace is romantic and inexpensive to heat the home with a Woodburning stove. Accordingly, more and more homeowners, the stove in addition at least decide to build a conventional central heating. The operation of a wood-burning stove is in addition but also particularly environmentally.
Wood is used as fuel, and this is a renewable resource. The CO2 balance remains balanced during the combustion of wood in the exhaust area, because it is which has recorded the tree during his lifetime and that he also would release, released only the amount of carbon dioxide, if he Naturally rot. Still, modern stoves are designed so that they emit maximum heat for optimum energy efficiency. This is particularly in well-insulated houses. So, for example, the fireplace stove Builder by Drooff cooperate directly with ecologically-oriented architects.
As a result, a stove was developed, which refers to the combustion air its own external connection. A tree as a bonus this ecological orientation is not sufficient but the fireplace stove Builder Drooff. With my own eyes, the company's founder, Uwe Drooff sees every day in Brilon, what immense damage caused the storm Kyrill. 500,000 cubic meters of wood were destroyed in a few hours. This corresponds to the normal angle of ten years. Drooff has decided to help nature and to plant a tree for every sold wood-burning stove. Here, even the new owner of the stove itself can decide whether his tree to be an ash tree, a Beech, a maple a cherry, an elm tree or even a German oak. Drooff at the fire Depot the Concept has convinced also the fire Depot. The combination of ecological orientation and high-quality technology qualified segment at the fire Depot the models of Drooff for our fireplace."explains the management. A newly planted tree alone will not save the world, but if each of us does what is possible in his personal environment, nature has a chance again." Consulting at the fire Depot under the slogan quality around the fire"the fire Depot GmbH leads a wide range of stoves, fireplaces and Pellet stoves and grills of known brand-name manufacturers. Attention the company uses heat exchanger on innovative and future-oriented heating systems such as water-bearing wood stoves and Pellet stoves. The range is rounded off by an extensive range of charcoal and gas grills. The online shop Feuerdepot.de gives customers the ability to purchase comfortable and high-quality products of leading from home manufacturers, without shipping online on comprehensive service having to do without (including National Assembly and connection service).


And this ends Chapter 2. I will be taking a bit of a break, probably a month, but possibly longer. I have planned to take hiatuses between chapters to keep from burning out, but this one has come during a time where I really needed it.
See, I suffer from the mental disorder, MDD or Major Depressive Disorder, and a lot of times I can deal with it fine, but when I least expect it, it can get me… and get me bad. The past week has been a real bad fight with it, but I hope this time off will help me get my head together.
Another thing that has happened is my dog, Daisy, has slipped a disk in her back, making it to where she can't walk at all. To say this has been upsetting among dealing with my separation from my wife and all that… is an understatement. The surgery is super expensive and I have set up a GoFundMe to try and raise money for her surgery, you can check it out here (and please do).
In other news, I will also be going to ANT (Anime North Texas) in November. I will have a booth selling art and merch, even some Da Pukas stuff. Come by and say hi!
And last, but not least, I'd like to ask that you guys consider joining my Patreon. It would help me out a lot, and I'd really appreciate it.
Now I'll leave you with a video of me drawing one of the previous installments of this comic, and if you have the time, please leave comments telling me how much you've enjoyed the comic so far. That would mean a hellova lot to me. Thanks.
Can't wait to see where this goes next chapter.
So excite. The adventure's about to begin!
Okay I just read through the entire archives. The writing is good and a marked improvement from Femmegasm. But having a regular cast and a building storyline, as opposed to the seeming randomness of FG until near the end of its run, does make writing less of a hassle. I'm interested to see what Chapter 3 holds. Good work, Robbie.


text:
← THE GATHERING Enter Studio To Record Ninth Album
ANCIENT RITES Sign To Season of Mist →
STRETCH ARM STRONG – Free At Last
Posted on November 27, 2005 by dr.park
STRETCH ARM STRONG take full advantage of their major label debut with a solid outing in Free At Last. The album provides a strong mix of melodic hardcore, punk, pop punk, and rock. SICK OF IT ALL and SNAPCASE are points of reference but only serve to describe part of the band's sound. "The Hardest Part" kicks open the door with vibrancy and alludes to the high energy songs that lay ahead. There's no denying that STRETCH ARM STRONG possess pop sensibilities and they utilize this to their utmost advantage. Virtually every song here is pretty damn catchy and could easily outclass the popular bands in the mainstream eye that struggle to write a single decent song. Standouts include "The Sound of Names Dropping," "Every Last Minute," and "This Time." As with every STRETCH ARM STRONG album, the lyrics come from the heart which only brings the listeners closer. The production is crisp, bright, and highlights the tight and solid musicianship. Overall, Free At Last should satisfy their dedicated fanbase as well as bring in new fans. (We Put Out Records/East West Records)


Well, it's official. Barney T Rubble gets his own car, as of Monday. Not just any old car of course: this one is a gold, tiger printed , cool and trendy Rav 4! Perfect for Barney, who fits very snugly into it – and with the real advantage that he can step easily into the vehicle without causing him pain or without us having to lift him.
Are we crazy? Definitely but this huge , precious beast has hip dysplasia which is causing a lot of problems. He loves to walk but cannot walk up hill. As we live on the side of the mountain, this is a bit of a problem. So the solution to keeping him fit and making it easy for me to walk him, which is my joy, is to have a means of getting Barney to flatland – then we can , 'go for it'.
We were telling our friends , Wayne and Karen, about this and Wayne believes Barney is buying the car from the money that Jake, (Barneys gorgeous late 'uncle'), stole from Wayne , the night he also 'acquired' Wayne's iPhone! Jake was the, 'Trotter' of dogs, pedalling anything he could steal and doing deals with everyone! Anyway, we're reassured Wayne that we've paid for the car, so Barney is in the clear – and Jake's 'almost' good reputation, is saved!
Will this plan work? Let's hope so! I"ll keep you updated with Barney's and Molly's mobile adventures!
If you're thinking of getting mobile and coming to Cyprus to rent a holiday villa in Coral Bay or Peyia, please get in touch: email to me on enquiries@cyprusvillas.uk.com and I"ll be happy to put the wheels in motion.
Photos of Barney T Rubble for your enjoyment!


text:
You are at:Home»Western Europe»Norway opposes boycott of Israel, will 'rigorously supervise' funding of anti-Israel groups
By Yossi Lempkowicz	 December 27, 2017 2 Comments
OSLO—The Norwegian government announced that it would ''rigorously supervise'' funding of anti-Israel non-governmental organizations (NGOs).
Monday, following in the footsteps of southern neighbor Denmark.
"Boycott creates distance, while the Norwegian government believes in dialogue and cooperation to create mutual trust as part of the solution to the Israeli-Palestinian conflict," said a Norwegian government statement.
"This decision is another expression of the Norwegian government's consistent opposition to boycotts against the State of Israel."
The Norwegian announcement reflects the country's 2018 governmental policy that refuses to support organizations promoting boycotts of Israel.
Israeli Strategic Affairs Minister Gilad Erdan praised Norway's announcement, describing it as a "further, critical step in damaging the pro-boycott organizations" and added that his ministry will continue to act to expose European funding of Palestinian organizations that delegitimize the State of Israel.
"The Domino effect continues… Norway won't be the last," Erdan wrote on his Twitter account.
According to Jerusalem-based NGO Monitor, a large portion of European aid granted to Palestinian NGOs is distributed through the Norwegian Refugee Council. Norway and Sweden are described as the most transparent European countries.
Oslo follows Copenhagen
Last Friday, Denmark also announced that it will cut back on support for Palestinian NGOs and introduce "rigorous" monitoring of the destination of Danish funds.
"Denmark supports a two-state solution to the Israeli-Palestinian conflict and I am sure it will strengthen the work that we will focus on Danish assistance in the future, so we are absolutely sure that the money is being used for the right purposes," said Danish Foreign Minister Anders Samuelsen.
"Israeli and Palestinian civil society organizations can play a key role in attenuating and over time resolving the high-tension conflict between Israelis and Palestinians," he said.
"Denmark supports a two-state solution to the Israeli-Palestinian conflict and I am sure it will strengthen the work that we will focus on Danish assistance in the future, so we are absolutely sure that the money is being used for the right purposes."
Speaking 48 hours after Denmark said that it would implement more stringent vetting of the country's aid to Palestinian NGOs, Prime Minister Binyamin Netanyahu that he had met with Danish Prime Minister Lars Løkke Rasmussen and spoken to Foreign Minister Anders Samuelsen by phone to demand Copenhagen stop supporting organizations that support terrorism and promote boycotts of Israel.
Speaking at the weekly cabinet meeting, Israeli Prime Minister Benjamin Netanyahu said that during meetings with European Foreign Ministers in Brussels earlier this month, he had asked them to tighten conditions for providing money to Palestinian NGOs.
"Denmark has decided to take this step, it is not the first (country), and it will not be the last," Netanyahu said.
The Danish decision followed an internal investigation conducted by the Danish foreign ministry in May that discovered that European money was used to fund a Palestinian women's center in Burka, northwest of Nablus, named after Dalal Mughrabi, the mastermind of the 1978 Coastal Road Massacre that killed 37 people. Samuelsen said that from now on, support for Palestinian NGOs will require "rigorous" supervision.
European funding for Palestinian charities that appear to violate European Union rules has been an issue for Israeli watchdog groups for years. Pro-Israel groups in Israel, in the US and in Brussels regularly accuse European Union Member states of violating EU policy vis-à-vis terror financing in order to fund Palestinian groups with links to terror groups. One such group,
Jerusalem-based watchdog NGO Monitor, says a Ramallah-based donor platform known as the Human Rights and International Humanitarian Law Secretariat serves to funnel EU moneys to organizations that appear to be eligible for Union funding such as the Popular Front for the Liberation of Palestine, which is included on the EU list of terror organizations.
"We have been following the Secretariat, which is supported by Denmark, the Netherlands, Sweden and Switzerland, for more than a decade, said Daniel Laufer, international spokesperson at NGO Monitor. We follow the organization to give transparency to the funds they receive," Laufer told Tazpit Press Service (TPS).
"Denmark's decision is drastic and is testimony [that Denmark wants]change. Taken together with Norway's decision to pull out of the funding mechanism, and with increased parliamentary scrutiny in Switzerland and the Netherlands, Denmark's action highlights the belated awareness among Europeans of the need for due diligence and full transparency in NGO funding."
According to data published on the NGO Monitor website between 2006 and 2018, Denmark provided $12 million of the $45 million total budgeted to Human Rights and International Humanitarian Law Secretariat.


Microsoft continues its slow drip of Windows 10 details with some good news for audiophiles.
According to Joe Belfiore, Microsoft's Operating Systems Group vice president, Windows 10 for phones and small tablets will support FLAC, a popular lossless audio compression format. Belfiore said FLAC support will arrive on smaller Windows 10 devices a few months after the initial preview build, which is due in the next month or so.
Microsoft had already announced system-wide FLAC support for Windows 10 last year, showing a screenshot of FLAC files loaded in Windows Media Player. But Windows 10 will be somewhat different on screens less than 8 inches, lacking a desktop and support for Win32 applications. Those limitations won't have any effect on FLAC support, apparently.
FLAC is the format of choice for high-quality music vendors such as HDTracks, and is popular for sharing audience-recorded live music. Because no data is lost to compression, it can be repeatedly burned to and from CDs or converted to other lossless formats like WAV without any loss in audio quality.
It's worth noting that in response to Belfiore's tweet, several users asked about gapless playback, which eliminates the pauses between locally-stored audio tracks. This capability is notoriously absent from Windows Phone 8.1, but so far there's no word on whether it's coming to Windows 10.
Why this matters: FLAC support on mobile devices would have been of limited use a few years ago, when phones with 8 GB flash drives were more common than 64 GB ones, but it's starting to make more sense as capacity increases. And while it's certainly a niche feature, it could be a killer one for music lovers, especially when paired with the expanded music sync capabilities coming to OneDrive.


Washington Wizards Owner Abe Pollin conducts media interviews after his induction into the GW School of Business Sports Executive Hall of Fame. GWSB celebrated the sports, business and philanthropic legend for 45 years of basketball history and a career defined by giving back, with tributes by NBA Commissioner David Stern, GWU President Steven Knapp, and GW Board of Trustees Chairman W. Russell Ramsey.
Marrying the practical and the profound, our programs help manifest organizational goals, including the pursuit of profits and market growth, with an indelible commitment to purpose and crystal-clear direction.
Specializing in corporate social responsibility, ethical decision-making, branding with integrity, conscious communications, and alignment around a higher purpose, we help leaders and organizations sustain success while building a legacy that leaves the world a better place.
By helping CSR percolate up from the soul of the organization, we guide leaders to infuse teams at every level with a clear sense of identity and transparent, enterprise-wide intention. Together, we strengthen connections and energize success across communities, sectors, nations and the globe.
You want to be a force for good, remain relevant in your market, attract the right partners and inspire employees to bring their whole selves to work? We want to help.


Looking for more sales leads? SEO is the answer.
Our team of experienced and enthusiastic web designers have a true passion for what they do.
Let these professionals web designers in Kuils River create design an eye-catching website for you!
A company's website is often the deciding factor as to whether or not a client will use a service found online. If a site looks unprofessional, lacks important information and has badly designed imagery, a client will simply leave the website and look for a better service provider. However, if a website is professionally designed, highlighting pertinent information and is visually pleasing, a client is more likely to choose to use that service provider. Professional companies need professional websites in order to be successful, so why not contact one of these innovative, creative web designers in Kuils River for all your web design needs? These web designers will work closely with their clients in order to ensure that the site created perfectly represents the company culture and the client's vision. When you click on a website, you want to know what a company is about immediately, not after having read through and clicked on useless buttons and links. The web design experts know precisely where to place images and information to get maximum client attraction. Once your website is complete, it serves as a constant online advertisement for the world to see. If you are interested in getting a fresh, new website designed or need an old one fixed, these expert web designing companies will not disappoint!


text:
Piastowo – wieś w Polsce położona w województwie podkarpackim, w powiecie lubaczowskim, w gminie Lubaczów.

W latach 1975–1998 miejscowość położona była w województwie przemyskim.

Zobacz też
 Piastów

Przypisy

Lubaczów (gmina wiejska)
Wsie w powiecie lubaczowskim


text:
You are here: Home / Richest Athletes / Hockey / Tony Twist Net Worth
Tony Twist Net Worth
If you're looking for Tony Twist's net worth in 2023, then check out how much money Tony Twist makes and is worth today below. By collecting data from the most accurate and reputable resources, we've compiled a collection of the richest celebrities and their net worths.
How Much Is Tony Twist Worth?
In 2023, Tony Twist's net worth was estimated to be $6 Million.
As one of the richest celebrities in the world, people are always wondering how much money Tony Twist has or makes. While it's impossible to calculate the exact amount Tony Twist is worth, we can use publicly available information such as salary, investments, businesses, endorsements, and other income to estimate a net worth for 2023.
Who Is Tony Twist?
Categories:Richest Athletes, Hockey
Fans, please take into consideration that we didn't break into Tony Twist's bank accounts. The Tony Twist net worth and salary figures above have been reported from a number of credible sources and websites. However, there are several factors that affect a celebrity's net worth, such as taxes, management fees, investment gains or losses, marriage, divorce, etc.
Jessy Terrero Net Worth
Jessy Terrero is a Dominican film director and music video director who has a net worth of $6 million. Jessy Terrero was born… – In 2023, Jessy Terrero's net worth was estimated to be…
Moonshiners Tim Smith Net Worth
Tim Smith is an American moonshiner and reality television personality who has a net worth of $150 thousand dollars. Tim… – In 2023, Moonshiners Tim Smith's net worth was estimated to be…
James Booker Net Worth
James Booker was an American musician who had a net worth of $25,000 at the time of his death. He was best known for being a… – In 2023, James Booker's net worth was estimated to be…
Raqi Thunda Net Worth
Raqi Thunda is an American radio DJ and reality television star who has a net worth of $200 thousand. Raqi Thunda has gained… – In 2023, Raqi Thunda's net worth was estimated to be…
John Prine Net Worth
John Prine was an American singer, songwriter, and musician who had a net worth of $10 million at the time of his death. He… – In 2023, John Prine's net worth was estimated to be…
Phil Lynott Net Worth
Phil Lynott was an Irish musician, singer, and songwriter who had a net worth of $2 million. Phil Lynott was born in West… – In 2023, Phil Lynott's net worth was estimated to be…
Cristy Rice Net Worth
Cristy Rice is an American businesswoman and television personality who has a net worth of $10 million dollars. She is… – In 2023, Cristy Rice's net worth was estimated to be…


text:
Q: pass multi dimensional range as parameter python I am using python and munpy. I have 2 dimesional object mask. It is graphic mak with integer coordinates and value.I want to use part of matrix like:
mask[:100,300:]

Is it possible to create variable like range = (:100,300:)
and to use like:
mask[range]

or similar approach

A: You can use the built-in slice
ranges = slice(0, 100), slice(300, None)
mask[ranges]


text:
Category : Motor Vehicle Accident
Home » Motor Vehicle Accident
More Electric Scooter Rentals Mean More Injuries And Fatalities
July 13th, 2021 by Law Offices of Howard Craig Kornberg
Andrew Hardy zoomed around downtown Los Angeles on a rented stand-up electric scooter. While crossing a street, a car traveling 50 mph struck him on the e-scooter, sending him flying 15 feet in the air before crashing down to the...
Road Rage is an Increasing Reason for Car Accidents
January 16th, 2019 by Law Offices of Howard Craig Kornberg
Rush hour traffic has been an anomaly. Why call a time in which most people are standing still in traffic at rush hour? Instead, it feels more like a cement hour or a parking hour. But, for whatever reason, rush...
What Happens If You Get Into A Motorcycle Accident But Have No Motorcycle Insurance?
December 20th, 2018 by Law Offices of Howard Craig Kornberg
Our Los Angeles motorcycle accident attorney hears this particular question in pretty much every phone call with an injured motorcyclist calling the Law Offices of Howard Craig Kornberg. "I have been injured and have liability insurance on my car, but...
New Bird Rides Scooters Causing Mayhem
February 8th, 2018 by Law Offices of Howard Craig Kornberg
Remember that scooter you had so much fun on as a kid? If you haven't experienced the joy of zooming along on two wheels for yourself, maybe your own kids are inseparable from their Razors, Micros, and Mini scooters, and...
Dangers of Lane Splitting (And How They Can Cause Motor Vehicle Accidents)
Did you know that roughly one in six motorcycle accidents in California involves a motorcyclist who is lane-splitting? Even our Los Angeles motor vehicle accident attorney Howard Craig Kornberg can't argue that riding a motorcycle around Los Angeles can be...
How to File a Defective Motor Vehicle Lawsuit Against a Car Maker? (As in Paul Walker's Case With Porsche)
November 9th, 2017 by Law Offices of Howard Craig Kornberg
Defective motor vehicles can be deadly, but is there even the slightest chance you could sue a giant car maker such as BMW? It may be an airbag that fails to deploy in a crash, brakes that won't listen, or...
Pain and Suffering Determination
Many have heard the term pain and suffering related to legal cases like a car accident or serious injury, but do you really know how it's calculated and what it means for your case? Most victims are aware that they...
How Much Marijuana Is Too Much?
As recreational marijuana becomes legal in many states including California the dangers are coming into the spotlight. The biggest concern amongst residents and authorities is the dangers of driving while high on marijuana. Driving while under the influence of alcohol...
2 Firefighters, 2 others injured in Pacoima high-speed collision
A dramatic crash in Pacoima left two Los Angeles firemen in the hospital in fair condition along with two others. The motor vehicle collision happened one morning last month as the first responders were traveling with a patient in an...
Marijuana Use While Driving A Growing Threat?
Now that recreational marijuana use is legal in California, drivers may face heightened risks on the road. "Drugged driving" has become a key issue for law enforcement statewide. After alcohol, marijuana is the most common substance involved in intoxicated driving,...