Search

Shahrokh Kashef Forough Sadjadi

from Fremont, CA
Age ~75

Shahrokh Sadjadi Phones & Addresses

  • 40717 Chiltern Dr, Fremont, CA 94539 (510) 651-5530
  • 45741 Vineyard Ave, Fremont, CA 94539 (510) 659-8053 (510) 659-9623 (510) 918-7447
  • Menlo Park, CA
  • Alameda, CA
  • El Dorado, CA

Work

Company: Cisco May 1998 Position: Software development manager and architect

Industries

Computer Networking

Resumes

Resumes

Shahrokh Sadjadi Photo 1

Software Development Manager And Architect

View page
Location:
Fremont, CA
Industry:
Computer Networking
Work:
Cisco
Software Development Manager and Architect

Publications

Us Patents

Controlling Access Of Concurrent Users Of Computer Resources In A Distributed System Using An Improved Semaphore Counting Approach

View page
US Patent:
7328263, Feb 5, 2008
Filed:
Jan 30, 2001
Appl. No.:
09/774906
Inventors:
Shahrokh Sadjadi - Fremont CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 15/16
G06F 17/00
US Classification:
709225, 709203, 709208, 709209, 709210, 709211, 709212, 709217, 709219, 709223, 707 8, 710200, 711151, 711152, 711153
Abstract:
A method of controlling concurrent users of a distributed resource on a network is disclosed. In one aspect, there are one or more local lock managers executing on corresponding hosts and cooperating as a distributed lock manager. The resource is limited to a maximum number of concurrent users. A user identification for each user is associated with one host. In response to a request associated with a particular user associated with a first host, a lock is requested from a first local lock manager process executing on the first host. A related method of handling a request for a count-limited resource includes receiving a request from a client process for the computer resource. If it is determined that the request exceeds a maximum count for the resource, then it is determined whether a current time is within a retry time period of the client's first request. If it is determined the current time is within the retry time period, then it is automatically determined again whether the request exceeds the maximum count for the resource. If it is determined that the request does not exceed the maximum count, then the resource is provided to the client process.

Instance-Based Authorization Utilizing Query Augmentation

View page
US Patent:
7483889, Jan 27, 2009
Filed:
Dec 1, 2006
Appl. No.:
11/607310
Inventors:
Alex Wang - Cary NC, US
Shahrokh Sadjadi - Fremont CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 7/00
US Classification:
707 4, 707 10
Abstract:
In one embodiment, a method for persistent data authorization includes receiving a query at a management device and identifying authorization constraints at the management device utilizing an authorization model. The authorization model includes at least one group hierarchy defining authorization based on a relationship between levels in the hierarchy. The query is modified based on the authorization constraints and the modified query is sent to the database. Data is received in response to the modified query and is configured for transmission from the management device without further filtering. The query received at the management device and the modified query are both configured for communication directly with the database with no modification to the database required for the modified query. A system and apparatus for persistent data authorization are also disclosed.

Controlling Access Of Concurrent Users Of Computer Resources In A Distributed System Using An Improved Semaphore Counting Approach

View page
US Patent:
7743146, Jun 22, 2010
Filed:
Dec 19, 2007
Appl. No.:
11/960376
Inventors:
Shahrokh Sadjadi - Fremont CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 15/16
G06F 17/00
US Classification:
709225, 709203, 709208, 709209, 709210, 709211, 709212, 709217, 709219, 709223, 707 8, 710200, 711151, 711152, 711153, 711168
Abstract:
A method of controlling concurrent users of a distributed resource on a network is disclosed. In one aspect, there are one or more local lock managers executing on corresponding hosts and cooperating as a distributed lock manager. The resource is limited to a maximum number of concurrent users. A user identification for each user is associated with one host. In response to a request associated with a particular user associated with a first host, a lock is requested from a first local lock manager process executing on the first host. A related method of handling a request for a count-limited resource includes receiving a request from a client process for the computer resource. If it is determined that the request exceeds a maximum count for the resource, then it is determined whether a current time is within a retry time period of the client's first request. If it is determined the current time is within the retry time period, then it is automatically determined again whether the request exceeds the maximum count for the resource. If it is determined that the request does not exceed the maximum count, then the resource is provided to the client process.

Providing Reconstructed Data Based On Stored Aggregate Data In Response To Queries For Unavailable Data

