The invention is made in the technical field of real-time streaming of two or more data streams in parallel to a solid state memory device array.
Digital video cameras capture frames at a frame rate and with a frame resolution by help of an image capturing device being for instance a complementary metal-oxide semiconductor (CMOS) or a charge coupled device (CCD). The frame rate and the frame resolution result in a capture data rate.
For professional applications, frame rate and resolution need to be high. Additionally, compression is not well accepted in live production capture or digital cinematography workflows. So, the capture data rate of professional video equipment and, thus, the data rate of the data stream produced by such professional video equipment are high as well.
Captured frames need to be stored. For storage in real-time, the storage data rate has to meet the capture data rate. But, commonly used slow memorizing devices like solid state memories (e.g. flash memories, phase change random access memories or magneto-resistive random access memories) do have storage data rates which are significantly lower than said high capture data rate resulting in professional applications.
Therefore, a solid state memory device set comprising several solid state memory devices is used. The solid state memory devices in the memory device set are provided with data in parallel. So, the storage data rate of the memory device set equals the cumulated storage data rates of the solid state memory devices comprised in said memory device set.
For synchronizing purposes the solid state memory device set is hosted in a device for real-time streaming which comprises receiving means for receiving a data stream, e.g. from the video camera's image capturing device. For synchronization, received data is buffered in a cache buffer, for instance a dynamic random access memory (DRAM), prior to being transferred to one of the solid state memory device set by a bus.
Solid state memory devices commonly comprise one or more solid state memory dies, also called memory units, adapted for writing data in fixed data amount units, so-called pages. To do so, each memory die may be equipped with or comprise a page buffer (e.g. SRAM) into which a data amount corresponding one page is copied from the cache buffer in a burst which takes a page-receiving-time t_r. After copying one page, the solid state memory die becomes inaccessible for a page-writing-time wrt_tm which is the time it takes to write the received page from page buffer to the solid state memory unit.
Video productions more and more produces several data streams in parallel, e.g. an audio stream and a video stream or, for 3D video, a main video stream and one or 30 more satellite video streams or a main video stream and a depth data stream, to name a few, each coming along with an individual data rate.
If the individual data rates are known in advance and fixed, optimized hardware layout as well as an associated bus control method is easy to achieve.
But, if data rates or their variations are not known in advance or if even the number of streams to be handled is unknown, specification of optimized hardware layout for the device for real-time streaming as well as corresponding bus control method is an unsolved problem not even published in the art, yet.
The invention proposes a device for real-time streaming to an array of solid state memory device sets, said device comprising receiving means for receiving data from data streams of individual data rate in parallel, an input cache for buffering received data, a bus system for transferring data from the input buffer to the solid state memory device sets, and a controller adapted for using a page-receiving-time t_r, a page-writing-time wrt_tm, the data amount p and the individual data rates for dynamically controlling the bus system such that data received from the first data stream is transferred to solid state memory device sets comprised in a first subset of said array of solid state memory device sets, only, and data received from the at least a second data stream is transferred to solid state memory device sets comprised in a different second subset of said array of solid state memory device sets, only.
More precisely, the invention proposes a device for real-time streaming to an array of solid state memory device sets comprising the features of claim 1.
When in play-out or read mode, there is a benefit from sorted data streams per subset. Since there are almost no read-out penalty cycles with the solid state memory device sets, according devices can be reordered by mapping appropriate chip select lines, so that the data can be provided with full bus speed for single data streams.
The features of a further advantageous embodiment of the real-time streaming device are specified in the dependent claim.
The invention further proposes a bus control method suited to be used in a real-time streaming device for streaming two or more data streams to an array of solid state memory device sets, said method comprises the features of claim 3.
Exemplary embodiments of the invention are illustrated in the drawings and are explained in more detail in the following description. The exemplary embodiments are explained only for elucidating the invention, but not limiting the invention's scope and spirit defined in the claims.
In the figures:
This multi-stream recording architecture may use other solid state memories which rely on page-based writing instead of NAND flash memory. In the example depicted in
The example shows an input data stream of 2 Gbit/s data rate and four input streams of 1 Gbit/s data rate each. Imagined is a sampling after eight seconds. Then the input cache is filled and a virtual mapping can be done according to
It is important to know that when writing to each memory device set, this memory device set needs internal write-back penalty cycles before writing again to the same memory device set. In the mentioned example the architecture is advantageously designed in the manner that when all other seven memory device sets are written, the first mentioned device set is ready for writing again, so a sustained writing over all eight memory device sets is mandatory. Also, it is to be noticed, that a Flash memory does a write-back only on a complete Flash page size of data. Because of these limitations in write-back behaviour, a small input cache has to be introduced to provide only complete pages of data to the Flash memory device sets. This input cache can be designed global as exemplarily shown in
While recording, different data streams are sorted advantageously to certain memory device sets on the bus. In the example, up to seven (plus one with 10% bit rate, due to f_por) independent input streams are possible to record. All can share a data bandwidth of up to 9 Gbit/s. The behaviour of bandwidth allocation is in principle fully dynamical, but memory device set usage per input stream increases every 1.125 Gbit/s bandwidth portion need. The memory device set count is limited to eight, as already mentioned.
Multiple degrees of freedom can be reached by putting more memory device sets on the busses. Here, timing will be relaxed and more independent data streams can be recorded.
When in play-out or read mode, this architectural approach can benefit from sorted data streams per memory device set. Since there are almost no read-out penalty cycles with the Flash memories, according memory device sets can be reordered by mapping appropriate memory chip select lines, so that the data can be provided with full bus speed (here 9 Gbit/s) for single data streams, alternatively several streams in parallel can be arranged as wanted.
Let Dmax denote the maximum input data rate an exemplary real time streaming device may handle, p denote the data amount comprised in one page and n denote the number of solid state memory devices comprised in one memory device set. Further, let Tr denote time required for burst copying up to n pages to a memory device set and Tw denote the time required for writing the burst-copied n pages into the memory units of the memory device set. Thus, the memory device set has a data rate Dset
Then, the following equation for Tr, the time required for burst copying up to n pages to a memory device set, holds:
since the number of device sets N has to chosen such that
(N−1)*Tr=Tw
Said exemplary real-time streaming device then may handle up to k Streams S0 . . . Sk−1 with data rates D0 . . . Dk−1, as long as the following condition is satisfied:
Σi=0k−1(Di−mod(Di,DSet))<Dmax−k*DSet=(N−k)*DSet
Thus, at most k=(N-1) can be handled in parallel.
Suppose Di>=Dj for i>j. There are allotted individual cache buffering capacities C0 . . . Ck for the streams.
Let
denote the time required to accumulate data amount p from stream Si in cache buffer. Further, let adjuvant variables qk−1 i=0, . . . , k and Q be defined as:
and
Q=max(qk,qk−1,qk−2, . . . , q1,q0)
Burst copying data from the stream with the highest data rate, Sk, cannot start earlier than start time tk′:
t′k=tk−Tr
Thus, burst copying of data received from stream Sk−1 may start no earlier than tk but may be retarded until tk−1−Tr has elapsed as the data amount of one page is required for burst copying. Thus, burst copying data from the stream Sk−1, cannot start earlier than start time t′k−1:
t′k=max(tk,tk−1−Tr)=max(qk,qk−1)*Tr
And, burst copying data from the stream Sk-i, cannot start earlier than start time t′k−1:
t′k−i=max(qk, . . . , qk−i)*Tr+(i−1)*Tr
Further, burst copying data from the stream S0, cannot start earlier than start time t′0:
t′0=Q*Tr+(k−1)*Tr
Thus, minimum overall cache buffering capacity Cmin may be determined as
Cmin=Σi=0kt′i*Di=Tr*Σi=0k(max(qk, . . . , qk−1)=(i−1))*Di
Since, by definition, Dk>=Di, and
an upper bound of minimum overall cache buffering capacity Cmin may be determined:
Bandwidth allocation of multiple streams may be done in equal portions of the maximum provided bandwidth divided by the amount of Flash memory device sets per bus N over a bus-count n, i.e. the number of parallel busses. Presupposed is that the maximum available bandwidth is totally covered by the interleaving of all exemplary Flash memories on the busses.
When the amount of interleaved exemplary Flash memory device sets per bus is N then the upper bound for the size of one portion can be determined as
According to the proposed architecture, N streams can allocate (N-1) portions. Since one additional bandwidth portion of N can be dynamically consumed by scheduling, in theory the rest of this portion is available for allocation, too, but in practise scheduling algorithms become more simple and regular, when not using parts of this additional portion.
Number | Date | Country | Kind |
---|---|---|---|
09305546 | Jun 2009 | EP | regional |
Number | Name | Date | Kind |
---|---|---|---|
5586264 | Belknap et al. | Dec 1996 | A |
5592612 | Birk | Jan 1997 | A |
5712976 | Falcon et al. | Jan 1998 | A |
5938734 | Yao et al. | Aug 1999 | A |
6104861 | Tsukagoshi | Aug 2000 | A |
6134596 | Bolosky et al. | Oct 2000 | A |
6167496 | Fechner | Dec 2000 | A |
6205525 | Korst | Mar 2001 | B1 |
6330645 | Harriman | Dec 2001 | B1 |
6366970 | Wolff et al. | Apr 2002 | B1 |
6477541 | Korst et al. | Nov 2002 | B1 |
6977871 | Tsumagari et al. | Dec 2005 | B2 |
7046805 | Fitzhardinge et al. | May 2006 | B2 |
7093277 | Perlman | Aug 2006 | B2 |
7366826 | Gorobets et al. | Apr 2008 | B2 |
7386129 | Perlman | Jun 2008 | B2 |
7386655 | Gorobets et al. | Jun 2008 | B2 |
7388932 | Zhang et al. | Jun 2008 | B1 |
7412560 | Smith et al. | Aug 2008 | B2 |
7463598 | Ng et al. | Dec 2008 | B1 |
7463737 | Gillon et al. | Dec 2008 | B2 |
7490196 | Unno | Feb 2009 | B2 |
7542656 | Cho et al. | Jun 2009 | B2 |
7647459 | Zhang et al. | Jan 2010 | B2 |
7702015 | Richter et al. | Apr 2010 | B2 |
7760987 | Cho et al. | Jul 2010 | B2 |
7809994 | Gorobets | Oct 2010 | B2 |
7869700 | MacLean et al. | Jan 2011 | B2 |
7975061 | Gokhale et al. | Jul 2011 | B1 |
7995652 | Washington | Aug 2011 | B2 |
8156089 | Pantos et al. | Apr 2012 | B2 |
20030131191 | Zhang et al. | Jul 2003 | A1 |
20030233396 | Wolfe, Jr. | Dec 2003 | A1 |
20090279613 | Suzumura | Nov 2009 | A1 |
20100023674 | Aviles | Jan 2010 | A1 |
Number | Date | Country |
---|---|---|
0735508 | Oct 1996 | EP |
0737929 | Oct 1996 | EP |
0762300 | Mar 1997 | EP |
03065189 | Aug 2003 | WO |
Entry |
---|
European Search Report dated Nov. 20, 2009 for EP 09 30 5546. |
Number | Date | Country | |
---|---|---|---|
20100318689 A1 | Dec 2010 | US |