Search

Mohammad Banikazemi

from New York, NY
Age ~56
Get Report
Also known as:
Mohammed Banikavemi
Phone and address:
215 95Th St, New York, NY 10128
(646) 368-9822
Related to:
Mana M BanikazemiMm BanikazemiMana MirjanyArjenan AkbarAkbar MirjanyMana Mirjany, 52
Connected to:
Eve L Banilower, 63Gary J Banin, 69Kwadwo A Banin, 45Melissa A Baning, 42Zena A Banini, 66Melissa R Banion, 37Genaro G Baniqued, 66Jona Baniqued, 44Karen L Baniqued, 30Barbara M Banis, 87

Mohammad Banikazemi Phones & Addresses

  • 215 95Th St, New York, NY 10128 (646) 368-9822
  • 215 E 95Th St APT 3D, New York, NY 10128 (646) 368-9822
  • 2025 Broadway, New York, NY 10023 (212) 873-9287
  • 101 Curl Dr, Columbus, OH 43210
  • 101 Carpenter Ave, Mount Kisco, NY 10549 (914) 244-9022

Resumes

Resumes

Mohammad Banikazemi Photo 1

Research Staff Member Research

View page
Location:
New York, NY
Industry:
Computer Software
Work:
New York University Aug 2006 - Aug 2008
Adjunct Professor at Computer Science Department
Ibm Aug 2006 - Aug 2008
Research Staff Member Research
Education:
The Ohio State University 1996 - 2000
Doctorates, Doctor of Philosophy, Computer Science The Ohio State University 1994 - 1996
Master of Science, Masters, Electrical Engineering Isfahan University of Technology
Bachelors, Bachelor of Science, Electrical Engineering
Skills:
High Performance Computing
Cloud Computing
Networking
Computer Science
Programming
Storage
Software Design
Java
C++
Software Engineering
Matlab
Eclipse
Computer Architecture
Sql
Program Management
Distributed Systems
Artificial Intelligence
Algorithms
Openstack Networking
System Architecture
Perl
Software Development
Linux
C
Unix
Virtualization
Architecture
Python
Interests:
Civil Rights and Social Action
Social Services
Poverty Alleviation
Mohammad Banikazemi Photo 2

Research Staff Member

View page
Location:
New York, NY
Work:

Research Staff Member
Mohammad Banikazemi Photo 3

Research Staff Member At Ibm Research

View page
Position:
Research Staff Member at IBM
Location:
Greater New York City Area
Industry:
Computer Software
Work:
IBM since Dec 2000
Research Staff Member
New York University Aug 2006 - Aug 2008
Adjunct Professor at Computer Science Department
Education:
The Ohio State University 1996 - 2000
Ph.D., Computer Science The Ohio State University 1994 - 1996
M.S., Electrical Engineering Isfahan University of Technology
B.S., Electrical Engineering Alborz and Razi High School
Honor & Awards:
2010: Invention Achievement Award (Third Plateau), IBM 2008: Invention Achievement Award (Second Plateau), IBM 2006: Elected as Senior Member of IEEE and ACM 2005: Invention Achievement Award (First Plateau), IBM 2004: Listed in Who’s Who in America 2003: Research Division Award for technical contributions to the Memory Expansion Technology (MXT), IBM 2002: Invention Achievement Award, IBM 2000-2001: Presidential Fellowship, Ohio State University 2000: Outstanding Graduate Student Research Award, Department of Computer and Information Science, Ohio State University 1999-2000: IBM Cooperative Fellowship, International Business Machines Corporation 1989: Honor and Certificates for outstanding academic performance, Isfahan Univ. of Tech.

Publications

Us Patents

Method And System For Storage-Based Intrusion Detection And Recovery

