← Back to Patent Explorer
US5968134A Expired / Lapsed US ⏱️ 0.0 years remaining

Distributed pipes and fifos in a multiprocessor

Assignee: Hewlett Packard Development Co LP
•
Filing: 1997-10-03
•
Granted: 1999-10-19
•
Expires: 2017-10-03
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A multiprocessor that includes a virtual file system providing a file system interface to user application code. This interface allows users to access files in many types of file systems in a consistent, file system-independent manner. In a preferred embodiment, the higher interface of the file system is the Posix file system interface, though it can be any file system interface supporting the capabilities required by a user process. The Posix file system supports regular files, pipes, fifos and special files. A pipe server, a pipe library and a name server together implement the fifo semantics required by the Posix standard for Posix processes. The present invention provides these fifo capabilities to any process which uses the Posix interfaces.

Inventors

  • 👤 Franco Putzolu
  • 👤 Srinivasa D. Murthy
  • 👤 Alan M. Usas
  • 👤 Gary F. Tom
  • 👤 Minoo Gupta
  • 👤 Eric G. Strellis

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 12:13
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/544; G06F16/00; G06F16/10

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 113 words
In a computer system having a plurality of processors, each of said plurality of processors having a respective memory, a method for accessing a first-in/first-out, read-once file, said method comprising: coupling said plurality of processors by means of an inter-processor communications link; requesting on a first of said plurality of processors a service in a file system-independent manner with respect to said file, thereby creating a service request; converting said service request to a file system (FS)dependent and a file system implementation (FSI)-independent service request; converting said FS-dependent and FSI-independent service request to a FS-dependent and FSI-dependent service request; and forwarding said service request to one of said plurality of processors for performance.
Claim 2
Dependent Claim 113 words
In a computer system having a plurality of processors, each of said plurality of processors having a respective memory, a method for accessing a first-in/first-out, read-once file, said method comprising: coupling said plurality of processors by means of an inter-processor communications link; requesting on a first of said plurality of processors a service in a file system-independent manner with respect to said file, thereby creating a service request; converting said service request to a file system (FS)dependent and a file system implementation (FSI)-independent service request; converting said FS-dependent and FSI-independent service request to a FS-dependent and FSI-dependent service request; and forwarding said service request to one of said plurality of processors for performance.
Claim 3
Dependent Claim 10 words
The method of claim 1 wherein said file is unnamed.
Claim 4
Dependent Claim 20 words
The method of claim 2 further comprising the step of allocating a data structure enabling operations on said file itself.
Claim 5
Dependent Claim 10 words
The method of claim 1 wherein said file is named.
Claim 6
Dependent Claim 37 words
The method of claim 4 further comprising the steps of allocating a first data structure enabling operations on a directory entry for said file; and allocating a second, distinct data structure enabling operations on said file itself.
Claim 7
Dependent Claim 82 words
The method of claim 1 further comprising the step of locating said file on one of said plurality of processors; and wherein said step of forwarding comprises determining the location of said file; and forwarding said service request to said first processor if said first processor is the location of said file; and forwarding said service request to another of said plurality of processors by means of an inter-processor message interface if said first processor is not the location of said file.
Claim 8
Dependent Claim 52 words
The method of claim 6 wherein said step of forwarding said service request to said first processor if said first processor is the location of said file comprises forwarding said service request to said first processor by means of an intra-process procedure if said first processor is the location of said file.
Claim 9
Dependent Claim 115 words
An article of manufacture comprising, a communications link; a plurality of processors intercoupled by the communication link, each of the plurality of processors having a respective memory wherein is located a computer program for causing such processor to access a first-in/first-out, read-once file by requesting on a first of said plurality of processors a service in a file system-independent manner with respect to said file, thereby creating a service request; converting said service request to a file system (FS)-dependent and a file system implementation (FSI)-independent service request; converting said FS-dependent and FSI-independent service request to a FS-dependent and FSI-dependent service request; and forwarding said service request to one of said plurality of processors for performance.
Claim 10
Dependent Claim 115 words
An article of manufacture comprising, a communications link; a plurality of processors intercoupled by the communication link, each of the plurality of processors having a respective memory wherein is located a computer program for causing such processor to access a first-in/first-out, read-once file by requesting on a first of said plurality of processors a service in a file system-independent manner with respect to said file, thereby creating a service request; converting said service request to a file system (FS)-dependent and a file system implementation (FSI)-independent service request; converting said FS-dependent and FSI-independent service request to a FS-dependent and FSI-dependent service request; and forwarding said service request to one of said plurality of processors for performance.
Claim 11
Dependent Claim 117 words
An article of manufacture comprising a medium for data storage wherein is located a computer program for causing a processor between or among a plurality of processors, coupled by means of an inter-processor communications link and each having a respective memory, to access a first-in/first-out, read-once file by requesting on a first of said plurality of processors a service in a file system-independent manner with respect to said creating a service request; converting said service request to a file system (FS)dependent and a file system implementation (FSI)-independent service request; converting said FS-dependent and FSI-independent service request to a FS-dependent and FSI-dependent service request; and forwarding said service request to one of said plurality of processors for performance.
Claim 12
Dependent Claim 117 words
An article of manufacture comprising a medium for data storage wherein is located a computer program for causing a processor between or among a plurality of processors, coupled by means of an inter-processor communications link and each having a respective memory, to access a first-in/first-out, read-once file by requesting on a first of said plurality of processors a service in a file system-independent manner with respect to said creating a service request; converting said service request to a file system (FS)dependent and a file system implementation (FSI)-independent service request; converting said FS-dependent and FSI-independent service request to a FS-dependent and FSI-dependent service request; and forwarding said service request to one of said plurality of processors for performance.

References Cited (Backward Citations)

US4782442A Cited
US4694396A Cited
US4833651A Cited
US5303379A Cited
US5253342A Cited
US5325492A Cited
US5247616A Cited
US5265250A Cited
US5287453A Cited
US5329619A Cited
US5787300A Cited
US5724512A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-10-18 2003-04-19 2003-10-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-10-18 2007-04-19 2007-10-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-10-18 2011-04-19 2011-10-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag