Chained DMA devices for crossing common buses

Electrical computers and digital processing systems: memory – Storage accessing and control – Specific memory composition

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364DIG1, 711163, 395842, G06F 1336

Patent

active

056641427

ABSTRACT:
Chaining or cascading two or more DMA devices to perform DMA transfers across common buses. DMA devices are modified to act as a bus slave relative to another DMA bus master device so that information can be transferred from one bus to another across a third bus common to the DMA devices. The slave DMA can cause the master DMA to stop sending data to limit the bandwidth requirements of the common bus.

REFERENCES:
patent: 4354225 (1982-10-01), Frieder et al.
patent: 4400775 (1983-08-01), Nozaki et al.
patent: 4428044 (1984-01-01), Liron
patent: 4490788 (1984-12-01), Rasmussen
patent: 4495567 (1985-01-01), Treen
patent: 4527237 (1985-07-01), Frieder et al.
patent: 4682285 (1987-07-01), Ozil et al.
patent: 4773000 (1988-09-01), Nissen
patent: 4837677 (1989-06-01), Burrus, Jr. et al.
patent: 4878166 (1989-10-01), Johnson et al.
patent: 5056011 (1991-10-01), Yoshitake et al.
Article titled "High-Speed Multi-Master Channel Interface", IBM Technical Disclosure Bulletin, vol. 30, No. 11, Apr. 1988, pp. 317-319.
Article titled "Direct Memory Access Controller (DMAC)", Microprocessor, Microcontroller and Peripheral Data, vol. 11, DL139, 1988.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Chained DMA devices for crossing common buses does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Chained DMA devices for crossing common buses, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chained DMA devices for crossing common buses will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-316062

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.