Search

Mitchell Neil Rosich

from Indio, CA
Age ~59

Mitchell Rosich Phones & Addresses

  • Indio, CA
  • 92 Canterbury Hill Rd, Acton, MA 01720 (978) 266-0203
  • Box Elder, SD
  • 484 Chicopee Row, Groton, MA 01450 (978) 448-5961
  • 3 Little Hollow Ln, Groton, MA 01450 (978) 448-5961
  • Blacksburg, VA
  • West Palm Beach, FL
  • Hartford, KY
  • 92 Canterbury Hill Rd, Acton, MA 01720

Work

Position: Sales Occupations

Education

Degree: Graduate or professional degree

Publications

Us Patents

Page Mode And Nibble Mode Dram

View page
US Patent:
55879640, Dec 24, 1996
Filed:
Apr 1, 1996
Appl. No.:
8/625990
Inventors:
Mitchell N. Rosich - Groton MA
William L. Lippitt - Cumbuland RI
Assignee:
Digital Equipment Corporation - Maynard MA
International Classification:
G11C 700
US Classification:
3652385
Abstract:
A page mode/nibble mode dynamic random access memory (DRAM) comprising row and column decoders, the column decoder further comprising a column address buffer and a column address buffer counter. The page mode/nibble mode DRAM also comprises a buffer controller means adapted to receive a write enable signal and to determine whether the DRAM should be placed in a page mode or a nibble mode to facilitate the particular memory access requested by a memory controller. An asserted write enable signal, may indicate, for example, a write operation, thereby calling for the page mode/nibble mode DRAM to move into a page mode to effectuate the write operation. The page mode/nibble mode DRAM also utilizes the write enable signal in the conventional manner, to indicate the initiation of a particular type of memory access, namely a write operation or a read operation.

Buiffet For Gathering Write Requests And Resolving Read Conflicts By Matching Read And Write Requests

View page
US Patent:
52242145, Jun 29, 1993
Filed:
Apr 12, 1990
Appl. No.:
7/508335
Inventors:
Mitchell N. Rosich - Acton MA
Assignee:
Digital Equipment Corp. - Maynard MA
International Classification:
G06F 1314
US Classification:
395250
Abstract:
Read-write buffer apparatus is provided for reducing the time necessary to resolve read conflicts during normal and block mode read requests. Additionally, the read-write buffer apparatus provides a means for gathering non-sequential write requests in an internal write buffer, thus reducing the frequency of a buffer full condition. The enhanced read-write buffer apparatus minimizes CPU wait states, while increasing the CPU processing rate and improves overall data processing system throughput.

Non-Volatile Memory Module

View page
US Patent:
57989613, Aug 25, 1998
Filed:
Aug 23, 1994
Appl. No.:
8/294481
Inventors:
Christopher A. Heyden - Belmont MA
Jeffrey S. Kinne - Millis MA
Mitchell N. Rosich - Groton MA
Jeffrey A. Wilcox - Bourne MA
Jeffrey L. Winkler - Princeton MA
Assignee:
EMC Corporation - Hopkinton MA
International Classification:
G11C 502
US Classification:
365 52
Abstract:
A non-volatile memory module includes a charging circuit, a battery couple to the charging circuit, a volatile memory and an electronic switch coupled between the volatile memory and the battery.

Apparatus For Processing Bit Streams

View page
US Patent:
51465604, Sep 8, 1992
Filed:
Mar 15, 1991
Appl. No.:
7/671176
Inventors:
Marshall R. Goldberg - Mason NH
Mitchell N. Rosich - Acton MA
Assignee:
Digital Equipment Corporation - Maynard MA
International Classification:
G06F 738
US Classification:
395200
Abstract:
Apparatus for processing a stream of bits including a hardware comparator that compares first predetermined bits of the stream, comparison input means to provide a table of comparison values to said hardware comparator for comparison with said predetermined bits of said stream, the comparison input means being programmmable to provide one of a plurality of different tables in response to a table select control signal, an index generator for generating an index based on the states of the predetermined bits, and a processor for accessing the index and processing a group of the bits in at least one of a plurality of different ways based on the index.

Method And Apparatus For Testing Raid Systems

