IBM Recruitment 2013 For Storage Development Engineer – ISTL

by SarkariNaukris.Org


Company Name: IBM India

Company Website:

Job ID: STG-0536733

Job Role: Software Designer

Job Category: Software Development & Support

Job Type: Full-time Regular

Job Area: Operations (all other)

Experience: 6 months to 2 years

Primary Location: Pune,India


1) Bachelor’s Degree

2) MS in Computer Science/Electronics/Electrical Engineering from a reputed institute

3) English: Fluent

Job Description:

India Storage Lab is part of IBM’s Systems and Technology group and works on various cutting-edge product offerings from IBM. The India Storage lab significantly contributes to various mid-range to Enterprise Storage products including SAN Volume Controller (Storage virtualization), Storwize V7000, Scale-Out NAS (SoNAS), General Parallel File System (GPFS) product development.

Required Technical Skills:

· Strong system programming skills in C and preferably worked in one or more of SAN, NAS, Block level protocols (SCSI, iSCSI, Fibre Channel, Fibre Channel over Ethernet), File level protocols ( NFS, CIFS), Replication, High Availability, Data Deduplication, Backup/Restore, NDMP, Virtualization

· Strong UNIX system programming skills, Kernel development experience is highly desirable

· Strong OS internals including multithreading, RPC, socket programming

· Strong knowledge of data structures and algorithms

· Strong expertise in debugging tools such as Crash, gdb, kdb, dbx, log analysis

· Strong problem solving skills

· Experience with any Source code control system and any Defect Tracking system

· Good understanding of Software development lifecycle and methodology ( Waterfall or Agile)

For More Details & Apply : Click Here

{ 2 comments… read them below or add one }

1 Rohit Kumar March 7, 2013 at 3:49 PM

My name is mr.Rohit kumar and i have done my B-tech in CSE field this year looking for job …. :)


2 Rohit Kumar March 7, 2013 at 3:51 PM

please reply me as well as it possible


Leave a Comment

Previous post:

Next post: