当前位置:网站首页>cdh的hue上oozie启动报错,Cannot allocate containers as requested resource is greater than maximum allowed
cdh的hue上oozie启动报错,Cannot allocate containers as requested resource is greater than maximum allowed
2022-08-01 23:26:00 【我要用代码向我喜欢的女孩表白】
Caused by: org.apache.hadoop.ipc.RemoteException(org.apache.hadoop.yarn.exceptions.InvalidResourceRequestException): Invalid resource request! Cannot allocate containers as requested resource is greater than maximum allowed allocation. Requested resource type=[memory-mb], Requested resource=<memory:2048, vCores:1>, maximum allowed allocation=<memory:1213, vCores:4>, please note that maximum allowed allocation is calculated by scheduler based on maximum resource of registered NodeManagers, which might be less than configured maximum allocation=<memory:1213, vCores:4>

原因是,oozie启动资源默认,需要2GB
有2种方法
1.修改yarn资源调度的内存
2.修改oozie的默认值
这里我们修改oozie的默认值,将原来的2G改成了500MB

成功,没有报那个错误了

No Notification URL is defined. Therefore nothing to notify

我感觉很狗屁,于是我加大oozie的资源为2G,然后把yarn容器资源调成2.5G(在oozie和yarn的配置中)
oozie:
Default Launcher Memory
2G
yarn:
yarn.nodemanager.resource.memory-mb
2G
yarn.scheduler.maximum-allocation-mb
2.5G
网上说是正常的,在hue中是看不到原因。需要获取他的外部地址,去oozie页面看


跳转进hadoop,看日志


No child hadoop job is executed.
这是一个日志,相当于没有日志,只要是出错了,都会导致这种情况。
但是,上面的strErr说

Error: Error while compiling statement: FAILED: ParseException line 1:62 mismatched input '-' expecting ) near '2022' in add partition statement (state=42000,code=40000)
发现了问题,是我的sql问题,我分区的sql是yyyyMMdd,但是我传过去的动态时间是,用的oozie自带的

所以就没有办法格式化,于是我改成了他

成功了

边栏推荐
- 论文解读(GSAT)《Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanism》
- DRF generating serialization class code
- PostgreSQL 基础--常用命令
- 6133. Maximum number of packets
- 高效工作文档产出归类
- Department project source code sharing
- vscode hide menu bar
- cmd command
- 云原生DevOps环境搭建
- [Camp Experience Post] 2022 Cybersecurity Summer Camp
猜你喜欢
随机推荐
计算两点之间的距离
SQL Server(设计数据库--存储过程--触发器)
解决端口占用
6133. 分组的最大数量
Data Organization --- Chapter 5 Trees and Binary Trees --- The Concept of Binary Trees --- Application Questions
numpy.hstack
C语言——分支语句和循环语句
简单3D渲染器的制作
6134. 找到离给定两个节点最近的节点-力扣双百代码
Solve the port to take up
[LeetCode304周赛] 两道关于基环树的题 6134. 找到离给定两个节点最近的节点,6135. 图中的最长环
6132. All the elements in the array is equal to zero - quick sort method
Additional Features for Scripting
Chapter 19 Tips and Traps: Common Goofs for Novices
Calculate the distance between two points
从0到100:招生报名小程序开发笔记
IDEA常用插件
检查点是否在矩形内
Oracle 数据库设置为只读及读写
numpy.where