View page
US Patent:
7506379, Mar 17, 2009
Filed:
Nov 4, 2004
Appl. No.:
10/980292
Inventors:
Bulent Abali - Tenafly NJ, US
Mohammad Banikazemi - New York NY, US
Dan Edward Poff - Mahopac NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 7/04
US Classification:
726 26
Abstract:
A method (and system) for detecting intrusions to stored data includes creating a point-time-copy of a logical unit, and comparing at least a portion of the point-time-copy with a previous copy of the logical unit. The method (and system) monitors access to a data storage system and detects an intrusion or any other intentional or unintentional, unwanted modification to data stored in the data storage system. The method (and system) also recovers data once an intrusion or other unwanted modification is detected.

Method For Installing Operating System On Remote Storage: Flash Deploy And Install Zone

View page
US Patent:
7698704, Apr 13, 2010
Filed:
Feb 17, 2005
Appl. No.:
11/059968
Inventors:
Bulent Abali - Tenafly NJ, US
James W. Arendt - Round Rock TX, US
Mohammad Banikazemi - New York NY, US
D. Scott Guthridge - New York NY, US
Dan E. Poff - Mahopac NY, US
Ziv Rafalovich - Yokneam, IL
Linda A. Riedle - Cary NC, US
Gary Valentin - Tel Aviv, IL
Nancy M. Wei - New City NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 9/445
G06F 15/16
G06F 15/177
G06F 15/173
G06F 13/00
US Classification:
717177, 717175, 717176, 709214, 709220, 709226, 711148, 711153
Abstract:
Two methods (native and clone) are used for installing software, such as an operating system, on client system(s) booting from shared storage. The native installation method configures an interconnection network to create an exclusive communication zone between the client system and the shared storage system and installs the operating system on the client system using the exclusive communication zone. After the software is installed, the method terminates the exclusive communication zone. The clone installation method utilizes a point-in-time copy feature of the shared storage system to clone an operating system drive instantaneously. After the drive is cloned, it is logically attached to a new client and the operating system is customized for that client.

Wear Reduction Methods By Using Compression/Decompression Techniques With Fast Random Access

View page
US Patent:
7944375, May 17, 2011
Filed:
Jun 2, 2009
Appl. No.:
12/476297
Inventors:
Bulent Abali - Hawthorne NY, US
Mohammad Banikazemi - Hawthorne NY, US
Dan E. Poff - Hawthorne NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
H03M 7/34
US Classification:
341 51, 711146
Abstract:
The present invention reduces the number of writes to a main memory to increase useful life of the main memory. To reduce the number of writes to the main memory, data to be written is written to a cache line in a lowest-level cache memory and in a higher-level cache memory(s). If the cache line in the lowest-level cache memory is full, the number of used cache lines in the lowest-level cache reaches a threshold, or there is a need for an empty entry in the lowest-level cache, a processor or a hardware unit compresses content of the cache line and stores the compressed content in the main memory. The present invention also provides LZB algorithm allowing decompression of data from an arbitrary location in compressed data stream with a bound on the number of characters which needs to be processed before a character or string of interest is processed.

Data Compression Using A Nested Hierachy Of Fixed Phrase Length Static And Dynamic Dictionaries

View page
US Patent:
7982636, Jul 19, 2011
Filed:
Aug 20, 2009
Appl. No.:
12/544726
Inventors:
Bulent Abali - Yorktown Heights NY, US
Mohammad Banikazemi - Yorktown Heights NY, US
Peter Franaszek - Yorktown Heights NY, US
Luis A. Lastras - Yorktown Heights NY, US
Dan E. Poff - Yorktown Heights NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
H03M 7/30
US Classification:
341 51, 341 87
Abstract:
The present invention describes lossless data compression/decompression methods and systems. A random access memory (RAM) operates as a static dictionary and includes commonly used strings/symbols/phrases/words. An input buffer operates as a dynamic dictionary and includes input strings/phrases/symbols/words. A set-associative cache memory operates as a hash table, and includes pointers pointing to the commonly used strings/symbols/phrases/words in the static dictionary and/or pointing to one or more of the input strings/phrases/symbols/words in the dynamic dictionary. Alternatively, the set-associative cache memory combines the dynamic dictionary, the static dictionary and the hash table. When encountering a symbol/phrase/string/word in the static or dynamic dictionary in an input stream, a compressor logic or module places a pointer pointing to the symbol/phrase/string/word at a current location on the output stream. The hash table may include phrases/symbols/strings/words and/or pointers pointing to phrases/symbols/strings/words.

Method For Providing Deferred Maintenance On Storage Subsystems

View page
US Patent:
8020032, Sep 13, 2011
Filed:
Dec 27, 2007
Appl. No.:
11/965015
Inventors:
Bulent Abali - Tenafly NJ, US
Mohammad Banikazemi - New York NY, US
James Lee Hafner - San Jose CA, US
Daniel Edward Poff - Mahopac NY, US
Krishnakumar Rao Surugucchi - Fremont CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 11/00
US Classification:
714 3, 714 61, 714 62, 714 42
Abstract:
A set of disks in a plurality of disk arrays are configured to have one or more spare partitions. Upon detecting a faulty disk in a faulty array, the method involves the steps of: (a) migrating data in the faulty array containing the faulty disk to one or more spare partitions; (b) reconfiguring the faulty array to form a new array without the faulty disk; (c) migrating data from one or more spare partitions in the set of disks to the reconfigured new array; (d) monitoring to identify when overall spare capacity falls below a predetermined threshold; and when the predetermined threshold is exceeded, scheduling a service visit for replacement of the failed disks.

Storage Redundant Array Of Independent Drives

View page
US Patent:
8060772, Nov 15, 2011
Filed:
Jan 4, 2008
Appl. No.:
11/969601
Inventors:
Bulent Abali - Tenafly NJ, US
Mohammad Banikazemi - New York NY, US
James L. Hafner - San Jose CA, US
Dan Edward Poff - Mahopac NY, US
Krishnakumar Surugucchi - Fremont CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 11/00
US Classification:
714 3, 711111
Abstract:
A computer implemented method, apparatus, and computer usable program product for managing redundant array of independent drives. In response to a failure of a hard disk in a first RAID array, the process calculates an amount of free capacity available across a set of remaining hard disks in the first RAID array. The set of remaining hard disks comprises every hard disk associated with the first RAID array except the failed disk. In response to a determination that the amount of free capacity is sufficient to re-create the first RAID array at a same RAID level, the process reconstructs the first RAID array using an amount of space in the set of remaining drives utilized by the first RAID array and the free capacity to form a new RAID array without utilizing a spare hard disk.

System And Method For Content Replication Detection And Elimination In Main Memory

View page
US Patent:
8074047, Dec 6, 2011
Filed:
May 16, 2008
Appl. No.:
12/122141
Inventors:
Bulent Abali - Tenafly NJ, US
Mohammad Banikazemi - New York NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 12/06
G06F 12/10
US Classification:
711206, 711200, 711202, 711203, 711205, 711207, 711 21, 711E12058
Abstract:
A system and method for effectively increasing the amount of data that can be stored in the main memory of a computer, particularly, by a hardware enhancement of a memory controller apparatus that detects duplicate memory contents and eliminates duplicate memory contents wherein the duplication and elimination are performed by hardware without imposing any penalty on the overall performance of the system.

Method For Performing Compressed I/O With Memory Expansion Technology

View page
US Patent:
20030188110, Oct 2, 2003
Filed:
Mar 27, 2002
Appl. No.:
10/108017
Inventors:
Bulent Abali - Tenafly NJ, US
Mohammad Banikazemi - Mount Kisco NY, US
Dan Poff - Mahopac NY, US
Charles Schulz - Ridgefield CT, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F012/00
US Classification:
711/154000
Abstract:
A method is provided for manipulating a compressed translation table in a memory expansion technology system. The method comprises swapping contents of an output buffer with contents of a compression buffer, disabling compression for compression translation table entries corresponding to the content swapped to the compression buffer, and packaging entries of a compression translation table corresponding to the contents swapped to the compression buffer, wherein packaged compression translation table entries are accessible to a computer system for addressing the contents swapped to the compression buffer.
Control profile
Mohammad Banikazemi from New York, NY, age ~56 Get Report