View page
US Patent:
55748554, Nov 12, 1996
Filed:
May 15, 1995
Appl. No.:
8/440952
Inventors:
Mitchell N. Rosich - Groton MA
William F. Beckett - Framingham MA
John W. Bradley - Peabody MA
Robert DeCrescenzo - North Attleboro MA
Assignee:
EMC Corporation - Hopkinton MA
International Classification:
G06F 1100
US Classification:
39518317
Abstract:
An error injection test scripting system that permits a test engineer to select from a series of commands those that will induce a desired test scenario. These commands are presented to a parser, either in command line form or as a batch of commands, which parses the syntax of the commands and associated parameters, to create a task list which is communicated to a scheduler. The scheduler handles the execution of the tasks in the list, converts parameters to explicit logical block test sequences and maintains test results. Tasks such as error injection use a special protocol (which the unit under test must be able to understand and interpret) to circumvent standard bus and controller protocols, so that test data, such as corrupt parity or multiple hard error failures can be sent to the disks in the RAID system, while bypassing the RAID array management functions that would otherwise automatically correct or prevent the errors. The scenario of injected errors to be tested is then executed through a tester, the results are evaluated and posted back to the scheduler.

Data And Parity Prefetching For Redundant Arrays Of Disk Drives

View page
US Patent:
53094514, May 3, 1994
Filed:
Aug 12, 1992
Appl. No.:
7/929080
Inventors:
Eric S. Noya - Groton MA
Randy M. Arnott - Clinton MA
Mitchell N. Rosich - Groton MA
Assignee:
Digital Equipment Corporation - Maynard MA
International Classification:
G06F 1100
US Classification:
371 404
Abstract:
A method for prefetching the data and parity blocks for generating parity data of a stripe. The method uses a low and high thresholds marker indicative of a first and second level of fullness of the cache to determine whether or not to prefetch the data and parity blocks. If the cache is filled to a level exceeding the first level of fullness, the data and parity blocks are prefetched for any blocks to be written to the disk drive between the low and high threshold. The data and parity blocks are read from the disk drive at a lower processing priority in anticipation of the writing of the block.

System For Controlling A Write Cache And Merging Adjacent Data Blocks For Write Operations

View page
US Patent:
55510027, Aug 27, 1996
Filed:
Jul 1, 1993
Appl. No.:
8/086453
Inventors:
Mitchell N. Rosich - Groton MA
Eric S. Noya - Groton MA
Randy M. Arnott - Clinton MA
Assignee:
Digital Equipment Corporation - Maynard MA
International Classification:
G06F 1212
US Classification:
395461
Abstract:
A data storage system includes a multi-tasking processor which manages a write cache to identify adjacent blocks held in the write cache which are to be included in a next write operation, while at the same time handling data transfer requests from a system host. The processor monitors the write cache and when the cache has fewer than a predetermined number of storage locations free, initiates a block-merge task. The processor then determines which block in the write cache is least recently used and, based on virtual block numbers assigned to the data blocks, identifies the blocks in the write cache which are adjacent to the least recently used block and are within the same chunk as that block. The processor maintains a list of these adjacent blocks and the locations in which the blocks are held in the write cache. Thereafter, when the cache has fewer than a lower predetermined number of adjacent blocks free, the processor transfers block identifiers and the addresses of the blocks in the write cache to the data storage device, which allows the data storage device to retrieve the data blocks from the write cache in the order in which they are to be stored on the storage device.

System For Controlling A Write Operation Involving Data Held In A Write Cache

View page
US Patent:
57651930, Jun 9, 1998
Filed:
Jul 9, 1996
Appl. No.:
8/680583
Inventors:
Mitchell N. Rosich - Groton MA
Eric S. Noya - Groton MA
Jeffrey T. Wong - Framingham MA
Assignee:
Digital Equipment Corporation - Maynard MA
International Classification:
G06F 1200
US Classification:
711136
Abstract:
A data storage system includes a multi-tasking processor which manages a write cache to identify adjacent blocks held in the write cache which are to be included in a next write operation, while at the same time handling data transfer requests from a system host. The processor monitors the write cache and when the cache has fewer than a predetermined number of storage locations free, initiates a block-merge task. The processor then determines which block in the write cache is least recently used and, based on virtual block numbers assigned to the data blocks, identifies the blocks in the write cache which are adjacent to the least recently used block and are within the same chunk as that block. The processor maintains a list of these adjacent blocks and the locations in which the blocks are held in the write cache. Thereafter, when the cache has fewer than a lower predetermined number of adjacent blocks free, the processor transfers block identifiers and the addresses of the blocks in the write cache to the data storage device, which allows the data storage device to retrieve the data blocks from the write cache in the order in which they are to be stored on the storage device.
Mitchell Neil Rosich from Indio, CA, age ~59 Get Report