View page
US Patent:
8484212, Jul 9, 2013
Filed:
Jan 21, 2011
Appl. No.:
13/011782
Inventors:
Ying Liu - San Jose CA, US
Shahrokh Sadjadi - Fremont CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 17/30
G06F 17/00
US Classification:
707736, 707737, 707738, 707739, 707740
Abstract:
In an embodiment, a method comprises dividing collected data into data clusters based on proximity of the data and adjusting the clusters based on density of data in individual clusters. Based on first data points in a first cluster, a first average point in the first cluster is determined. Based on second data points in a second cluster, a second average point in the second cluster is determined. Aggregate data, comprising the first average point and the second average point, are stored in storage. Upon receiving a request to provide data for a particular coordinate, the reconstructed data point is determined by interpolating between the first average point and the second average point at the particular coordinate. Accordingly, aggregated data may be stored and when a request specifies data that was not actually stored, a reconstructed data point with an approximated data value may be provided as a substitute.

Method And Apparatus Providing Optimistic Locking Of Shared Computer Resources

View page
US Patent:
20050138375, Jun 23, 2005
Filed:
Jan 14, 2005
Appl. No.:
11/035635
Inventors:
Shahrokh Sadjadi - Fremont CA, US
International Classification:
H04L009/00
G06F015/16
US Classification:
713167000, 709226000
Abstract:
Techniques for concurrent access to a resource object, such as a database object, include generating a lock data structure for a particular resource object. The lock data structure includes data values for a resource object identification, a lock type, and a version number. The version number is related to a number of changes to the resource object since the lock data structure was generated. By carrying a lock version number in a lock data structure managed by a lock manager, improved optimistic locking is provided in a database. In particular, the approach enables introduction of optimistic locking to a legacy database without requiring burdensome changes to a database table schema.

Providing Reconstructed Data Based On Stored Aggregate Data In Response To Queries For Unavailable Data

View page
US Patent:
20130297609, Nov 7, 2013
Filed:
Jul 9, 2013
Appl. No.:
13/937766
Inventors:
Shahrokh Sadjadi - Fremont CA, US
International Classification:
G06F 17/30
US Classification:
707737
Abstract:
In an embodiment, a method comprises dividing collected data into data clusters based on proximity of the data and adjusting the clusters based on density of data in individual clusters. Based on first data points in a first cluster, a first average point in the first cluster is determined. Based on second data points in a second cluster, a second average point in the second cluster is determined. Aggregate data, comprising the first average point and the second average point, are stored in storage. Upon receiving a request to provide data for a particular coordinate, the reconstructed data point is determined by interpolating between the first average point and the second average point at the particular coordinate. Accordingly, aggregated data may be stored and when a request specifies data that was not actually stored, a reconstructed data point with an approximated data value may be provided as a substitute.

Method And Apparatus Providing Optimistic Locking Of Shared Computer Resources

View page
US Patent:
6850938, Feb 1, 2005
Filed:
Feb 8, 2001
Appl. No.:
09/781525
Inventors:
Shahrokh Sadjadi - Fremont CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 700
US Classification:
707 8, 707 9, 709248, 713165, 713167, 711150, 711151
Abstract:
Techniques for concurrent access to a resource object, such as a database, include generating a lock data structure for a particular resource object. The lock data structure includes data values for a resource object identification, a lock type, and a version number. The version number is related to a number of changes to the resource object since the lock data structure was generated. A request is received from a requesting process. The request is for a requested lock type for access to the particular resource object. It is determined whether to grant the request based on the requested lock type and the lock type in the lock data structure. By carrying a lock version number in a lock data structure managed by a lock manager, improved optimistic locking is provided in a database. In particular, the approach enables introduction of optimistic locking to a legacy database without requiring burdensome changes to a database table schema.

Providing Reconstructed Data Based On Stored Aggregate Data In Response To Queries For Unavailable Data

View page
US Patent:
20160371338, Dec 22, 2016
Filed:
Aug 31, 2016
Appl. No.:
15/253280
Inventors:
- San Jose CA, US
Shahrokh Sadjadi - Fremont CA, US
International Classification:
G06F 17/30
Abstract:
In an embodiment, a method comprises dividing collected data into data clusters based on proximity of the data and adjusting the clusters based on density of data in individual clusters. Based on first data points in a first cluster, a first average point in the first cluster is determined. Based on second data points in a second cluster, a second average point in the second cluster is determined. Aggregate data, comprising the first average point and the second average point, are stored in storage. Upon receiving a request to provide data for a particular coordinate, the reconstructed data point is determined by interpolating between the first average point and the second average point at the particular coordinate. Accordingly, aggregated data may be stored and when a request specifies data that was not actually stored, a reconstructed data point with an approximated data value may be provided as a substitute.
Shahrokh Kashef Forough Sadjadi from Fremont, CA, age ~75 Get Report