hadoop2 - Ambari registration failed ssL certification -


i'm unable complete registration when using ambari create 3 node cluster? on 3 nodes ambari-agent running sucessfully! ambari server , agents version

ambari-server-2.4.0.1-1.x86_64 ambari-agent-2.4.0.1-1.x86_64       connecting https://ip:8440/ca error 2017-09-11 08:02:05,762 netutil.py:88 - [ssl: certificate_verify_failed] certificate verify failed (_ssl.c:579) error 2017-09-11 08:02:05,762 netutil.py:89 - sslerror: failed connect. please check openssl library versions.  refer to: https://bugzilla.redhat.com/show_bug.cgi?id=1022468 more details. warning 2017-09-11 08:02:05,764 netutil.py:116 - server @ https://ip:8440 not reachable, sleeping 10 seconds... ', none)  connection ip closed. ssh command execution finished host=ip, exitcode=0 command end time 2017-09-11 08:02:08  registering server... registration server failed.

hdp version installing -2.5.3.0

node1 openssl versions: openssl-libs-1.0.2k-8.el7.x86_64 pyopenssl-0.13.1-3.el7.x86_64 openssl-1.0.2k-8.el7.x86_64 node2 openssl-libs-1.0.2k-8.el7.x86_64 pyopenssl-0.13.1-3.el7.x86_64 openssl-1.0.2k-8.el7.x86_64 node3 openssl-libs-1.0.2k-8.el7.x86_64 pyopenssl-0.13.1-3.el7.x86_64 openssl-1.0.2k-8.el7.x86_64

jdk version set 1.8 in /etc/ambari-server/conf/ambari.properties

java.home=/usr/jdk64/jdk1.8.0_77 java.releases=jdk1.8,jdk1.7 jce.download.supported=true jce.name=jce_policy-8.zip jdk.download.supported=true jdk.name=jdk-8u77-linux-x64.tar.gz jdk1.7.desc=oracle jdk 1.7 + java cryptography extension (jce) policy files 7 jdk1.7.dest-file=jdk-7u67-linux-x64.tar.gz jdk1.7.home=/usr/jdk64/ jdk1.7.jcpol-file=unlimitedjcepolicyjdk7.zip jdk1.7.jcpol-url=http://public-repo-1.hortonworks.com/artifacts/unlimitedjcepolicyjdk7.zip jdk1.7.re=(jdk.*)/jre jdk1.7.url=http://public-repo-1.hortonworks.com/artifacts/jdk-7u67-linux-x64.tar.gz jdk1.8.desc=oracle jdk 1.8 + java cryptography extension (jce) policy files 8 jdk1.8.dest-file=jdk-8u77-linux-x64.tar.gz jdk1.8.home=/usr/jdk64/ jdk1.8.jcpol-file=jce_policy-8.zip jdk1.8.jcpol-url=http://public-repo-1.hortonworks.com/artifacts/jce_policy-8.zip jdk1.8.re=(jdk.*)/jre jdk1.8.url=http://public-repo-1.hortonworks.com/artifacts/jdk-8u77-linux-x64.tar.gz


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more