Search

Ofer Bar

from Medford, MA
Age ~60
Get Report
Also known as:
Ofer Barr
Related to:
Maayan RosenbluthUri RosenbluthRosenbluth GalEmil Bar, 91Daniel Bar, 46Iris Bar, 61
Connected to:
Avi Bar, 48Cesar A Bar, 45Daniel I Bar, 42Diego A Bar, 36Farris A Bar, 44Gregory J Bar, 69Linda C Bar, 74Matt T Bar, 46Michael W Bar, 63Paul W Bar, 67

Ofer Bar Phones & Addresses

  • Medford, MA
  • Venice, CA
  • Natick, MA
  • Santa Monica, CA
  • Seattle, WA
  • Redmond, WA

Industries

Higher Education

Resumes

Resumes

Ofer Bar Photo 1

Prof. At Harvard University

View page
Location:
Greater Boston Area
Industry:
Higher Education

Publications

Wikipedia

Ofer BarYosef

View page

Ofer Bar-Yosef (born 1937) is an Israeli archaeologist whose main field of study has been the Palaeolithic period. He was Professor of Prehistoric Archaeology ...

Us Patents

Method And System Of An Application Program Interface For Abstracting Network Traffic Control Components To Application Programs

View page
US Patent:
6807667, Oct 19, 2004
Filed:
Sep 21, 1998
Appl. No.:
09/157645
Inventors:
Ofer Bar - Newcastle WA
Eric L. Eilebrecht - Seattle WA
Yoram Bernet - Seattle WA
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 300
US Classification:
719320, 719321, 719328
Abstract:
A traffic control application programming interface for abstracting the use of traffic control components to client applications to provide quality of service. The traffic control interface accepts input from a client application and based on that input, communicates with the operating system to control kernel level traffic control components. The client can register with the traffic control interface, and it can open and close interfaces, add, modify, and delete flows on those interfaces, and attach or delete filters on the flows. The client can also obtain data on any currently active interface, flow, or filter. The traffic control interface will send the appropriate message to the operating system, directing that the necessary tasks be performed by either a packet scheduler or a packet classifier. Those kernel level components then return through the operating system the results of the operations requested, and that return data will be passed back to the client application.

Generation And Validation Of Reference Handles

View page
US Patent:
61050393, Aug 15, 2000
Filed:
Jun 23, 1998
Appl. No.:
9/103334
Inventors:
John R. Douceur - Bellevue WA
Yoram Bernet - Seattle WA
Ofer Bar - Newcastle WA
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 1730
US Classification:
707201
Abstract:
The present invention is embodied in a system and method for generating and validating reference handles for consumers requiring access to resources in a computer system. The system of the present invention includes a resource manager having a handle administrator, a plurality of consumers, and a plurality of resources. The handle administrator includes an assignment routine, a release routine, and a dereference routine. The assignment routine issues new handles, the release routine releases handles that are no longer required (thus rendering the handle invalid), and the dereference routine dereferences handles into a pointer to a resource, which entails verifying that the handle is valid. Also included is an auxiliary sub-routine for managing used and unused records, an expansion sub-routine for efficiently expanding the handle database, a handle recycling sub-routine for recycling handles, a contraction sub-routine for efficiently contracting the handle database, a hysteresis sub-routine for probabilistically contracting the handle database, and a memory allocation failure sub-routine to improve functionality in the event of memory allocation failure.

System And Method For Recycling Numerical Values In A Computer System

View page
US Patent:
61784230, Jan 23, 2001
Filed:
Jun 23, 1998
Appl. No.:
9/103089
Inventors:
John R. Douceur - Bellevue WA
Yoram Bernet - Seattle WA
Ofer Bar - Newcastle WA
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 1730
US Classification:
707 9
Abstract:
The present invention is embodied in a system and method for generating and validating reference handles for consumers requiring access to resources in a computer system. The system of the present invention includes a resource manager having a handle administrator, a plurality of consumers, and a plurality of resources. The handle administrator includes an assignment routine, a release routine, and a dereference routine. The assignment routine issues new handles, the release routine releases handles that are no longer required (thus rendering the handle invalid), and the dereference routine dereferences handles into a pointer to a resource, which entails verifying that the handle is valid. Also included is an auxiliary sub-routine for managing used and unused records, an expansion sub-routine for efficiently expanding the handle database, a handle recycling sub-routine for recycling handles, a contraction sub-routine for efficiently contracting the handle database, a hysteresis sub-routine for probabilistically contracting the handle database, and a memory allocation failure sub-routine to improve functionality in the event of memory allocation failure.

Generation And Validation Of Reference Handles In A Multithreading Environment

View page
US Patent:
61855642, Feb 6, 2001
Filed:
Jun 23, 1998
Appl. No.:
9/103297
Inventors:
John R. Douceur - Bellevue WA
Yoram Bernet - Seattle WA
Ofer Bar - Newcastle WA
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 1730
US Classification:
707 9
Abstract:
The present invention is embodied in a system and method for generating and validating reference handles for consumers requiring access to resources in a multi-threaded environment of a computer system. The system of the present invention includes a resource manager having a handle administrator, a plurality of consumers, and a plurality of resources. The handle administrator includes an assignment routine, a release routine, a dereference routine, and multi-threading sub-routines enabling operation of the present invention in multi-threaded environments. The assignment routine issues new handles, the release routine releases handles that are no longer required (thus rendering the handle invalid), the dereference routine dereferences handles into a pointer to a resource, which entails verifying that the handle is valid, and the multi-threading sub-routines enable safe invalidation of handles in multi-threaded environments and also ensure consistent use of pertinent values, such as array pointers and array sizes during operation of the expansion and contraction sub-routines.

