# ocfs2_hb_ctl -I -d /dev/mapper/backup2-backup2

508C2154503344E78ACD6CD6B000000: 2 refs

#The previous step will list the amount of refs (references to heartbeat)

# ocfs2_hb_ctl -K -d /dev/mapper/backup2-backup2 UUID ( repeat until refs = 0)

# lvdisplay /dev/backup2/backup2
--- Logical volume ---
LV Name /dev/backup2/backup2
VG Name backup2
LV UUID vvv1e5-W2Is-FyAT-MCTk-KcFv-mn2X-000000
LV Write Access read/write
LV Status available
# open 1
LV Size 2.93 TB
Current LE 768000
Segments 1
Allocation inherit
Read ahead sectors auto
- currently set to 256
Block device 253:23

# vgdisplay backup2
--- Volume group ---
VG Name backup2
System ID
Format lvm2
Metadata Areas 1
Metadata Sequence No 2
VG Access read/write
VG Status resizable
MAX LV 0
Cur LV 1
Open LV 1
Max PV 0
Cur PV 1
Act PV 1
VG Size 3.00 TB
PE Size 4.00 MB
Total PE 786431
Alloc PE / Size 768000 / 2.93 TB
Free PE / Size 18431 / 72.00 GB
VG UUID wRIeok-ZcMP-qJDV-0Qmz-KoDE-X8bv-000000

# vgchange -an backup2 (make sure that backup2 is listed as being deactivated)

# vgexport backup2 (make volume groups unknown to the system)

# vgdisplay backup2

# multipath -ll >/tmp/multipath.txt (check multipath disk status)
# more /tmp/multipath.txt

backup2 (360060e80104b493004f3239b00000000) dm-42 HITACHI,DF600F
[size=3.0T][features=0][hwhandler=0][rw]
\_ round-robin 0 [prio=1][active]
\_ 4:0:0:23 sday 67:32 [active][ready]
\_ round-robin 0 [prio=0][enabled]
\_ 3:0:0:23 sdw 65:96 [active][ready]

# multipath -f backup2 (flush a multipath device map specified as parameter, if unused)

# vim /etc/multipath.conf (comment out and remove the WWID and alias for backup2)
multipath {
wwid 360060e80104b493004f3239b00000000
alias backup2
}

# echo 1 > /sys/class/scsi_disk/4:0:0:23/device/delete (remove scsi_disks)
# echo 1 > /sys/class/scsi_disk/3:0:0:23/device/delete (remove scsi_disks)

# dmesg |grep error
device-mapper: table: 253:15: multipath: error getting device
device-mapper: ioctl: error adding target to table
device-mapper: table: 253:15: multipath: error getting device
device-mapper: ioctl: error adding target to table

# multipath -ll |grep fail (remove one path from AMS one time, and check the all multipath device stats if active)

Remove LUN from OCFS2的更多相关文章

  1. Linux: How to delete a disk or LUN reference from /dev

    In AIX, there is rmdev command to remove a disk/LUN from /dev directory i.e to make the disk/LUN una ...

  2. EntityFramework Core 1.1 Add、Attach、Update、Remove方法如何高效使用详解

    前言 我比较喜欢安静,大概和我喜欢研究和琢磨技术原因相关吧,刚好到了元旦节,这几天可以好好学习下EF Core,同时在项目当中用到EF Core,借此机会给予比较深入的理解,这里我们只讲解和EF 6. ...

  3. [LeetCode] Remove K Digits 去掉K位数字

    Given a non-negative integer num represented as a string, remove k digits from the number so that th ...

  4. [LeetCode] Remove Duplicate Letters 移除重复字母

    Given a string which contains only lowercase letters, remove duplicate letters so that every letter ...

  5. [LeetCode] Remove Invalid Parentheses 移除非法括号

    Remove the minimum number of invalid parentheses in order to make the input string valid. Return all ...

  6. [LeetCode] Remove Linked List Elements 移除链表元素

    Remove all elements from a linked list of integers that have value val. Example Given: 1 --> 2 -- ...

  7. [LeetCode] Remove Duplicates from Sorted List 移除有序链表中的重复项

    Given a sorted linked list, delete all duplicates such that each element appear only once. For examp ...

  8. [LeetCode] Remove Duplicates from Sorted List II 移除有序链表中的重复项之二

    Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numb ...

  9. [LeetCode] Remove Duplicates from Sorted Array II 有序数组中去除重复项之二

    Follow up for "Remove Duplicates":What if duplicates are allowed at most twice? For exampl ...

随机推荐

  1. Codeforces Round #303 (Div. 2) D 贪心

    D. Queue time limit per test 1 second memory limit per test 256 megabytes input standard input outpu ...

  2. codeforces 192a

    link: http://codeforces.com/contest/330/problem/A brute force. /* ID: zypz4571 LANG: C++ TASK: 191a. ...

  3. leetcode 40 Combination Sum II --- java

    Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in ...

  4. HDU-5785 Interesting(Manacher算法+区间处理)

    题目大意:给一个字符串,求所有相邻两回文子串的外侧下标之积的和 题目分析:另L[i]为所有以 i 为右端点的回文字串的左端点之和,同理,另R[i]表示所有以 i 为左端点的回文子串的右端点之和.显然, ...

  5. Android项目——电话拨号器

    因为应用要使用手机的电话服务,所以要在清单文件AndroidManifest.xml中添加电话服务权限: <?xml version="1.0" encoding=" ...

  6. 黑马程序员——JAVA基础之数组

    ------- android培训.java培训.期待与您交流! ---------- 数组: 数组的定义: 数组是相同类型数据的集合, 描述的是相同类型的若干个数据按照一定的先后顺序排列组合而成,其 ...

  7. 【转】非常适用的Sourceinsight插件,提高效率事半功倍

    原文网址:http://www.cnblogs.com/wangqiguo/p/3713211.html 一直使用sourceinsight编辑C/C++代码,sourceinsight是一个非常好用 ...

  8. Java classes and class loading

    JAVA类加载器概念与线程类加载器 http://www.cnblogs.com/pfxiong/p/4118445.html http://stackoverflow.com/questions/2 ...

  9. ABBYY FineReader的图像编辑器功能使用方法

    日常工作中,有时可能需要对图像进行编辑,可是正常情况下大家都知道图像是不能直接编辑的,需要借助工具.ABBYY FineReader 12 OCR文字识别软件可以实现图像的手动编辑,接下来就具体给大家 ...

  10. OpenJudge计算概论-扩号匹配问题【这个用到了栈的思想】

    /*====================================================================== 扩号匹配问题 总时间限制: 1000ms 内存限制: ...