Apparatus And Accompanying Methods, Using A Trie-Indexed Hierarchy Forest, For Storing Wildcard-Based Patterns And, Given An Input Key, Retrieving, From The Forest, A Stored Pattern That Is Identical To Or More General Than The Key

View page
US Patent:
59959711, Nov 30, 1999
Filed:
Sep 18, 1997
Appl. No.:
8/933477
Inventors:
John R. Douceur - Bellevue WA
Ofer Bar - Newcastle WA
Yoram Bernet - Seattle WA
Assignee:
Micdrosoft Corporation - Redmond WA
International Classification:
G06F 1730
US Classification:
707102
Abstract:
A technique, specifically apparatus and accompanying methods, which utilizes a trie-indexed hierarchy forest ("rhizome") that accommodates wildcards for retrieving, given a specific input key, a pattern stored in the forest that is identical to or subsumes the key. The rhizome contains a binary search trie and a hierarchy forest. The search trie provides an indexed path to each unique, most specific, pattern stored in a lowest level of the hierarchy forest and also possibly to increasingly general patterns at higher levels in the pattern hierarchy. The hierarchy forest organizes the patterns into nodal hierarchies of strictly increasing generality. For use as a packet classifier, the rhizome stores wildcard-based packet classification patterns at separate corresponding pattern nodes, along with, corresponding "reference" fields associated therewith. Operationally, as each different queue is established or removed, a corresponding classification pattern is either inserted into or removed from the rhizome. A search key is formed for each packet, typically by concatenating classification fields, e. g.

Method And Computer Program Product For Scheduling Network Communication Packets Originating From Different Flows Having Unique Service Requirements

View page
US Patent:
62470612, Jun 12, 2001
Filed:
Jun 9, 1998
Appl. No.:
9/094045
Inventors:
John R. Douceur - Bellevue WA
Yoram Bernet - Seattle WA
Ofer Bar - Newcastle WA
Carol Ann Bell - Beaverton OR
Tsung-Yuan Charles Tai - Portland OR
Rajendra S. Yavatkar - Portland OR
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 1516
G06F 1576
US Classification:
709240
Abstract:
A method and computer program product for scheduling network communication packets in a multimedia environment where different packet streams have reservations of network bandwidth to form packet flows. The present invention divides the packet scheduling function into distinct components that may be implemented as separate drivers in a layered driver environment as exists, for example, in the Microsoft Windows NT operating system. One component is called a conformer and will generate and assign to each packet in the packet flow at least one conformance time that signifies the earliest a packet may be sent and still conform to the network resource requirements associated with the flow. Many different conformance algorithms can be supported so that the best algorithm is used for a particular packet flow and the service requirements that it represents. Should it be necessary to actually hold a packet until the conformance time is met, a shaper component is used to delay the packets.

System And Method For Reducing Location Conflicts In A Database

View page
US Patent:
61637777, Dec 19, 2000
Filed:
Jun 23, 1998
Appl. No.:
9/103333
Inventors:
John R. Douceur - Bellevue WA
Yoram Bernet - Seattle WA
Ofer Bar - Newcastle WA
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 1730
US Classification:
707 8
Abstract:
The present invention is embodied in a system and method for reducing the likelihood of the location conflicts in a system with a database of records having an initial size. A logical location of each record is dependent upon data contained in each record and the database size and wherein a change in the database size by a resizing factor creates a likelihood of a location conflict between two records. The present invention reduces the likelihood of the location conflict by maintaining a first list of unused records, wherein the first list contains unused records that, if used, would not have location conflicts with any record currently used and would not have location conflicts with any other records contained in the first list. Also, a second list of unused records is maintained, wherein the second list contains unused records that are not contained in the first list. An unused record from the first list is selected if the first list is not empty when a datum is added to the database and an unused record from the second list is selected only if the first list is empty when a datum is added to the database.

Method And Computer Program Product For Classifying Network Communication Packets Processed In A Network Stack

View page
US Patent:
59567210, Sep 21, 1999
Filed:
Sep 19, 1997
Appl. No.:
8/933868
Inventors:
John R. Douceur - Bellevue WA
Yoram Bernet - Seattle WA
Ofer Bar - Newcastle WA
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 1730
US Classification:
707 10
Abstract:
A method and computer program product for classifying network communication packets being processed in a network stack. The computer program product is a centralized packet classifier that receives classification requests from drivers or other clients according to a defined interface. This reduces the cost for producing a driver since less code is required initially at development time as well as a corresponding reduction in maintenance costs. The present invention groups drivers or other clients that utilize a certain body of classification information into classification families. Further, reference patterns used to make classifications are stored in separate databases depending on whether they are specific or general. There exists a single specific pattern database for all specific reference patterns regardless of classification family having a constant search time and a general pattern database for each general reference pattern for each classification family defined to the system whose search time may vary according to the amount of information contained therein. When servicing a classification request, the packet classifier will first search the specific pattern database followed by a search in the appropriate general pattern database if necessary.
Control profile
Ofer Bar from Medford, MA, age ~60 Get Report